fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r536-tall-167987254500172
Last Updated
May 14, 2023

About the Execution of Marcie+red for EisenbergMcGuire-PT-10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4668.651 1800000.00 2724145.00 3209.90 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r536-tall-167987254500172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is EisenbergMcGuire-PT-10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-167987254500172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Mar 23 15:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 31 16:48 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1680364947905

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303301559
[2023-04-01 16:02:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-04-01 16:02:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-01 16:02:29] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2023-04-01 16:02:29] [INFO ] Transformed 1090 places.
[2023-04-01 16:02:29] [INFO ] Transformed 5200 transitions.
[2023-04-01 16:02:29] [INFO ] Found NUPN structural information;
[2023-04-01 16:02:29] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 439 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1090/1090 places, 5200/5200 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1090 transition count 5190
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1080 transition count 5190
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 310 Pre rules applied. Total rules applied 20 place count 1080 transition count 4880
Deduced a syphon composed of 310 places in 27 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 640 place count 770 transition count 4880
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 20 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 820 place count 680 transition count 4790
Applied a total of 820 rules in 320 ms. Remains 680 /1090 variables (removed 410) and now considering 4790/5200 (removed 410) transitions.
[2023-04-01 16:02:29] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:02:30] [INFO ] Computed 31 invariants in 17 ms
[2023-04-01 16:02:31] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2023-04-01 16:02:31] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:02:31] [INFO ] Invariant cache hit.
[2023-04-01 16:02:31] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:02:37] [INFO ] Implicit Places using invariants and state equation in 6745 ms returned []
Implicit Place search using SMT with State Equation took 8005 ms to find 0 implicit places.
[2023-04-01 16:02:37] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:02:37] [INFO ] Invariant cache hit.
[2023-04-01 16:02:39] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 680/1090 places, 4790/5200 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 9803 ms. Remains : 680/1090 places, 4790/5200 transitions.
Initial state reduction rules removed 10 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3248 ms. (steps per millisecond=3 ) properties (out of 4780) seen :628
Running SMT prover for 4152 properties.
[2023-04-01 16:02:42] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:02:42] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2343)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-01 16:03:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-01 16:03:11] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4152 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 557 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 332 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 680/680 places, 4790/4790 transitions.
Interrupted random walk after 111877 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=3 ) properties seen 46
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4106) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4100) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4099) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4099) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4097) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4096) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4096) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4095) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4095) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4095) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4094) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4094) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4094) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4093) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4092) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4091) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4091) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4091) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4091) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4091) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4090) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4090) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4090) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4088) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4088) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4088) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4088) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4088) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4088) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4087) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4087) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4087) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4087) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4087) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4086) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4086) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=16 ) properties (out of 4086) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4086) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4085) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4085) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4084) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4083) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4083) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4083) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4082) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4082) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4082) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4082) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4082) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4081) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4081) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 4080) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 4080) seen :0
Interrupted probabilistic random walk after 533269 steps, run timeout after 99002 ms. (steps per millisecond=5 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 34=1, 35=1, 36=1, 37=1, 38=1, 39=1, 40=1, 41=1, 42=1, 43=1, 44=1, 45=1, 46=1, 47=1, 48=1, 49=1, 50=1, 51=1, 52=1, 53=1, 54=1, 55=1, 56=1, 57=1, 58=1, 59=1, 60=1, 61=1, 62=1, 63=1, 64=1, 65=1, 66=1, 67=1, 68=1, 69=1, 70=1, 71=1, 72=1, 73=1, 74=1, 75=1, 76=1, 77=1, 78=1, 79=1, 185=1, 189=1, 190=1, 191=1, 201=1, 207=1, 209=1, 241=1, 242=1, 243=1, 244=1, 245=1, 246=1, 249=1, 251=1, 252=1, 253=1, 254=1, 256=1, 257=1, 260=1, 261=1, 262=1, 265=1, 269=1, 270=1, 272=1, 273=1, 278=1, 280=1, 281=1, 288=1, 303=1, 319=1, 320=1, 321=1, 322=1, 323=1, 324=1, 326=1, 327=1, 328=1, 330=1, 331=1, 332=1, 335=1, 336=1, 339=1, 340=1, 342=1, 343=1, 344=1, 348=1, 350=1, 351=1, 352=1, 358=1, 359=1, 381=1, 395=1, 396=1, 397=1, 398=1, 399=1, 400=1, 401=1, 404=1, 405=1, 406=1, 408=1, 409=1, 411=1, 412=1, 413=1, 414=1, 417=1, 419=1, 420=1, 421=1, 422=1, 427=1, 428=1, 429=1, 450=1, 451=1, 458=1, 473=1, 474=1, 475=1, 476=1, 477=1, 478=1, 480=1, 481=1, 482=1, 483=1, 484=1, 486=1, 488=1, 489=1, 490=1, 491=1, 492=1, 496=1, 497=1, 498=1, 499=1, 519=1, 520=1, 521=1, 528=1, 529=1, 537=1, 550=1, 551=1, 552=1, 553=1, 554=1, 555=1, 556=1, 558=1, 559=1, 560=1, 561=1, 562=1, 563=1, 566=1, 567=1, 568=1, 569=1, 570=1, 589=1, 590=1, 598=1, 599=1, 600=1, 607=1, 608=1, 616=1, 628=1, 629=1, 630=1, 631=1, 632=1, 633=1, 634=1, 636=1, 637=1, 638=1, 639=1, 640=1, 641=1, 659=1, 660=1, 662=1, 663=1, 668=1, 669=1, 670=1, 671=1, 677=1, 678=1, 679=1, 686=1, 687=1, 695=1, 699=1, 700=1, 701=1, 704=1, 706=1, 707=1, 708=1, 709=1, 710=1, 711=1, 712=1, 719=1, 720=1, 729=1, 732=1, 733=1, 734=1, 737=1, 738=1, 739=1, 740=1, 741=1, 746=1, 747=1, 748=1, 749=1, 755=1, 756=1, 757=1, 764=1, 765=1, 773=1, 1703=1, 1921=1, 2085=1, 2112=1, 2167=1, 2194=1, 2221=1, 2331=1, 2358=1, 2412=1, 2439=1, 2603=1, 2630=1, 2657=1, 2670=1, 2671=1, 2673=1, 2674=1, 2676=1, 2677=1, 2679=1, 2680=1, 2682=1, 2683=1, 2685=1, 2690=1, 2697=1, 2698=1, 2700=1, 2701=1, 2712=1, 2717=1, 2849=1, 2876=1, 2903=1, 2930=1, 2940=1, 2941=1, 2943=1, 2944=1, 2946=1, 2947=1, 2949=1, 2950=1, 2952=1, 2953=1, 2955=1, 2956=1, 2958=1, 2960=1, 3068=1, 3122=1, 3149=1, 3176=1, 3203=1, 3276=1, 3285=1, 3287=1, 3288=1, 3289=1, 3290=1, 3291=1, 3292=1, 3293=1, 3294=1, 3296=1, 3297=1, 3298=1, 3299=1, 3300=1, 3301=1, 3302=1, 3303=1, 3314=1, 3334=1, 3335=1, 3336=1, 3337=1, 3338=1, 3339=1, 3340=1, 3344=1, 3345=1, 3346=1, 3347=1, 3348=1, 3349=1, 3354=1, 3355=1, 3356=1, 3357=1, 3358=1, 3364=1, 3365=1, 3366=1, 3367=1, 3374=1, 3375=1, 3376=1, 3381=1, 3382=1, 3383=1, 3384=1, 3385=1, 3389=1, 3390=1, 3391=1, 3392=1, 3393=1, 3394=1, 3395=1, 3396=1, 3397=1, 3398=1, 3399=1, 3400=1, 3401=1, 3402=1, 3403=1, 3408=1, 3410=1, 3412=1, 3414=1, 3416=1, 3422=1, 3423=1, 3426=1, 3428=1, 3430=1, 3432=1, 3433=1, 3436=1, 3438=1, 3440=1, 3442=1, 3444=1, 3446=1, 3449=1, 3451=1, 3453=1, 3455=1, 3456=1, 3457=1, 3459=1, 3460=1, 3462=1, 3465=1, 3467=1, 3469=1, 3470=1, 3471=1, 3472=1, 3474=1, 3477=1, 3479=1, 3481=1, 3482=1, 3483=1, 3484=1, 3486=1, 3487=1, 3488=1, 3489=1, 3490=1, 3491=1, 3493=1, 3495=1, 3497=1, 3498=1, 3499=1, 3500=1, 3501=1, 3502=1, 3503=1, 3504=1, 3505=1, 3507=1, 3509=1, 3510=1, 3512=1, 3514=1, 3516=1, 3517=1, 3518=1, 3519=1, 3520=1, 3521=1, 3522=1, 3523=1, 3524=1, 3525=1, 3526=1, 3528=1, 3530=1, 3532=1, 3534=1, 3535=1, 3536=1, 3537=1, 3538=1, 3539=1, 3540=1, 3541=1, 3542=1, 3543=1, 3545=1, 3548=1, 3549=1, 3550=1, 3552=1, 3553=1, 3554=1, 3555=1, 3556=1, 3557=1, 3558=1, 3559=1, 3785=1, 3794=1, 3803=1, 3805=1, 3806=1, 3807=1, 3808=1, 3809=1, 3810=1, 3811=1, 3812=1, 3816=1, 3818=1, 3820=1, 3822=1, 3824=1, 3826=1, 3828=1, 3830=1, 3831=1, 3833=1, 3834=1, 3836=1, 3837=1, 3839=1, 3840=1, 3842=1, 3843=1, 3845=1, 3847=1, 3848=1, 3849=1, 3850=1, 3852=1, 3853=1, 3880=1, 3882=1, 3883=1, 3885=1, 3886=1, 3887=1, 3889=1, 3890=1, 3892=1, 3893=1, 3895=1, 3896=1, 3898=1, 3899=1, 3901=1, 3902=1, 3904=1, 3905=1, 3907=1, 3909=1, 3910=1, 3911=1, 3912=1, 3914=1, 3916=1, 3917=1, 3918=1, 3919=1, 3921=1, 3922=1, 3924=1, 3925=1, 3927=1, 3928=1, 3930=1, 3932=1, 3933=1, 3935=1, 3936=1, 3938=1, 3939=1, 3941=1, 3942=1, 3943=1, 3945=1, 3946=1, 3948=1, 3949=1, 3951=1, 3952=1, 3954=1, 3955=1, 3957=1, 3958=1, 3960=1, 3961=1, 3963=1, 3964=1, 3966=1, 3967=1, 3969=1, 3970=1, 3971=1, 3973=1, 3974=1, 3976=1, 3978=1, 3979=1, 3980=1, 3981=1, 3983=1, 3984=1, 3986=1, 3988=1, 3989=1, 3991=1, 3992=1, 3994=1, 3995=1, 3997=1, 3998=1, 3999=1, 4001=1, 4002=1, 4004=1, 4005=1, 4007=1, 4008=1, 4010=1, 4011=1, 4013=1, 4014=1, 4016=1, 4017=1, 4019=1, 4020=1, 4022=1, 4023=1, 4025=1, 4026=1, 4027=1, 4028=1, 4030=1, 4031=1, 4033=1, 4034=1, 4036=1, 4037=1, 4039=1, 4041=1, 4042=1, 4043=1, 4045=1, 4046=1, 4048=1, 4049=1, 4051=1, 4052=1, 4054=1, 4055=1, 4056=1, 4058=1, 4059=1, 4061=1, 4062=1, 4064=1, 4065=1, 4067=1, 4068=1, 4070=1, 4071=1, 4073=1, 4074=1, 4075=1, 4076=1, 4077=1, 4078=1, 4079=1}
Probabilistic random walk after 533269 steps, saw 403067 distinct states, run finished after 99005 ms. (steps per millisecond=5 ) properties seen :665
Running SMT prover for 3415 properties.
[2023-04-01 16:05:24] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:05:24] [INFO ] Invariant cache hit.
[2023-04-01 16:06:00] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-04-01 16:06:00] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:09:12] [INFO ] After 156415ms SMT Verify possible using state equation in real domain returned unsat :0 sat :375 real:3040
[2023-04-01 16:09:12] [INFO ] State equation strengthened by 1246 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-01 16:09:12] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-01 16:09:12] [INFO ] After 225048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3415 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 433 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 244 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 680/680 places, 4790/4790 transitions.
Interrupted random walk after 134270 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Interrupted probabilistic random walk after 539583 steps, run timeout after 93001 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 539583 steps, saw 407536 distinct states, run finished after 93003 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 3415 properties.
[2023-04-01 16:11:17] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:11:17] [INFO ] Invariant cache hit.
[2023-04-01 16:11:52] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:11:52] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:15:04] [INFO ] After 156670ms SMT Verify possible using state equation in real domain returned unsat :0 sat :527 real:2888
[2023-04-01 16:15:04] [INFO ] State equation strengthened by 1246 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-01 16:15:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-01 16:15:04] [INFO ] After 225048ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3415 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 433 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 285 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 680/680 places, 4790/4790 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 219 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
[2023-04-01 16:15:05] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:15:05] [INFO ] Invariant cache hit.
[2023-04-01 16:15:05] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-04-01 16:15:05] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:15:05] [INFO ] Invariant cache hit.
[2023-04-01 16:15:06] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:15:07] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
[2023-04-01 16:15:07] [INFO ] Redundant transitions in 377 ms returned []
[2023-04-01 16:15:07] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:15:07] [INFO ] Invariant cache hit.
[2023-04-01 16:15:09] [INFO ] Dead Transitions using invariants and state equation in 1419 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4198 ms. Remains : 680/680 places, 4790/4790 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3537 ms. (steps per millisecond=28 ) properties (out of 433) seen :224
Running SMT prover for 209 properties.
[2023-04-01 16:15:12] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:15:12] [INFO ] Invariant cache hit.
[2023-04-01 16:15:13] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:15:13] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:15:13] [INFO ] After 563ms SMT Verify possible using state equation in real domain returned unsat :0 sat :209
[2023-04-01 16:15:13] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:15:16] [INFO ] After 2246ms SMT Verify possible using 1246 Read/Feed constraints in real domain returned unsat :0 sat :209
[2023-04-01 16:15:16] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 5 ms to minimize.
[2023-04-01 16:15:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 512 ms
[2023-04-01 16:15:19] [INFO ] Deduced a trap composed of 133 places in 343 ms of which 1 ms to minimize.
[2023-04-01 16:15:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-04-01 16:15:28] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 1 ms to minimize.
[2023-04-01 16:15:28] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2023-04-01 16:15:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-04-01 16:15:28] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2023-04-01 16:15:29] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2023-04-01 16:15:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 381 ms
[2023-04-01 16:15:29] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2023-04-01 16:15:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2023-04-01 16:15:30] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 1 ms to minimize.
[2023-04-01 16:15:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-01 16:15:30] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 1 ms to minimize.
[2023-04-01 16:15:30] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2023-04-01 16:15:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 426 ms
[2023-04-01 16:15:31] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-01 16:15:31] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-04-01 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 405 ms
[2023-04-01 16:15:31] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 0 ms to minimize.
[2023-04-01 16:15:32] [INFO ] Deduced a trap composed of 13 places in 136 ms of which 1 ms to minimize.
[2023-04-01 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 456 ms
[2023-04-01 16:15:32] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-04-01 16:15:32] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 0 ms to minimize.
[2023-04-01 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-04-01 16:15:33] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 1 ms to minimize.
[2023-04-01 16:15:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-04-01 16:15:34] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 0 ms to minimize.
[2023-04-01 16:15:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2023-04-01 16:15:35] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 1 ms to minimize.
[2023-04-01 16:15:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-04-01 16:15:36] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-01 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-04-01 16:15:36] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-01 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2023-04-01 16:15:36] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-01 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-01 16:15:36] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-01 16:15:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-04-01 16:15:37] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2023-04-01 16:15:37] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 367 ms
[2023-04-01 16:15:38] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-04-01 16:15:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-01 16:15:40] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2023-04-01 16:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-04-01 16:15:42] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 0 ms to minimize.
[2023-04-01 16:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-04-01 16:15:43] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-04-01 16:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 260 ms
[2023-04-01 16:15:44] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-01 16:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-01 16:15:46] [INFO ] After 32219ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:209
[2023-04-01 16:15:46] [INFO ] After 33035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:209
[2023-04-01 16:15:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:15:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:15:46] [INFO ] After 614ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :209
[2023-04-01 16:15:49] [INFO ] After 2740ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :209
[2023-04-01 16:15:49] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 0 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2023-04-01 16:15:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1219 ms
[2023-04-01 16:15:51] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-01 16:15:51] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-01 16:15:51] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-01 16:15:51] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 1 ms to minimize.
[2023-04-01 16:15:51] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2023-04-01 16:15:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 754 ms
[2023-04-01 16:15:52] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 0 ms to minimize.
[2023-04-01 16:15:52] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 1 ms to minimize.
[2023-04-01 16:15:52] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 0 ms to minimize.
[2023-04-01 16:15:52] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2023-04-01 16:15:53] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2023-04-01 16:15:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1316 ms
[2023-04-01 16:15:53] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 1 ms to minimize.
[2023-04-01 16:15:53] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 0 ms to minimize.
[2023-04-01 16:15:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 414 ms
[2023-04-01 16:15:53] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 0 ms to minimize.
[2023-04-01 16:15:53] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2023-04-01 16:15:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-04-01 16:15:54] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-01 16:15:54] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2023-04-01 16:15:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 355 ms
[2023-04-01 16:15:54] [INFO ] Deduced a trap composed of 70 places in 139 ms of which 0 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 0 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 1 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Deduced a trap composed of 68 places in 112 ms of which 4 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2023-04-01 16:15:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1124 ms
[2023-04-01 16:15:56] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2023-04-01 16:15:56] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 0 ms to minimize.
[2023-04-01 16:15:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2023-04-01 16:15:57] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:15:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2023-04-01 16:15:57] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 0 ms to minimize.
[2023-04-01 16:15:57] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2023-04-01 16:15:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2023-04-01 16:15:58] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2023-04-01 16:15:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-04-01 16:15:59] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-04-01 16:16:00] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
[2023-04-01 16:16:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-01 16:16:01] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2023-04-01 16:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-04-01 16:16:01] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2023-04-01 16:16:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-04-01 16:16:02] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-04-01 16:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-04-01 16:16:03] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2023-04-01 16:16:03] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2023-04-01 16:16:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-04-01 16:16:04] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-01 16:16:05] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 0 ms to minimize.
[2023-04-01 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-04-01 16:16:06] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 1 ms to minimize.
[2023-04-01 16:16:06] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2023-04-01 16:16:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2023-04-01 16:16:10] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2023-04-01 16:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2023-04-01 16:16:11] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2023-04-01 16:16:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-04-01 16:16:12] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 0 ms to minimize.
[2023-04-01 16:16:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-04-01 16:16:13] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2023-04-01 16:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-04-01 16:16:18] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 0 ms to minimize.
[2023-04-01 16:16:18] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 1 ms to minimize.
[2023-04-01 16:16:18] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 0 ms to minimize.
[2023-04-01 16:16:19] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2023-04-01 16:16:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 667 ms
[2023-04-01 16:16:19] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2023-04-01 16:16:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-04-01 16:16:19] [INFO ] After 32866ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :209
Attempting to minimize the solution found.
Minimization took 2918 ms.
[2023-04-01 16:16:22] [INFO ] After 36616ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :209
Interrupted random walk after 136610 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 3415) seen :0
Interrupted probabilistic random walk after 539484 steps, run timeout after 93002 ms. (steps per millisecond=5 ) properties seen :{}
Probabilistic random walk after 539484 steps, saw 407459 distinct states, run finished after 93003 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 3415 properties.
[2023-04-01 16:18:26] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:18:26] [INFO ] Invariant cache hit.
[2023-04-01 16:19:01] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-04-01 16:19:01] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:22:11] [INFO ] After 222019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3415
[2023-04-01 16:22:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 18 ms returned sat
[2023-04-01 16:22:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:25:41] [INFO ] After 145724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3415
[2023-04-01 16:25:41] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:25:56] [INFO ] After 14720ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :3415
[2023-04-01 16:25:56] [INFO ] After 14721ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3415
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-01 16:25:56] [INFO ] After 225015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3415
Fused 3415 Parikh solutions to 3384 different solutions.
Parikh walk visited 0 properties in 29999 ms.
Support contains 433 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 224 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 680/680 places, 4790/4790 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Applied a total of 0 rules in 214 ms. Remains 680 /680 variables (removed 0) and now considering 4790/4790 (removed 0) transitions.
[2023-04-01 16:26:27] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:26:27] [INFO ] Invariant cache hit.
[2023-04-01 16:26:27] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-04-01 16:26:27] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:26:27] [INFO ] Invariant cache hit.
[2023-04-01 16:26:27] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:26:29] [INFO ] Implicit Places using invariants and state equation in 1841 ms returned []
Implicit Place search using SMT with State Equation took 2052 ms to find 0 implicit places.
[2023-04-01 16:26:29] [INFO ] Redundant transitions in 278 ms returned []
[2023-04-01 16:26:29] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:26:29] [INFO ] Invariant cache hit.
[2023-04-01 16:26:30] [INFO ] Dead Transitions using invariants and state equation in 1396 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3949 ms. Remains : 680/680 places, 4790/4790 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3348 ms. (steps per millisecond=29 ) properties (out of 433) seen :222
Running SMT prover for 211 properties.
[2023-04-01 16:26:34] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:26:34] [INFO ] Invariant cache hit.
[2023-04-01 16:26:34] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-01 16:26:34] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:26:34] [INFO ] After 597ms SMT Verify possible using state equation in real domain returned unsat :0 sat :211
[2023-04-01 16:26:34] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:26:37] [INFO ] After 2070ms SMT Verify possible using 1246 Read/Feed constraints in real domain returned unsat :0 sat :211
[2023-04-01 16:26:37] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-01 16:26:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2023-04-01 16:26:38] [INFO ] Deduced a trap composed of 208 places in 314 ms of which 1 ms to minimize.
[2023-04-01 16:26:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 445 ms
[2023-04-01 16:26:44] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-01 16:26:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2023-04-01 16:26:45] [INFO ] Deduced a trap composed of 247 places in 322 ms of which 0 ms to minimize.
[2023-04-01 16:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 462 ms
[2023-04-01 16:26:49] [INFO ] Deduced a trap composed of 35 places in 218 ms of which 0 ms to minimize.
[2023-04-01 16:26:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2023-04-01 16:26:49] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 1 ms to minimize.
[2023-04-01 16:26:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2023-04-01 16:26:50] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-04-01 16:26:51] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 1 ms to minimize.
[2023-04-01 16:26:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-01 16:26:51] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 0 ms to minimize.
[2023-04-01 16:26:51] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 0 ms to minimize.
[2023-04-01 16:26:51] [INFO ] Deduced a trap composed of 20 places in 128 ms of which 1 ms to minimize.
[2023-04-01 16:26:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 625 ms
[2023-04-01 16:26:52] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2023-04-01 16:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-01 16:26:52] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 1 ms to minimize.
[2023-04-01 16:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-04-01 16:26:53] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:26:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-04-01 16:26:53] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 0 ms to minimize.
[2023-04-01 16:26:54] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 0 ms to minimize.
[2023-04-01 16:26:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 401 ms
[2023-04-01 16:26:54] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2023-04-01 16:26:54] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 1 ms to minimize.
[2023-04-01 16:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-04-01 16:26:55] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2023-04-01 16:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 283 ms
[2023-04-01 16:26:55] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 1 ms to minimize.
[2023-04-01 16:26:55] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 0 ms to minimize.
[2023-04-01 16:26:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 450 ms
[2023-04-01 16:26:56] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2023-04-01 16:26:56] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 0 ms to minimize.
[2023-04-01 16:26:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
[2023-04-01 16:26:57] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 1 ms to minimize.
[2023-04-01 16:26:57] [INFO ] Deduced a trap composed of 17 places in 306 ms of which 0 ms to minimize.
[2023-04-01 16:26:58] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 0 ms to minimize.
[2023-04-01 16:26:58] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 0 ms to minimize.
[2023-04-01 16:26:58] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-01 16:26:58] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 0 ms to minimize.
[2023-04-01 16:26:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1795 ms
[2023-04-01 16:26:59] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2023-04-01 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-04-01 16:26:59] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-01 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-01 16:26:59] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 0 ms to minimize.
[2023-04-01 16:26:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2023-04-01 16:27:00] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-01 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-01 16:27:00] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-01 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-04-01 16:27:00] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-01 16:27:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-01 16:27:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-01 16:27:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-04-01 16:27:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-01 16:27:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-04-01 16:27:04] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-04-01 16:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-01 16:27:06] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 0 ms to minimize.
[2023-04-01 16:27:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-04-01 16:27:08] [INFO ] After 33956ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:211
[2023-04-01 16:27:08] [INFO ] After 34786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:211
[2023-04-01 16:27:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:27:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:27:09] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :211
[2023-04-01 16:27:12] [INFO ] After 2774ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :211
[2023-04-01 16:27:12] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 0 ms to minimize.
[2023-04-01 16:27:13] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 0 ms to minimize.
[2023-04-01 16:27:13] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2023-04-01 16:27:13] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-01 16:27:13] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 0 ms to minimize.
[2023-04-01 16:27:14] [INFO ] Deduced a trap composed of 35 places in 137 ms of which 0 ms to minimize.
[2023-04-01 16:27:14] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 1 ms to minimize.
[2023-04-01 16:27:14] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 0 ms to minimize.
[2023-04-01 16:27:14] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-01 16:27:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2118 ms
[2023-04-01 16:27:14] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-04-01 16:27:15] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-01 16:27:15] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-01 16:27:15] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-04-01 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 684 ms
[2023-04-01 16:27:15] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-01 16:27:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-01 16:27:16] [INFO ] Deduced a trap composed of 27 places in 116 ms of which 0 ms to minimize.
[2023-04-01 16:27:16] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-04-01 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-04-01 16:27:16] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 0 ms to minimize.
[2023-04-01 16:27:16] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 0 ms to minimize.
[2023-04-01 16:27:16] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2023-04-01 16:27:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 550 ms
[2023-04-01 16:27:17] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2023-04-01 16:27:18] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-04-01 16:27:18] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2023-04-01 16:27:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2023-04-01 16:27:19] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:27:19] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 0 ms to minimize.
[2023-04-01 16:27:19] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2023-04-01 16:27:19] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 0 ms to minimize.
[2023-04-01 16:27:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 675 ms
[2023-04-01 16:27:20] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 0 ms to minimize.
[2023-04-01 16:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-01 16:27:20] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2023-04-01 16:27:20] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2023-04-01 16:27:21] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-01 16:27:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 529 ms
[2023-04-01 16:27:26] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2023-04-01 16:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-04-01 16:27:27] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 0 ms to minimize.
[2023-04-01 16:27:27] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:27:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2023-04-01 16:27:27] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2023-04-01 16:27:27] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 0 ms to minimize.
[2023-04-01 16:27:27] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2023-04-01 16:27:28] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-04-01 16:27:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 713 ms
[2023-04-01 16:27:29] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 0 ms to minimize.
[2023-04-01 16:27:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-04-01 16:27:30] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:27:30] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-04-01 16:27:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2023-04-01 16:27:31] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2023-04-01 16:27:31] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2023-04-01 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-04-01 16:27:31] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:27:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-04-01 16:27:33] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2023-04-01 16:27:33] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 0 ms to minimize.
[2023-04-01 16:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-04-01 16:27:33] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2023-04-01 16:27:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-01 16:27:34] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2023-04-01 16:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-04-01 16:27:38] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:27:38] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-04-01 16:27:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 311 ms
[2023-04-01 16:27:40] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 0 ms to minimize.
[2023-04-01 16:27:40] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2023-04-01 16:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2023-04-01 16:27:41] [INFO ] Deduced a trap composed of 68 places in 84 ms of which 0 ms to minimize.
[2023-04-01 16:27:41] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2023-04-01 16:27:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 314 ms
[2023-04-01 16:27:41] [INFO ] After 32121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :211
Attempting to minimize the solution found.
Minimization took 2935 ms.
[2023-04-01 16:27:44] [INFO ] After 35936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :211
Finished random walk after 346 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 240 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=120 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 152 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 544 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=136 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 843 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=281 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 894 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1169 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=292 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1314 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=219 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1295 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=259 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1507 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 542 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 524 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 387 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=193 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 770 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=256 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 837 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=209 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1007 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1460 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=292 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1302 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=260 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1550 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=258 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 341 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=170 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 709 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 852 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=284 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 804 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=268 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1075 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=215 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1220 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=244 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1401 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=280 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1674 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=279 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 233 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=233 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 656 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=218 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 841 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=210 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 850 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=212 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1162 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=232 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1272 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=254 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1610 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=268 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1683 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=280 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 169 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 364 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=182 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 811 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1023 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 932 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=233 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1423 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=284 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1530 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1474 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=294 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 255 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=127 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 321 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 605 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=201 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1007 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=251 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1147 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=229 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1320 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=264 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1489 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=297 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1814 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=302 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 137 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 519 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 506 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=168 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 715 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=238 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 992 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=248 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1240 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=248 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1379 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=275 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1757 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=292 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 201 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=201 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 370 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=123 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 504 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=252 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 618 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=206 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 815 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=203 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1184 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=236 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1554 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=310 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1485 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=247 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 246 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=123 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 521 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 487 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=162 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 646 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=215 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1023 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1080 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=270 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1533 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1748 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=291 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 345 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=172 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 509 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 710 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=236 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 857 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=285 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1198 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=239 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1207 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=241 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1516 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=303 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 213 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 462 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=231 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 656 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=218 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 717 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=239 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 943 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=235 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1045 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=261 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1160 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=232 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1417 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=236 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 385429 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385429 steps, saw 295245 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:27:49] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:27:49] [INFO ] Invariant cache hit.
[2023-04-01 16:27:49] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:27:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:27:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 15 ms returned sat
[2023-04-01 16:27:50] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:27:50] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:27:50] [INFO ] After 171ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:27:50] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-01 16:27:50] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-01 16:27:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 298 ms
[2023-04-01 16:27:50] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-01 16:27:50] [INFO ] After 1066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 217 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432355 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432355 steps, saw 283302 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:27:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:27:53] [INFO ] Computed 31 invariants in 17 ms
[2023-04-01 16:27:53] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:27:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:27:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:27:54] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:27:54] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:27:54] [INFO ] After 95ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:27:54] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-01 16:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-01 16:27:54] [INFO ] After 234ms 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-04-01 16:27:54] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 138 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 135 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:27:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:27:54] [INFO ] Invariant cache hit.
[2023-04-01 16:27:55] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-04-01 16:27:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:27:55] [INFO ] Invariant cache hit.
[2023-04-01 16:27:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:27:58] [INFO ] Implicit Places using invariants and state equation in 3550 ms returned []
Implicit Place search using SMT with State Equation took 4115 ms to find 0 implicit places.
[2023-04-01 16:27:59] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-01 16:27:59] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:27:59] [INFO ] Invariant cache hit.
[2023-04-01 16:28:00] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5457 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 3 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 0 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 649 place count 171 transition count 431
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 89 rules applied. Total rules applied 738 place count 171 transition count 342
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 756 place count 162 transition count 342
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 765 place count 162 transition count 333
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 775 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 866 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 957 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 967 place count 71 transition count 232
Applied a total of 967 rules in 64 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:28:00] [INFO ] Computed 21 invariants in 0 ms
[2023-04-01 16:28:00] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:28:00] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:28:00] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:00] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:28:00] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 350 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=175 )
Parikh walk visited 0 properties in 1 ms.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 519 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=173 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 731 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=243 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 882 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=220 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1171 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=234 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1227 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1454 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1463 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=243 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389356 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389356 steps, saw 298100 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:03] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:28:03] [INFO ] Computed 31 invariants in 20 ms
[2023-04-01 16:28:03] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:28:03] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:28:04] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:04] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:28:04] [INFO ] After 164ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:04] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-04-01 16:28:04] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-01 16:28:04] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-01 16:28:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 412 ms
[2023-04-01 16:28:04] [INFO ] After 623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-01 16:28:04] [INFO ] After 1155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 179 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 7174 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1195 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384659 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384659 steps, saw 294648 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:08] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:28:08] [INFO ] Invariant cache hit.
[2023-04-01 16:28:08] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:28:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:28:08] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:08] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:28:09] [INFO ] After 178ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:09] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-01 16:28:09] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-01 16:28:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 302 ms
[2023-04-01 16:28:09] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-04-01 16:28:09] [INFO ] After 1065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 190 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432003 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 432003 steps, saw 283057 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:28:12] [INFO ] Computed 31 invariants in 13 ms
[2023-04-01 16:28:12] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:12] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-04-01 16:28:12] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:28:13] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:13] [INFO ] After 97ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:13] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-01 16:28:13] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-01 16:28:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2023-04-01 16:28:13] [INFO ] After 338ms 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-04-01 16:28:13] [INFO ] After 709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 138 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 137 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:28:13] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:13] [INFO ] Invariant cache hit.
[2023-04-01 16:28:14] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-04-01 16:28:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:14] [INFO ] Invariant cache hit.
[2023-04-01 16:28:14] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:17] [INFO ] Implicit Places using invariants and state equation in 3541 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
[2023-04-01 16:28:17] [INFO ] Redundant transitions in 182 ms returned []
[2023-04-01 16:28:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:17] [INFO ] Invariant cache hit.
[2023-04-01 16:28:19] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5451 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 43 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:28:19] [INFO ] Computed 21 invariants in 0 ms
[2023-04-01 16:28:19] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:28:19] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:28:19] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:19] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-01 16:28:19] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 385165 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385165 steps, saw 295024 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:22] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:28:22] [INFO ] Computed 31 invariants in 13 ms
[2023-04-01 16:28:22] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:28:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:28:22] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:22] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:28:23] [INFO ] After 162ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:23] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2023-04-01 16:28:23] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-01 16:28:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-01 16:28:23] [INFO ] After 481ms 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-04-01 16:28:23] [INFO ] After 1026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 154 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431299 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431299 steps, saw 282560 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:28:26] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:28:26] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:28:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:28:26] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:27] [INFO ] After 105ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:27] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2023-04-01 16:28:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-01 16:28:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 215 ms
[2023-04-01 16:28:27] [INFO ] After 348ms 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-04-01 16:28:27] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 126 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:28:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:27] [INFO ] Invariant cache hit.
[2023-04-01 16:28:28] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-04-01 16:28:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:28] [INFO ] Invariant cache hit.
[2023-04-01 16:28:28] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:31] [INFO ] Implicit Places using invariants and state equation in 3841 ms returned []
Implicit Place search using SMT with State Equation took 4391 ms to find 0 implicit places.
[2023-04-01 16:28:32] [INFO ] Redundant transitions in 184 ms returned []
[2023-04-01 16:28:32] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:32] [INFO ] Invariant cache hit.
[2023-04-01 16:28:33] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5751 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 1 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 30 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:28:33] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:28:33] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:33] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:28:33] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:28:33] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:33] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:28:33] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386518 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386518 steps, saw 296037 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:36] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:28:36] [INFO ] Computed 31 invariants in 20 ms
[2023-04-01 16:28:36] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:28:36] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:28:37] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:37] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:28:37] [INFO ] After 176ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:37] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2023-04-01 16:28:37] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 0 ms to minimize.
[2023-04-01 16:28:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-01 16:28:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2023-04-01 16:28:37] [INFO ] After 661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-01 16:28:37] [INFO ] After 1201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 149 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432586 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432586 steps, saw 283457 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:28:40] [INFO ] Computed 31 invariants in 10 ms
[2023-04-01 16:28:41] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:28:41] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:28:41] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:41] [INFO ] After 106ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:41] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-01 16:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-01 16:28:41] [INFO ] After 257ms 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-04-01 16:28:41] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 127 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:28:41] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:41] [INFO ] Invariant cache hit.
[2023-04-01 16:28:42] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-04-01 16:28:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:42] [INFO ] Invariant cache hit.
[2023-04-01 16:28:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:45] [INFO ] Implicit Places using invariants and state equation in 3495 ms returned []
Implicit Place search using SMT with State Equation took 4044 ms to find 0 implicit places.
[2023-04-01 16:28:46] [INFO ] Redundant transitions in 186 ms returned []
[2023-04-01 16:28:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:46] [INFO ] Invariant cache hit.
[2023-04-01 16:28:47] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5409 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 29 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:28:47] [INFO ] Computed 21 invariants in 2 ms
[2023-04-01 16:28:47] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:28:47] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:28:47] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:47] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-04-01 16:28:47] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 385836 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385836 steps, saw 295571 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:50] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:28:50] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:28:50] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:28:50] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-01 16:28:50] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:50] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:28:51] [INFO ] After 167ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:51] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-04-01 16:28:51] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 0 ms to minimize.
[2023-04-01 16:28:51] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-04-01 16:28:51] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-01 16:28:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 641 ms
[2023-04-01 16:28:51] [INFO ] After 852ms 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-04-01 16:28:51] [INFO ] After 1401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 149 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 432311 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432311 steps, saw 283270 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:28:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:28:55] [INFO ] Computed 31 invariants in 8 ms
[2023-04-01 16:28:55] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:28:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:28:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:28:55] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:55] [INFO ] After 89ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:28:55] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-01 16:28:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-01 16:28:55] [INFO ] After 222ms 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-04-01 16:28:55] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 126 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 124 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:28:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:55] [INFO ] Invariant cache hit.
[2023-04-01 16:28:56] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-04-01 16:28:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:28:56] [INFO ] Invariant cache hit.
[2023-04-01 16:28:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:28:59] [INFO ] Implicit Places using invariants and state equation in 3471 ms returned []
Implicit Place search using SMT with State Equation took 4023 ms to find 0 implicit places.
[2023-04-01 16:29:00] [INFO ] Redundant transitions in 184 ms returned []
[2023-04-01 16:29:00] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:00] [INFO ] Invariant cache hit.
[2023-04-01 16:29:01] [INFO ] Dead Transitions using invariants and state equation in 1075 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5412 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:29:01] [INFO ] Computed 21 invariants in 2 ms
[2023-04-01 16:29:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:29:01] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:29:01] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:01] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:29:01] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 387717 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 387717 steps, saw 296953 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:04] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:29:04] [INFO ] Computed 31 invariants in 12 ms
[2023-04-01 16:29:04] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2023-04-01 16:29:04] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-01 16:29:05] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:05] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:29:05] [INFO ] After 171ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-01 16:29:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-04-01 16:29:05] [INFO ] After 373ms 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-04-01 16:29:05] [INFO ] After 937ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 149 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431574 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431574 steps, saw 282749 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:29:08] [INFO ] Computed 31 invariants in 7 ms
[2023-04-01 16:29:08] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:29:08] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:29:09] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:09] [INFO ] After 87ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:09] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-01 16:29:09] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-04-01 16:29:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 264 ms
[2023-04-01 16:29:09] [INFO ] After 382ms 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-04-01 16:29:09] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 126 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:29:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:09] [INFO ] Invariant cache hit.
[2023-04-01 16:29:10] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-04-01 16:29:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:10] [INFO ] Invariant cache hit.
[2023-04-01 16:29:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:13] [INFO ] Implicit Places using invariants and state equation in 3526 ms returned []
Implicit Place search using SMT with State Equation took 4077 ms to find 0 implicit places.
[2023-04-01 16:29:14] [INFO ] Redundant transitions in 178 ms returned []
[2023-04-01 16:29:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:14] [INFO ] Invariant cache hit.
[2023-04-01 16:29:15] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5429 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 31 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:29:15] [INFO ] Computed 21 invariants in 0 ms
[2023-04-01 16:29:15] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:29:15] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:29:15] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:15] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:29:15] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 392821 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392821 steps, saw 300397 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:18] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:29:18] [INFO ] Computed 31 invariants in 11 ms
[2023-04-01 16:29:18] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:29:18] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:29:18] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:18] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:29:19] [INFO ] After 179ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:19] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-04-01 16:29:19] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 0 ms to minimize.
[2023-04-01 16:29:19] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-01 16:29:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2023-04-01 16:29:19] [INFO ] After 654ms 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-04-01 16:29:19] [INFO ] After 1195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 145 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 444323 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 444323 steps, saw 290335 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:29:22] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:29:22] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:29:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:29:23] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:23] [INFO ] After 90ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-01 16:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-01 16:29:23] [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 31 ms.
[2023-04-01 16:29:23] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 133 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:29:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:23] [INFO ] Invariant cache hit.
[2023-04-01 16:29:24] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-04-01 16:29:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:24] [INFO ] Invariant cache hit.
[2023-04-01 16:29:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:27] [INFO ] Implicit Places using invariants and state equation in 3669 ms returned []
Implicit Place search using SMT with State Equation took 4235 ms to find 0 implicit places.
[2023-04-01 16:29:28] [INFO ] Redundant transitions in 185 ms returned []
[2023-04-01 16:29:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:28] [INFO ] Invariant cache hit.
[2023-04-01 16:29:29] [INFO ] Dead Transitions using invariants and state equation in 1047 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5611 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:29:29] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:29:29] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:29:29] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:29:29] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:29] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:29:29] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 395714 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395714 steps, saw 302610 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:32] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:29:32] [INFO ] Computed 31 invariants in 11 ms
[2023-04-01 16:29:32] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:29:32] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:29:32] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:32] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:29:33] [INFO ] After 173ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:33] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-01 16:29:33] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-01 16:29:33] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 0 ms to minimize.
[2023-04-01 16:29:33] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 0 ms to minimize.
[2023-04-01 16:29:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 627 ms
[2023-04-01 16:29:33] [INFO ] After 842ms 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-04-01 16:29:33] [INFO ] After 1377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 144 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 256188 steps, run visited all 1 properties in 1735 ms. (steps per millisecond=147 )
Probabilistic random walk after 256188 steps, saw 174954 distinct states, run finished after 1736 ms. (steps per millisecond=147 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5178 steps, including 1 resets, run visited all 1 properties in 16 ms. (steps per millisecond=323 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 392447 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392447 steps, saw 300060 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:38] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:29:38] [INFO ] Invariant cache hit.
[2023-04-01 16:29:38] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:29:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:29:39] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:39] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:29:39] [INFO ] After 181ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:39] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-01 16:29:39] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-04-01 16:29:39] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-01 16:29:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 417 ms
[2023-04-01 16:29:40] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-04-01 16:29:40] [INFO ] After 1205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 147 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 431915 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 431915 steps, saw 283004 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:29:43] [INFO ] Computed 31 invariants in 7 ms
[2023-04-01 16:29:43] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:29:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:29:43] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:43] [INFO ] After 106ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:43] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-01 16:29:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-01 16:29:43] [INFO ] After 242ms 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-04-01 16:29:44] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 124 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:29:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:44] [INFO ] Invariant cache hit.
[2023-04-01 16:29:44] [INFO ] Implicit Places using invariants in 561 ms returned []
[2023-04-01 16:29:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:44] [INFO ] Invariant cache hit.
[2023-04-01 16:29:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:48] [INFO ] Implicit Places using invariants and state equation in 3579 ms returned []
Implicit Place search using SMT with State Equation took 4142 ms to find 0 implicit places.
[2023-04-01 16:29:48] [INFO ] Redundant transitions in 134 ms returned []
[2023-04-01 16:29:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:48] [INFO ] Invariant cache hit.
[2023-04-01 16:29:49] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5433 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:29:49] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:29:49] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:29:49] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:29:49] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:49] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:29:49] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389345 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389345 steps, saw 298092 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:52] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:29:52] [INFO ] Computed 31 invariants in 10 ms
[2023-04-01 16:29:52] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:29:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:29:53] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:53] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:29:53] [INFO ] After 168ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:53] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-01 16:29:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-04-01 16:29:53] [INFO ] After 369ms 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-04-01 16:29:53] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 147 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 434973 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 434973 steps, saw 284953 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:29:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:29:56] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:29:57] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:29:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:29:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:29:57] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:29:57] [INFO ] After 95ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:29:57] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-04-01 16:29:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-01 16:29:57] [INFO ] After 247ms 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-04-01 16:29:57] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 123 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:29:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:57] [INFO ] Invariant cache hit.
[2023-04-01 16:29:58] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-04-01 16:29:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:29:58] [INFO ] Invariant cache hit.
[2023-04-01 16:29:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:01] [INFO ] Implicit Places using invariants and state equation in 3450 ms returned []
Implicit Place search using SMT with State Equation took 4009 ms to find 0 implicit places.
[2023-04-01 16:30:02] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-01 16:30:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:02] [INFO ] Invariant cache hit.
[2023-04-01 16:30:03] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5315 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:30:03] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:30:03] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:30:03] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:30:03] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:03] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-01 16:30:03] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 388388 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388388 steps, saw 297427 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:06] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:30:06] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:30:06] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:30:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:06] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:06] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:30:07] [INFO ] After 186ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:07] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-01 16:30:07] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-01 16:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-01 16:30:07] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-04-01 16:30:07] [INFO ] After 1068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 146 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 435380 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 435380 steps, saw 285225 distinct states, run finished after 3001 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:30:10] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:30:10] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:10] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:30:10] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:30:11] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:11] [INFO ] After 89ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-01 16:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-01 16:30:11] [INFO ] After 233ms 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-04-01 16:30:11] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 122 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:30:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:11] [INFO ] Invariant cache hit.
[2023-04-01 16:30:12] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-04-01 16:30:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:12] [INFO ] Invariant cache hit.
[2023-04-01 16:30:12] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:15] [INFO ] Implicit Places using invariants and state equation in 3450 ms returned []
Implicit Place search using SMT with State Equation took 4006 ms to find 0 implicit places.
[2023-04-01 16:30:15] [INFO ] Redundant transitions in 130 ms returned []
[2023-04-01 16:30:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:15] [INFO ] Invariant cache hit.
[2023-04-01 16:30:16] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5295 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:30:16] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:30:16] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:30:16] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:30:16] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:16] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:30:16] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 395175 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395175 steps, saw 302179 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:19] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:30:19] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:30:20] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-01 16:30:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:20] [INFO ] After 351ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:20] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:30:20] [INFO ] After 179ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:20] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-04-01 16:30:21] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2023-04-01 16:30:21] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-01 16:30:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 473 ms
[2023-04-01 16:30:21] [INFO ] After 695ms 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-04-01 16:30:21] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 144 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440374 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440374 steps, saw 287963 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:30:24] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:30:24] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-01 16:30:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:24] [INFO ] After 212ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:24] [INFO ] After 93ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-01 16:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-01 16:30:25] [INFO ] After 236ms 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-04-01 16:30:25] [INFO ] After 585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 127 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 123 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:30:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:25] [INFO ] Invariant cache hit.
[2023-04-01 16:30:25] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-04-01 16:30:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:25] [INFO ] Invariant cache hit.
[2023-04-01 16:30:26] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:29] [INFO ] Implicit Places using invariants and state equation in 3501 ms returned []
Implicit Place search using SMT with State Equation took 4057 ms to find 0 implicit places.
[2023-04-01 16:30:29] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-01 16:30:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:29] [INFO ] Invariant cache hit.
[2023-04-01 16:30:30] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5358 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:30:30] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:30:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:30:30] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:30:30] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:30] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:30:30] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 397958 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397958 steps, saw 304278 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:33] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:30:33] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:30:33] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:30:34] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:34] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:34] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:30:34] [INFO ] After 180ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:34] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-01 16:30:34] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-01 16:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 282 ms
[2023-04-01 16:30:34] [INFO ] After 504ms 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-04-01 16:30:34] [INFO ] After 1046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 145 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 440429 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :{}
Probabilistic random walk after 440429 steps, saw 288002 distinct states, run finished after 3001 ms. (steps per millisecond=146 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:30:38] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:30:38] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:30:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:30:38] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:38] [INFO ] After 97ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-01 16:30:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-01 16:30:38] [INFO ] After 245ms 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-04-01 16:30:38] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 123 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:30:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:39] [INFO ] Invariant cache hit.
[2023-04-01 16:30:39] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-04-01 16:30:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:39] [INFO ] Invariant cache hit.
[2023-04-01 16:30:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:43] [INFO ] Implicit Places using invariants and state equation in 3504 ms returned []
Implicit Place search using SMT with State Equation took 4063 ms to find 0 implicit places.
[2023-04-01 16:30:43] [INFO ] Redundant transitions in 123 ms returned []
[2023-04-01 16:30:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:43] [INFO ] Invariant cache hit.
[2023-04-01 16:30:44] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5359 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:30:44] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:30:44] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:30:44] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:30:44] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:44] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:30:44] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 408265 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408265 steps, saw 311788 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:47] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:30:47] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:30:47] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:30:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:48] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:48] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:30:48] [INFO ] After 165ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:48] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-01 16:30:48] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-01 16:30:48] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 0 ms to minimize.
[2023-04-01 16:30:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 442 ms
[2023-04-01 16:30:48] [INFO ] After 660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-01 16:30:48] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 142 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 443751 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :{}
Probabilistic random walk after 443751 steps, saw 290075 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:30:51] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:30:52] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:30:52] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:30:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:30:52] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:52] [INFO ] After 92ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:52] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-01 16:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-01 16:30:52] [INFO ] After 229ms 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-04-01 16:30:52] [INFO ] After 583ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 124 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 122 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:30:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:52] [INFO ] Invariant cache hit.
[2023-04-01 16:30:53] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-04-01 16:30:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:53] [INFO ] Invariant cache hit.
[2023-04-01 16:30:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:30:56] [INFO ] Implicit Places using invariants and state equation in 3474 ms returned []
Implicit Place search using SMT with State Equation took 4028 ms to find 0 implicit places.
[2023-04-01 16:30:57] [INFO ] Redundant transitions in 128 ms returned []
[2023-04-01 16:30:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:30:57] [INFO ] Invariant cache hit.
[2023-04-01 16:30:58] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5318 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 36 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:30:58] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:30:58] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:30:58] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:30:58] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:58] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:30:58] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:30:58] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-01 16:30:58] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403667 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403667 steps, saw 308379 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:01] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:31:01] [INFO ] Computed 31 invariants in 12 ms
[2023-04-01 16:31:01] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:31:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:01] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:01] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:02] [INFO ] After 156ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:02] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-01 16:31:02] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:31:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 308 ms
[2023-04-01 16:31:02] [INFO ] After 502ms 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-04-01 16:31:02] [INFO ] After 1036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 139 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 454652 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 454652 steps, saw 296870 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:31:05] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:31:05] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:31:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:06] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:06] [INFO ] After 101ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:06] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-01 16:31:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-01 16:31:06] [INFO ] After 237ms 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-04-01 16:31:06] [INFO ] After 587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 124 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 121 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:31:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:06] [INFO ] Invariant cache hit.
[2023-04-01 16:31:07] [INFO ] Implicit Places using invariants in 553 ms returned []
[2023-04-01 16:31:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:07] [INFO ] Invariant cache hit.
[2023-04-01 16:31:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:10] [INFO ] Implicit Places using invariants and state equation in 3479 ms returned []
Implicit Place search using SMT with State Equation took 4033 ms to find 0 implicit places.
[2023-04-01 16:31:10] [INFO ] Redundant transitions in 127 ms returned []
[2023-04-01 16:31:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:10] [INFO ] Invariant cache hit.
[2023-04-01 16:31:11] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5324 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:31:11] [INFO ] Computed 21 invariants in 0 ms
[2023-04-01 16:31:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:31:11] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:31:11] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:11] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:31:11] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 411136 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 411136 steps, saw 314051 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:14] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:31:14] [INFO ] Computed 31 invariants in 8 ms
[2023-04-01 16:31:15] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:31:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:15] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:15] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:15] [INFO ] After 172ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:15] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-01 16:31:16] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2023-04-01 16:31:16] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-04-01 16:31:16] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2023-04-01 16:31:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 606 ms
[2023-04-01 16:31:16] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-04-01 16:31:16] [INFO ] After 1369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 144 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 148377 steps, run visited all 1 properties in 967 ms. (steps per millisecond=153 )
Probabilistic random walk after 148377 steps, saw 104783 distinct states, run finished after 967 ms. (steps per millisecond=153 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 410234 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 410234 steps, saw 313376 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:20] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:31:20] [INFO ] Invariant cache hit.
[2023-04-01 16:31:20] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:31:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-01 16:31:21] [INFO ] After 341ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:21] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:21] [INFO ] After 187ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:21] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-01 16:31:21] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2023-04-01 16:31:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-01 16:31:21] [INFO ] After 518ms 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-04-01 16:31:21] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 139 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 112803 steps, run visited all 1 properties in 728 ms. (steps per millisecond=154 )
Probabilistic random walk after 112803 steps, saw 81982 distinct states, run finished after 728 ms. (steps per millisecond=154 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 409662 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409662 steps, saw 312926 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:25] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:31:25] [INFO ] Invariant cache hit.
[2023-04-01 16:31:25] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-01 16:31:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-01 16:31:26] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:26] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:26] [INFO ] After 161ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:26] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-01 16:31:26] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-01 16:31:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-04-01 16:31:26] [INFO ] After 486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-04-01 16:31:26] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 143 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/680 places, 3890/4790 transitions.
Finished random walk after 338 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 411180 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :{}
Probabilistic random walk after 411180 steps, saw 314087 distinct states, run finished after 3002 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:30] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:31:30] [INFO ] Invariant cache hit.
[2023-04-01 16:31:30] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-01 16:31:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:30] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:30] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:30] [INFO ] After 178ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:30] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-04-01 16:31:31] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-01 16:31:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2023-04-01 16:31:31] [INFO ] After 512ms 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-04-01 16:31:31] [INFO ] After 1045ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 143 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 455510 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 455510 steps, saw 297441 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:31:34] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:31:34] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:31:34] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:34] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:34] [INFO ] After 93ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:34] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-01 16:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-01 16:31:35] [INFO ] After 234ms 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-04-01 16:31:35] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 123 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 120 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:31:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:35] [INFO ] Invariant cache hit.
[2023-04-01 16:31:35] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-04-01 16:31:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:35] [INFO ] Invariant cache hit.
[2023-04-01 16:31:36] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:39] [INFO ] Implicit Places using invariants and state equation in 3444 ms returned []
Implicit Place search using SMT with State Equation took 3993 ms to find 0 implicit places.
[2023-04-01 16:31:39] [INFO ] Redundant transitions in 125 ms returned []
[2023-04-01 16:31:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:39] [INFO ] Invariant cache hit.
[2023-04-01 16:31:40] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5263 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:31:40] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:31:40] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:31:40] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:31:40] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:40] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-01 16:31:40] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 407968 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 407968 steps, saw 311578 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:43] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:31:43] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:31:43] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:31:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:44] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:44] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:44] [INFO ] After 176ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:44] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-04-01 16:31:44] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 0 ms to minimize.
[2023-04-01 16:31:44] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-01 16:31:44] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-04-01 16:31:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 619 ms
[2023-04-01 16:31:45] [INFO ] After 845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-04-01 16:31:45] [INFO ] After 1365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 139 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451484 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451484 steps, saw 294768 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:31:48] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:31:48] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:31:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:48] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:48] [INFO ] After 93ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:48] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-01 16:31:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2023-04-01 16:31:48] [INFO ] After 234ms 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-04-01 16:31:48] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 122 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 120 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:31:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:49] [INFO ] Invariant cache hit.
[2023-04-01 16:31:49] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-04-01 16:31:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:49] [INFO ] Invariant cache hit.
[2023-04-01 16:31:50] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:31:52] [INFO ] Implicit Places using invariants and state equation in 3211 ms returned []
Implicit Place search using SMT with State Equation took 3767 ms to find 0 implicit places.
[2023-04-01 16:31:53] [INFO ] Redundant transitions in 121 ms returned []
[2023-04-01 16:31:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:31:53] [INFO ] Invariant cache hit.
[2023-04-01 16:31:54] [INFO ] Dead Transitions using invariants and state equation in 1031 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5050 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 23 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:31:54] [INFO ] Computed 21 invariants in 1 ms
[2023-04-01 16:31:54] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-01 16:31:54] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:31:54] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:54] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-01 16:31:54] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 405031 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 405031 steps, saw 309374 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:31:57] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:31:57] [INFO ] Computed 31 invariants in 8 ms
[2023-04-01 16:31:57] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:31:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-01 16:31:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:31:57] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:57] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:31:58] [INFO ] After 176ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:31:58] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-01 16:31:58] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-01 16:31:58] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-04-01 16:31:58] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2023-04-01 16:31:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 646 ms
[2023-04-01 16:31:58] [INFO ] After 871ms 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-04-01 16:31:58] [INFO ] After 1437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 143 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 428503 steps, run visited all 1 properties in 2840 ms. (steps per millisecond=150 )
Probabilistic random walk after 428503 steps, saw 281268 distinct states, run finished after 2840 ms. (steps per millisecond=150 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 403689 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403689 steps, saw 308392 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:32:04] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
[2023-04-01 16:32:04] [INFO ] Invariant cache hit.
[2023-04-01 16:32:05] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:32:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-01 16:32:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:32:05] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:05] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:32:05] [INFO ] After 177ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:05] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-01 16:32:06] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-01 16:32:06] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2023-04-01 16:32:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2023-04-01 16:32:06] [INFO ] After 713ms 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-04-01 16:32:06] [INFO ] After 1261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 140 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451979 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451979 steps, saw 295100 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:32:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:32:09] [INFO ] Computed 31 invariants in 5 ms
[2023-04-01 16:32:09] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:32:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:32:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-01 16:32:09] [INFO ] After 219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:32:10] [INFO ] After 94ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:10] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-01 16:32:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-01 16:32:10] [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 33 ms.
[2023-04-01 16:32:10] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 124 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 122 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:32:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:32:10] [INFO ] Invariant cache hit.
[2023-04-01 16:32:10] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-04-01 16:32:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:32:10] [INFO ] Invariant cache hit.
[2023-04-01 16:32:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:32:14] [INFO ] Implicit Places using invariants and state equation in 3311 ms returned []
Implicit Place search using SMT with State Equation took 3863 ms to find 0 implicit places.
[2023-04-01 16:32:14] [INFO ] Redundant transitions in 126 ms returned []
[2023-04-01 16:32:14] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:32:14] [INFO ] Invariant cache hit.
[2023-04-01 16:32:15] [INFO ] Dead Transitions using invariants and state equation in 1018 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5133 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3642 edges and 590 vertex of which 100 / 590 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Drop transitions removed 350 transitions
Ensure Unique test removed 2790 transitions
Reduce isomorphic transitions removed 3140 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 500 transition count 632
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 237 place count 382 transition count 632
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 237 place count 382 transition count 611
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 289 place count 351 transition count 611
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 647 place count 172 transition count 432
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 2 with 88 rules applied. Total rules applied 735 place count 172 transition count 344
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 755 place count 162 transition count 344
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 765 place count 162 transition count 334
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 776 place count 162 transition count 323
Free-agglomeration rule applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 867 place count 162 transition count 232
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 958 place count 71 transition count 232
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 968 place count 71 transition count 232
Applied a total of 968 rules in 22 ms. Remains 71 /590 variables (removed 519) and now considering 232/3890 (removed 3658) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 232 rows 71 cols
[2023-04-01 16:32:15] [INFO ] Computed 21 invariants in 2 ms
[2023-04-01 16:32:15] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:32:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-01 16:32:15] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-01 16:32:15] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:15] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-04-01 16:32:15] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 411125 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 411125 steps, saw 314042 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:32:18] [INFO ] Flow matrix only has 1920 transitions (discarded 2870 similar events)
// Phase 1: matrix 1920 rows 680 cols
[2023-04-01 16:32:18] [INFO ] Computed 31 invariants in 9 ms
[2023-04-01 16:32:18] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:32:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-01 16:32:18] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:32:19] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:19] [INFO ] State equation strengthened by 1246 read => feed constraints.
[2023-04-01 16:32:19] [INFO ] After 180ms SMT Verify possible using 1246 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:19] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-01 16:32:19] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-01 16:32:19] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-01 16:32:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-01 16:32:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 629 ms
[2023-04-01 16:32:20] [INFO ] After 858ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-04-01 16:32:20] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 4790/4790 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 590 transition count 3890
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 142 ms. Remains 590 /680 variables (removed 90) and now considering 3890/4790 (removed 900) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 590/680 places, 3890/4790 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 453288 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{}
Probabilistic random walk after 453288 steps, saw 295995 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-01 16:32:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-01 16:32:23] [INFO ] Computed 31 invariants in 6 ms
[2023-04-01 16:32:23] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-01 16:32:23] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-01 16:32:23] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-01 16:32:23] [INFO ] After 213ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:23] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-01 16:32:23] [INFO ] After 85ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-01 16:32:23] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-04-01 16:32:23] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-01 16:32:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2023-04-01 16:32:24] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-01 16:32:24] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 590 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 119 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 590/590 places, 3890/3890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 590/590 places, 3890/3890 transitions.
Applied a total of 0 rules in 118 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-01 16:32:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:32:24] [INFO ] Invariant cache hit.
[2023-04-01 16:32:24] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-04-01 16:32:24] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-01 16:32:24] [INFO ] Invariant cache hit.
[2023-04-01 16:32:25] [INFO ] State equation strengthened by 436 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 11537376 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16136100 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303301559.jar
+ VERSION=202303301559
+ echo 'Running Version 202303301559'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is EisenbergMcGuire-PT-10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-167987254500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-10.tgz
mv EisenbergMcGuire-PT-10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;