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.r533-tall-167987253200173.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 lolaxred
Input is EisenbergMcGuire-PT-10, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r533-tall-167987253200173
=====================================================================

--------------------
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 StableMarking

=== Now, execution of the tool begins

BK_START 1680815345894

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=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-10
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 21:09:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 21:09:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:09:07] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-04-06 21:09:07] [INFO ] Transformed 1090 places.
[2023-04-06 21:09:07] [INFO ] Transformed 5200 transitions.
[2023-04-06 21:09:07] [INFO ] Found NUPN structural information;
[2023-04-06 21:09:07] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 413 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=14 ) properties (out of 1090) seen :680
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=14 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 410) seen :0
Running SMT prover for 410 properties.
[2023-04-06 21:09:08] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2023-04-06 21:09:08] [INFO ] Computed 31 invariants in 36 ms
[2023-04-06 21:09:18] [INFO ] After 9598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:410
[2023-04-06 21:09:24] [INFO ] [Nat]Absence check using 21 positive place invariants in 47 ms returned sat
[2023-04-06 21:09:24] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 14 ms returned sat
[2023-04-06 21:09:43] [INFO ] After 11981ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :410
[2023-04-06 21:09:43] [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:353)
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-06 21:09:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 21:09:43] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:410
Fused 410 Parikh solutions to 130 different solutions.
Parikh walk visited 1 properties in 1419 ms.
Support contains 409 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 220 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 220 Pre rules applied. Total rules applied 20 place count 1080 transition count 4970
Deduced a syphon composed of 220 places in 7 ms
Reduce places removed 220 places and 0 transitions.
Iterating global reduction 2 with 440 rules applied. Total rules applied 460 place count 860 transition count 4970
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 550 place count 770 transition count 4070
Iterating global reduction 2 with 90 rules applied. Total rules applied 640 place count 770 transition count 4070
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 9 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 718 place count 731 transition count 4031
Applied a total of 718 rules in 542 ms. Remains 731 /1090 variables (removed 359) and now considering 4031/5200 (removed 1169) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 731/1090 places, 4031/5200 transitions.
Interrupted random walk after 766394 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen 58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 351) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 351) seen :0
Running SMT prover for 351 properties.
[2023-04-06 21:10:17] [INFO ] Flow matrix only has 1161 transitions (discarded 2870 similar events)
// Phase 1: matrix 1161 rows 731 cols
[2023-04-06 21:10:17] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:10:22] [INFO ] After 4915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:351
[2023-04-06 21:10:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 20 ms returned sat
[2023-04-06 21:10:26] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 21:10:41] [INFO ] After 11719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :351
[2023-04-06 21:10:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:10:56] [INFO ] After 14790ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :351
[2023-04-06 21:10:56] [INFO ] Deduced a trap composed of 21 places in 392 ms of which 5 ms to minimize.
[2023-04-06 21:10:57] [INFO ] Deduced a trap composed of 3 places in 429 ms of which 1 ms to minimize.
[2023-04-06 21:10:57] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 2 ms to minimize.
[2023-04-06 21:10:58] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 2 ms to minimize.
[2023-04-06 21:10:58] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 2 ms to minimize.
[2023-04-06 21:10:58] [INFO ] Deduced a trap composed of 3 places in 279 ms of which 0 ms to minimize.
[2023-04-06 21:10:59] [INFO ] Deduced a trap composed of 39 places in 323 ms of which 1 ms to minimize.
[2023-04-06 21:10:59] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 1 ms to minimize.
[2023-04-06 21:10:59] [INFO ] Deduced a trap composed of 71 places in 331 ms of which 1 ms to minimize.
[2023-04-06 21:11:00] [INFO ] Deduced a trap composed of 3 places in 304 ms of which 1 ms to minimize.
[2023-04-06 21:11:00] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 0 ms to minimize.
[2023-04-06 21:11:01] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 0 ms to minimize.
[2023-04-06 21:11:01] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 1 ms to minimize.
[2023-04-06 21:11:01] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2023-04-06 21:11:01] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 0 ms to minimize.
[2023-04-06 21:11:02] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 1 ms to minimize.
[2023-04-06 21:11:02] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 1 ms to minimize.
[2023-04-06 21:11:02] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 1 ms to minimize.
[2023-04-06 21:11:03] [INFO ] Deduced a trap composed of 24 places in 230 ms of which 1 ms to minimize.
[2023-04-06 21:11:03] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-04-06 21:11:03] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 0 ms to minimize.
[2023-04-06 21:11:03] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 0 ms to minimize.
[2023-04-06 21:11:03] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 1 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 26 places in 172 ms of which 0 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 0 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 1 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2023-04-06 21:11:04] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-04-06 21:11:05] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:11:05] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 8596 ms
[2023-04-06 21:11:05] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-04-06 21:11:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2023-04-06 21:11:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:11:06] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:11:06] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-04-06 21:11:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2023-04-06 21:11:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 4 ms to minimize.
[2023-04-06 21:11:09] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:11:09] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2023-04-06 21:11:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 389 ms
[2023-04-06 21:11:10] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:11:10] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:11:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-04-06 21:11:10] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2023-04-06 21:11:11] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:11:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 21:11:11] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:11:11] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:11:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-04-06 21:11:13] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 1 ms to minimize.
[2023-04-06 21:11:13] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 0 ms to minimize.
[2023-04-06 21:11:14] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 0 ms to minimize.
[2023-04-06 21:11:14] [INFO ] Deduced a trap composed of 17 places in 205 ms of which 1 ms to minimize.
[2023-04-06 21:11:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1112 ms
[2023-04-06 21:11:14] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 0 ms to minimize.
[2023-04-06 21:11:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-06 21:11:15] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2023-04-06 21:11:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-04-06 21:11:15] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 0 ms to minimize.
[2023-04-06 21:11:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-04-06 21:11:15] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 1 ms to minimize.
[2023-04-06 21:11:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 230 ms
[2023-04-06 21:11:16] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:11:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2023-04-06 21:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 2 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2023-04-06 21:11:22] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 1 ms to minimize.
[2023-04-06 21:11:23] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:11:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2023-04-06 21:11:23] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2023-04-06 21:11:24] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:11:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2023-04-06 21:11:24] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 0 ms to minimize.
[2023-04-06 21:11:25] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:11:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2023-04-06 21:11:27] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2023-04-06 21:11:28] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-04-06 21:11:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-04-06 21:11:29] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
[2023-04-06 21:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-06 21:11:31] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-06 21:11:31] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:11:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-06 21:11:32] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 3 ms to minimize.
[2023-04-06 21:11:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-04-06 21:11:34] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:11:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-06 21:11:36] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-06 21:11:37] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 1 ms to minimize.
[2023-04-06 21:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2023-04-06 21:11:38] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2023-04-06 21:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-06 21:11:38] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:11:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-06 21:11:38] [INFO ] After 57143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :351
Attempting to minimize the solution found.
Minimization took 16086 ms.
[2023-04-06 21:11:54] [INFO ] After 92318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :351
Fused 351 Parikh solutions to 260 different solutions.
Parikh walk visited 0 properties in 15178 ms.
Support contains 351 out of 731 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 731/731 places, 4031/4031 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 10 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 0 with 102 rules applied. Total rules applied 102 place count 680 transition count 3980
Applied a total of 102 rules in 218 ms. Remains 680 /731 variables (removed 51) and now considering 3980/4031 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 680/731 places, 3980/4031 transitions.
Interrupted random walk after 556682 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen 2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 349) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 349) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 348) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 348) seen :0
Interrupted probabilistic random walk after 4889775 steps, run timeout after 102001 ms. (steps per millisecond=47 ) 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, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1, 25=1, 26=1, 27=1, 28=1, 29=1, 30=1, 31=1, 32=1, 33=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, 80=1, 81=1, 82=1, 83=1, 84=1, 85=1, 86=1, 87=1, 88=1, 89=1, 91=1, 92=1, 93=1, 94=1, 95=1, 96=1, 99=1, 101=1, 102=1, 103=1, 104=1, 107=1, 108=1, 109=1, 110=1, 111=1, 112=1, 113=1, 116=1, 117=1, 118=1, 119=1, 120=1, 121=1, 124=1, 125=1, 126=1, 127=1, 128=1, 129=1, 130=1, 132=1, 133=1, 134=1, 135=1, 136=1, 137=1, 138=1, 139=1, 140=1, 141=1, 142=1, 143=1, 144=1, 145=1, 146=1, 147=1, 148=1, 149=1, 151=1, 152=1, 153=1, 154=1, 155=1, 156=1, 157=1, 158=1, 160=1, 161=1, 162=1, 163=1, 164=1, 165=1, 166=1, 167=1, 168=1, 169=1, 170=1, 171=1, 172=1, 173=1, 174=1, 175=1, 176=1, 177=1, 178=1, 179=1, 180=1, 181=1, 182=1, 183=1, 184=1, 185=1, 186=1, 187=1, 188=1, 189=1, 190=1, 191=1, 192=1, 193=1, 194=1, 195=1, 196=1, 197=1, 198=1, 199=1, 200=1, 201=1, 202=1, 203=1, 204=1, 205=1, 206=1, 207=1, 208=1, 209=1, 210=1, 211=1, 212=1, 213=1, 214=1, 215=1, 216=1, 217=1, 218=1, 219=1, 220=1, 221=1, 222=1, 223=1, 224=1, 225=1, 226=1, 227=1, 228=1, 229=1, 230=1, 231=1, 232=1, 233=1, 234=1, 235=1, 236=1, 237=1, 238=1, 239=1, 240=1, 241=1, 242=1, 243=1, 244=1, 245=1, 246=1, 247=1, 248=1, 249=1, 250=1, 251=1, 252=1, 253=1, 254=1, 255=1, 256=1, 257=1, 258=1, 259=1, 260=1, 261=1, 262=1, 263=1, 264=1, 265=1, 268=1, 269=1, 270=1, 271=1, 272=1, 273=1, 274=1, 275=1, 278=1, 279=1, 280=1, 281=1, 282=1, 283=1, 284=1, 288=1, 289=1, 290=1, 291=1, 292=1, 293=1, 294=1, 295=1, 298=1, 299=1, 300=1, 301=1, 302=1, 303=1, 305=1, 308=1, 309=1, 310=1, 311=1, 312=1, 313=1, 314=1, 315=1, 318=1, 319=1, 320=1, 321=1, 322=1, 323=1, 324=1, 325=1, 326=1, 327=1, 328=1, 329=1, 330=1, 331=1, 332=1, 333=1, 334=1, 335=1, 336=1, 337=1, 338=1, 339=1, 340=1, 341=1, 342=1, 343=1, 344=1, 345=1, 346=1, 347=1}
Probabilistic random walk after 4889775 steps, saw 2631920 distinct states, run finished after 102006 ms. (steps per millisecond=47 ) properties seen :321
Running SMT prover for 27 properties.
[2023-04-06 21:14:27] [INFO ] Flow matrix only has 1110 transitions (discarded 2870 similar events)
// Phase 1: matrix 1110 rows 680 cols
[2023-04-06 21:14:27] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:14:27] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2023-04-06 21:14:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-04-06 21:14:27] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 7 ms returned sat
[2023-04-06 21:14:29] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2023-04-06 21:14:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:14:30] [INFO ] After 1188ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2023-04-06 21:14:30] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 0 ms to minimize.
[2023-04-06 21:14:30] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:14:30] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-04-06 21:14:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 485 ms
[2023-04-06 21:14:31] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:14:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-06 21:14:31] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 0 ms to minimize.
[2023-04-06 21:14:31] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 1 ms to minimize.
[2023-04-06 21:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 389 ms
[2023-04-06 21:14:31] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2023-04-06 21:14:31] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-06 21:14:32] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:14:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 461 ms
[2023-04-06 21:14:32] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:14:32] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 273 ms
[2023-04-06 21:14:32] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2023-04-06 21:14:32] [INFO ] Deduced a trap composed of 35 places in 139 ms of which 1 ms to minimize.
[2023-04-06 21:14:33] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 0 ms to minimize.
[2023-04-06 21:14:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 394 ms
[2023-04-06 21:14:33] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-04-06 21:14:33] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-04-06 21:14:33] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-04-06 21:14:34] [INFO ] Deduced a trap composed of 19 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:14:34] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:14:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 480 ms
[2023-04-06 21:14:34] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 0 ms to minimize.
[2023-04-06 21:14:34] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:14:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2023-04-06 21:14:35] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:14:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-06 21:14:35] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:14:35] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:14:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
[2023-04-06 21:14:35] [INFO ] After 6536ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 1181 ms.
[2023-04-06 21:14:36] [INFO ] After 9449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 945 ms.
Support contains 27 out of 680 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 680/680 places, 3980/3980 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 680 transition count 3890
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 590 transition count 3890
Applied a total of 180 rules in 188 ms. Remains 590 /680 variables (removed 90) and now considering 3890/3980 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 590/680 places, 3890/3980 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25018 ms. (steps per millisecond=39 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=331 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=328 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 268 ms. (steps per millisecond=373 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 309 ms. (steps per millisecond=323 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=358 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 295 ms. (steps per millisecond=338 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=342 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 26) seen :0
Interrupted probabilistic random walk after 4790027 steps, run timeout after 96001 ms. (steps per millisecond=49 ) properties seen :{2=1, 8=1, 9=1, 21=1, 24=1, 25=1}
Probabilistic random walk after 4790027 steps, saw 2552667 distinct states, run finished after 96004 ms. (steps per millisecond=49 ) properties seen :6
Running SMT prover for 20 properties.
[2023-04-06 21:16:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:16:46] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:16:47] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:16:47] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-04-06 21:16:47] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:16:48] [INFO ] After 826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:16:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:16:49] [INFO ] After 849ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:16:49] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 1 ms to minimize.
[2023-04-06 21:16:49] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-04-06 21:16:49] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-04-06 21:16:49] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 901 ms
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 0 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:16:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-04-06 21:16:50] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:16:51] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-04-06 21:16:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-06 21:16:51] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2023-04-06 21:16:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-06 21:16:51] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 0 ms to minimize.
[2023-04-06 21:16:51] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:16:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 284 ms
[2023-04-06 21:16:52] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-04-06 21:16:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-04-06 21:16:52] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:16:52] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:16:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2023-04-06 21:16:52] [INFO ] After 4608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 773 ms.
[2023-04-06 21:16:53] [INFO ] After 6656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 466 ms.
Support contains 20 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 146 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 147 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24892 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=330 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 342 ms. (steps per millisecond=292 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=347 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=357 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=350 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=341 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 4565385 steps, run timeout after 90001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 4565385 steps, saw 2439684 distinct states, run finished after 90002 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 20 properties.
[2023-04-06 21:18:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:18:55] [INFO ] Invariant cache hit.
[2023-04-06 21:18:55] [INFO ] After 228ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:18:55] [INFO ] [Nat]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-04-06 21:18:55] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:18:56] [INFO ] After 765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:18:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:18:57] [INFO ] After 837ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:18:57] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2023-04-06 21:18:57] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2023-04-06 21:18:57] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2023-04-06 21:18:57] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:18:57] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 860 ms
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:18:58] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 519 ms
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2023-04-06 21:18:59] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2023-04-06 21:19:00] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:19:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 426 ms
[2023-04-06 21:19:00] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:19:00] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:19:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-04-06 21:19:00] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-06 21:19:01] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2023-04-06 21:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-06 21:19:01] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-06 21:19:01] [INFO ] After 4969ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 755 ms.
[2023-04-06 21:19:02] [INFO ] After 6905ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 455 ms.
Support contains 20 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 133 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 133 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 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:19:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:19:02] [INFO ] Invariant cache hit.
[2023-04-06 21:19:03] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-04-06 21:19:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:19:03] [INFO ] Invariant cache hit.
[2023-04-06 21:19:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:19:06] [INFO ] Implicit Places using invariants and state equation in 3388 ms returned []
Implicit Place search using SMT with State Equation took 3987 ms to find 0 implicit places.
[2023-04-06 21:19:07] [INFO ] Redundant transitions in 222 ms returned []
[2023-04-06 21:19:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:19:07] [INFO ] Invariant cache hit.
[2023-04-06 21:19:08] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5467 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2125 ms. (steps per millisecond=47 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-04-06 21:19:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:19:10] [INFO ] Invariant cache hit.
[2023-04-06 21:19:10] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:19:10] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:19:10] [INFO ] After 249ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2023-04-06 21:19:10] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:19:10] [INFO ] After 217ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :20
[2023-04-06 21:19:12] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 2 ms to minimize.
[2023-04-06 21:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 280 ms
[2023-04-06 21:19:12] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 0 ms to minimize.
[2023-04-06 21:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-04-06 21:19:13] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 1 ms to minimize.
[2023-04-06 21:19:13] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2023-04-06 21:19:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2023-04-06 21:19:13] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 1 ms to minimize.
[2023-04-06 21:19:13] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
[2023-04-06 21:19:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 431 ms
[2023-04-06 21:19:13] [INFO ] After 3155ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:19:13] [INFO ] After 3522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:19:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:19:13] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:19:14] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:19:14] [INFO ] After 262ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:19:14] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 0 ms to minimize.
[2023-04-06 21:19:14] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 0 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 1 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1094 ms
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:19:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 358 ms
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2023-04-06 21:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 275 ms
[2023-04-06 21:19:16] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-04-06 21:19:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2023-04-06 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2023-04-06 21:19:17] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-06 21:19:17] [INFO ] Deduced a trap composed of 45 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-06 21:19:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-04-06 21:19:18] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:19:18] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2023-04-06 21:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 252 ms
[2023-04-06 21:19:18] [INFO ] After 4260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-04-06 21:19:18] [INFO ] After 4865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 23724 ms. (steps per millisecond=42 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=352 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=359 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=344 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=354 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=364 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=362 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 286 ms. (steps per millisecond=349 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=343 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=353 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=370 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=366 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=348 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=340 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=363 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=371 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 272 ms. (steps per millisecond=367 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 4438247 steps, run timeout after 87001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 4438247 steps, saw 2380058 distinct states, run finished after 87002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 20 properties.
[2023-04-06 21:21:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:15] [INFO ] Invariant cache hit.
[2023-04-06 21:21:15] [INFO ] After 233ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:21:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-04-06 21:21:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 11 ms returned sat
[2023-04-06 21:21:16] [INFO ] After 784ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:21:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:17] [INFO ] After 931ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:21:17] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-04-06 21:21:17] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 1 ms to minimize.
[2023-04-06 21:21:17] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 869 ms
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 293 ms
[2023-04-06 21:21:18] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:21:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 0 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 589 ms
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 0 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-04-06 21:21:19] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:21:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:21:20] [INFO ] Deduced a trap composed of 33 places in 136 ms of which 0 ms to minimize.
[2023-04-06 21:21:20] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2023-04-06 21:21:20] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-04-06 21:21:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2023-04-06 21:21:20] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:21:21] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2023-04-06 21:21:21] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2023-04-06 21:21:21] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-06 21:21:21] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-04-06 21:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-04-06 21:21:21] [INFO ] After 5289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 786 ms.
[2023-04-06 21:21:22] [INFO ] After 7294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Fused 20 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 394 ms.
Support contains 20 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 152 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 153 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 151 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:21:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:23] [INFO ] Invariant cache hit.
[2023-04-06 21:21:23] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-04-06 21:21:23] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:23] [INFO ] Invariant cache hit.
[2023-04-06 21:21:24] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:27] [INFO ] Implicit Places using invariants and state equation in 3763 ms returned []
Implicit Place search using SMT with State Equation took 4361 ms to find 0 implicit places.
[2023-04-06 21:21:27] [INFO ] Redundant transitions in 215 ms returned []
[2023-04-06 21:21:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:27] [INFO ] Invariant cache hit.
[2023-04-06 21:21:29] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5938 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2462 ms. (steps per millisecond=40 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-04-06 21:21:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:31] [INFO ] Invariant cache hit.
[2023-04-06 21:21:31] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 21:21:31] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:21:31] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :20
[2023-04-06 21:21:31] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:32] [INFO ] After 184ms SMT Verify possible using 436 Read/Feed constraints in real domain returned unsat :0 sat :20
[2023-04-06 21:21:33] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 0 ms to minimize.
[2023-04-06 21:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2023-04-06 21:21:33] [INFO ] Deduced a trap composed of 61 places in 203 ms of which 0 ms to minimize.
[2023-04-06 21:21:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2023-04-06 21:21:34] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 0 ms to minimize.
[2023-04-06 21:21:34] [INFO ] Deduced a trap composed of 18 places in 161 ms of which 0 ms to minimize.
[2023-04-06 21:21:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2023-04-06 21:21:34] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 0 ms to minimize.
[2023-04-06 21:21:34] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 1 ms to minimize.
[2023-04-06 21:21:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 422 ms
[2023-04-06 21:21:35] [INFO ] After 3141ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:21:35] [INFO ] After 3487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:21:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:21:35] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:21:35] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:21:35] [INFO ] After 246ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:21:35] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-04-06 21:21:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1092 ms
[2023-04-06 21:21:36] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 253 ms
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 362 ms
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-04-06 21:21:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 256 ms
[2023-04-06 21:21:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:21:38] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2023-04-06 21:21:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2023-04-06 21:21:38] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-06 21:21:38] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2023-04-06 21:21:39] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-04-06 21:21:39] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:21:39] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:21:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-04-06 21:21:39] [INFO ] After 4163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-04-06 21:21:39] [INFO ] After 4757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 382470 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 382470 steps, saw 252820 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:21:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:42] [INFO ] Invariant cache hit.
[2023-04-06 21:21:42] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:21:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:21:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:21:43] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:43] [INFO ] After 94ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:43] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:21:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:21:43] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-06 21:21:43] [INFO ] After 634ms 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 133 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 134 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 394075 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394075 steps, saw 259933 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:21:46] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:46] [INFO ] Invariant cache hit.
[2023-04-06 21:21:46] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:21:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 21:21:46] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:21:47] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:47] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:47] [INFO ] After 93ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:47] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 21:21:47] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-06 21:21:47] [INFO ] After 631ms 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 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:21:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:47] [INFO ] Invariant cache hit.
[2023-04-06 21:21:48] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-04-06 21:21:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:48] [INFO ] Invariant cache hit.
[2023-04-06 21:21:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:52] [INFO ] Implicit Places using invariants and state equation in 4067 ms returned []
Implicit Place search using SMT with State Equation took 4654 ms to find 0 implicit places.
[2023-04-06 21:21:52] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-06 21:21:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:21:52] [INFO ] Invariant cache hit.
[2023-04-06 21:21:53] [INFO ] Dead Transitions using invariants and state equation in 1160 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6095 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 4 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 80 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-06 21:21:53] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:21:53] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:21:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:21:54] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:21:54] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:54] [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-06 21:21:54] [INFO ] After 371ms 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 390599 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390599 steps, saw 257953 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:21:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:21:57] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:21:57] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:21:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:21:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:21:57] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:21:57] [INFO ] After 99ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:21:57] [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-06 21:21:57] [INFO ] After 630ms 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 205 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 207 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 388113 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388113 steps, saw 256198 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:01] [INFO ] Invariant cache hit.
[2023-04-06 21:22:01] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:22:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 19 ms returned sat
[2023-04-06 21:22:01] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:01] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:01] [INFO ] After 98ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:01] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 21:22:01] [INFO ] After 253ms 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-06 21:22:01] [INFO ] After 653ms 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 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 138 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:22:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:02] [INFO ] Invariant cache hit.
[2023-04-06 21:22:02] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-04-06 21:22:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:02] [INFO ] Invariant cache hit.
[2023-04-06 21:22:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:06] [INFO ] Implicit Places using invariants and state equation in 3719 ms returned []
Implicit Place search using SMT with State Equation took 4341 ms to find 0 implicit places.
[2023-04-06 21:22:06] [INFO ] Redundant transitions in 128 ms returned []
[2023-04-06 21:22:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:06] [INFO ] Invariant cache hit.
[2023-04-06 21:22:07] [INFO ] Dead Transitions using invariants and state equation in 1098 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5729 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 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 50 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-06 21:22:07] [INFO ] Computed 21 invariants in 0 ms
[2023-04-06 21:22:07] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:08] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:22:08] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:08] [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 4 ms.
[2023-04-06 21:22:08] [INFO ] After 120ms 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 398211 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 398211 steps, saw 262353 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:22:11] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:22:11] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 22 ms returned sat
[2023-04-06 21:22:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:11] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:11] [INFO ] After 111ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:11] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:22:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:22:11] [INFO ] After 276ms 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-06 21:22:11] [INFO ] After 673ms 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 145 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 147 ms. Remains : 590/590 places, 3890/3890 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386870 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386870 steps, saw 255415 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:15] [INFO ] Invariant cache hit.
[2023-04-06 21:22:15] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 21:22:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:15] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:15] [INFO ] After 118ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:15] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:22:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:22:15] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 21:22:15] [INFO ] After 645ms 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 151 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 151 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 148 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:22:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:16] [INFO ] Invariant cache hit.
[2023-04-06 21:22:16] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-04-06 21:22:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:16] [INFO ] Invariant cache hit.
[2023-04-06 21:22:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:20] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4515 ms to find 0 implicit places.
[2023-04-06 21:22:20] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-06 21:22:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:20] [INFO ] Invariant cache hit.
[2023-04-06 21:22:21] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5934 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 2 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 32 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-06 21:22:21] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:22:21] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:22:22] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:22:22] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:22] [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-06 21:22:22] [INFO ] After 114ms 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 390346 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390346 steps, saw 257796 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:22:25] [INFO ] Computed 31 invariants in 14 ms
[2023-04-06 21:22:25] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:22:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 6 ms returned sat
[2023-04-06 21:22:25] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:25] [INFO ] After 110ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:25] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2023-04-06 21:22:25] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:22:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-04-06 21:22:25] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-04-06 21:22:25] [INFO ] After 770ms 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 143 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 144 ms. Remains : 590/590 places, 3890/3890 transitions.
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 396231 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396231 steps, saw 261190 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:29] [INFO ] Invariant cache hit.
[2023-04-06 21:22:29] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:22:29] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:29] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:29] [INFO ] After 120ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:29] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:22:29] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:22:30] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-04-06 21:22:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 365 ms
[2023-04-06 21:22:30] [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 36 ms.
[2023-04-06 21:22:30] [INFO ] After 881ms 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 128 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:22:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:30] [INFO ] Invariant cache hit.
[2023-04-06 21:22:30] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-04-06 21:22:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:30] [INFO ] Invariant cache hit.
[2023-04-06 21:22:31] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:34] [INFO ] Implicit Places using invariants and state equation in 3812 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
[2023-04-06 21:22:34] [INFO ] Redundant transitions in 141 ms returned []
[2023-04-06 21:22:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:34] [INFO ] Invariant cache hit.
[2023-04-06 21:22:36] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5799 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 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-06 21:22:36] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 21:22:36] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:36] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:36] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:22:36] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:36] [INFO ] After 15ms 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-06 21:22:36] [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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 383350 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 383350 steps, saw 253385 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:22:39] [INFO ] Computed 31 invariants in 4 ms
[2023-04-06 21:22:39] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2023-04-06 21:22:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:39] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:39] [INFO ] After 105ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:39] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 21:22:39] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-06 21:22:39] [INFO ] After 646ms 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 131 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 133 ms. Remains : 590/590 places, 3890/3890 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 381909 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 381909 steps, saw 252524 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:43] [INFO ] Invariant cache hit.
[2023-04-06 21:22:43] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:43] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:22:43] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:43] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:43] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:43] [INFO ] After 121ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:43] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2023-04-06 21:22:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-04-06 21:22:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 221 ms
[2023-04-06 21:22:43] [INFO ] After 381ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-06 21:22:44] [INFO ] After 778ms 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 131 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 133 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 131 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:22:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:44] [INFO ] Invariant cache hit.
[2023-04-06 21:22:44] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-04-06 21:22:44] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:44] [INFO ] Invariant cache hit.
[2023-04-06 21:22:45] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:48] [INFO ] Implicit Places using invariants and state equation in 3870 ms returned []
Implicit Place search using SMT with State Equation took 4463 ms to find 0 implicit places.
[2023-04-06 21:22:48] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-06 21:22:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:48] [INFO ] Invariant cache hit.
[2023-04-06 21:22:50] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5874 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 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-06 21:22:50] [INFO ] Computed 21 invariants in 2 ms
[2023-04-06 21:22:50] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:22:50] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:22:50] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:50] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 21:22:50] [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 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 388740 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388740 steps, saw 256629 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:22:53] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 21:22:53] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:22:53] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:22:53] [INFO ] After 240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:53] [INFO ] After 107ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:53] [INFO ] After 177ms 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-06 21:22:53] [INFO ] After 560ms 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 132 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 132 ms. Remains : 590/590 places, 3890/3890 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 388443 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 388443 steps, saw 256438 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:57] [INFO ] Invariant cache hit.
[2023-04-06 21:22:57] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 21:22:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:22:57] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:22:57] [INFO ] After 105ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:57] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:22:57] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:22:57] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-04-06 21:22:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2023-04-06 21:22:57] [INFO ] After 483ms 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-06 21:22:57] [INFO ] After 872ms 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 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 132 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:22:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:58] [INFO ] Invariant cache hit.
[2023-04-06 21:22:58] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-04-06 21:22:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:22:58] [INFO ] Invariant cache hit.
[2023-04-06 21:22:59] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:02] [INFO ] Implicit Places using invariants and state equation in 3828 ms returned []
Implicit Place search using SMT with State Equation took 4400 ms to find 0 implicit places.
[2023-04-06 21:23:02] [INFO ] Redundant transitions in 145 ms returned []
[2023-04-06 21:23:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:02] [INFO ] Invariant cache hit.
[2023-04-06 21:23:03] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5850 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 26 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-06 21:23:04] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:23:04] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:23:04] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:23:04] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:04] [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-06 21:23:04] [INFO ] After 81ms 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 384626 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 384626 steps, saw 253889 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:23:07] [INFO ] Computed 31 invariants in 9 ms
[2023-04-06 21:23:07] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 21:23:07] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:07] [INFO ] After 101ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:07] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:23:07] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-04-06 21:23:07] [INFO ] After 652ms 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 141 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 141 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) 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 385704 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 385704 steps, saw 254645 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:11] [INFO ] Invariant cache hit.
[2023-04-06 21:23:11] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:11] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:11] [INFO ] After 123ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:11] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2023-04-06 21:23:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:23:11] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-04-06 21:23:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 396 ms
[2023-04-06 21:23:12] [INFO ] After 549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-06 21:23:12] [INFO ] After 929ms 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 139 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 138 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:23:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:12] [INFO ] Invariant cache hit.
[2023-04-06 21:23:12] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-04-06 21:23:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:12] [INFO ] Invariant cache hit.
[2023-04-06 21:23:13] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:17] [INFO ] Implicit Places using invariants and state equation in 4208 ms returned []
Implicit Place search using SMT with State Equation took 4806 ms to find 0 implicit places.
[2023-04-06 21:23:17] [INFO ] Redundant transitions in 136 ms returned []
[2023-04-06 21:23:17] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:17] [INFO ] Invariant cache hit.
[2023-04-06 21:23:18] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6205 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-06 21:23:18] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:23:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:23:18] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:23:18] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:18] [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-06 21:23:18] [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 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 389565 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389565 steps, saw 257222 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:23:21] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:23:21] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:21] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:22] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:22] [INFO ] After 104ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:22] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-04-06 21:23:22] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-06 21:23:22] [INFO ] After 650ms 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 136 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 137 ms. Remains : 590/590 places, 3890/3890 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 389521 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{}
Probabilistic random walk after 389521 steps, saw 257186 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:25] [INFO ] Invariant cache hit.
[2023-04-06 21:23:25] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:25] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:26] [INFO ] After 116ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:26] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 0 ms to minimize.
[2023-04-06 21:23:26] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:23:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 277 ms
[2023-04-06 21:23:26] [INFO ] After 422ms 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-06 21:23:26] [INFO ] After 807ms 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 137 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 137 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 134 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:23:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:26] [INFO ] Invariant cache hit.
[2023-04-06 21:23:27] [INFO ] Implicit Places using invariants in 599 ms returned []
[2023-04-06 21:23:27] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:27] [INFO ] Invariant cache hit.
[2023-04-06 21:23:27] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:31] [INFO ] Implicit Places using invariants and state equation in 3724 ms returned []
Implicit Place search using SMT with State Equation took 4324 ms to find 0 implicit places.
[2023-04-06 21:23:31] [INFO ] Redundant transitions in 130 ms returned []
[2023-04-06 21:23:31] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:31] [INFO ] Invariant cache hit.
[2023-04-06 21:23:32] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5698 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 26 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-06 21:23:32] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:23:32] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:32] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:23:32] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:23:32] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:32] [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-06 21:23:32] [INFO ] After 81ms 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 34 ms. (steps per millisecond=294 ) 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 408298 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 408298 steps, saw 268691 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:23:35] [INFO ] Computed 31 invariants in 9 ms
[2023-04-06 21:23:35] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:35] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:35] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:35] [INFO ] After 101ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:36] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:23:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 21:23:36] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 21:23:36] [INFO ] After 647ms 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 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.
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 400334 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400334 steps, saw 263508 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:39] [INFO ] Invariant cache hit.
[2023-04-06 21:23:39] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:39] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:39] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:39] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:39] [INFO ] After 102ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:39] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:23:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:23:40] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-04-06 21:23:40] [INFO ] After 658ms 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-06 21:23:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:40] [INFO ] Invariant cache hit.
[2023-04-06 21:23:40] [INFO ] Implicit Places using invariants in 625 ms returned []
[2023-04-06 21:23:40] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:40] [INFO ] Invariant cache hit.
[2023-04-06 21:23:41] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:44] [INFO ] Implicit Places using invariants and state equation in 3922 ms returned []
Implicit Place search using SMT with State Equation took 4549 ms to find 0 implicit places.
[2023-04-06 21:23:45] [INFO ] Redundant transitions in 141 ms returned []
[2023-04-06 21:23:45] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:45] [INFO ] Invariant cache hit.
[2023-04-06 21:23:46] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6036 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 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 28 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-06 21:23:46] [INFO ] Computed 21 invariants in 3 ms
[2023-04-06 21:23:46] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-06 21:23:46] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:46] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:23:46] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:46] [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 8 ms.
[2023-04-06 21:23:46] [INFO ] After 99ms 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 390357 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 390357 steps, saw 257804 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:23:49] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:23:49] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:49] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:49] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:49] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:50] [INFO ] After 96ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:50] [INFO ] After 152ms 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-06 21:23:50] [INFO ] After 545ms 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 137 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 140 ms. Remains : 590/590 places, 3890/3890 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 391303 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391303 steps, saw 258486 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:53] [INFO ] Invariant cache hit.
[2023-04-06 21:23:53] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:23:53] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:23:53] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:53] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:53] [INFO ] After 101ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:53] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 21:23:53] [INFO ] After 539ms 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 130 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 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:23:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:54] [INFO ] Invariant cache hit.
[2023-04-06 21:23:54] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-04-06 21:23:54] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:54] [INFO ] Invariant cache hit.
[2023-04-06 21:23:55] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:23:58] [INFO ] Implicit Places using invariants and state equation in 3880 ms returned []
Implicit Place search using SMT with State Equation took 4474 ms to find 0 implicit places.
[2023-04-06 21:23:58] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 21:23:58] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:23:58] [INFO ] Invariant cache hit.
[2023-04-06 21:23:59] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5864 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 40 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:23:59] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:23:59] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:00] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:24:00] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:24:00] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:00] [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-06 21:24:00] [INFO ] After 100ms 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 396374 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396374 steps, saw 261283 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:24:03] [INFO ] Computed 31 invariants in 4 ms
[2023-04-06 21:24:03] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:03] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:03] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:03] [INFO ] After 90ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:03] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 21:24:03] [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 34 ms.
[2023-04-06 21:24:03] [INFO ] After 593ms 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 139 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.
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 395252 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395252 steps, saw 260461 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:07] [INFO ] Invariant cache hit.
[2023-04-06 21:24:07] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:07] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:07] [INFO ] After 235ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:07] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:07] [INFO ] After 90ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:07] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:24:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:24:07] [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 35 ms.
[2023-04-06 21:24:07] [INFO ] After 606ms 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 130 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 131 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 129 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:24:07] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:07] [INFO ] Invariant cache hit.
[2023-04-06 21:24:08] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-04-06 21:24:08] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:08] [INFO ] Invariant cache hit.
[2023-04-06 21:24:08] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:12] [INFO ] Implicit Places using invariants and state equation in 3956 ms returned []
Implicit Place search using SMT with State Equation took 4546 ms to find 0 implicit places.
[2023-04-06 21:24:12] [INFO ] Redundant transitions in 138 ms returned []
[2023-04-06 21:24:12] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:12] [INFO ] Invariant cache hit.
[2023-04-06 21:24:13] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5960 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 30 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:24:13] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:24:13] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:24:13] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:24:13] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:13] [INFO ] After 15ms 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-06 21:24:13] [INFO ] After 89ms 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 392744 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392744 steps, saw 259370 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:24:16] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:24:17] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:17] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:17] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:17] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:17] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:17] [INFO ] After 91ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:17] [INFO ] After 149ms 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-06 21:24:17] [INFO ] After 526ms 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 137 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.
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 397265 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 397265 steps, saw 261912 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:20] [INFO ] Invariant cache hit.
[2023-04-06 21:24:20] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 21:24:20] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:24:21] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:21] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:21] [INFO ] After 78ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:21] [INFO ] After 132ms 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-06 21:24:21] [INFO ] After 495ms 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-06 21:24:21] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:21] [INFO ] Invariant cache hit.
[2023-04-06 21:24:22] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-04-06 21:24:22] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:22] [INFO ] Invariant cache hit.
[2023-04-06 21:24:22] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:25] [INFO ] Implicit Places using invariants and state equation in 3734 ms returned []
Implicit Place search using SMT with State Equation took 4310 ms to find 0 implicit places.
[2023-04-06 21:24:26] [INFO ] Redundant transitions in 127 ms returned []
[2023-04-06 21:24:26] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:26] [INFO ] Invariant cache hit.
[2023-04-06 21:24:27] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5647 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:24:27] [INFO ] Computed 21 invariants in 3 ms
[2023-04-06 21:24:27] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:27] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:24:27] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:27] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:24:27] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:27] [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-06 21:24:27] [INFO ] After 81ms 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 396693 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396693 steps, saw 261513 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:24:30] [INFO ] Computed 31 invariants in 4 ms
[2023-04-06 21:24:30] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:30] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 10 ms returned sat
[2023-04-06 21:24:30] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:30] [INFO ] After 86ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:30] [INFO ] After 140ms 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-06 21:24:30] [INFO ] After 516ms 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 140 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 140 ms. Remains : 590/590 places, 3890/3890 transitions.
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 394647 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 394647 steps, saw 260163 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:34] [INFO ] Invariant cache hit.
[2023-04-06 21:24:34] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:34] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:34] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:34] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:34] [INFO ] After 81ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:34] [INFO ] After 138ms 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-06 21:24:34] [INFO ] After 508ms 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 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 129 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 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:24:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:34] [INFO ] Invariant cache hit.
[2023-04-06 21:24:35] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-04-06 21:24:35] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:35] [INFO ] Invariant cache hit.
[2023-04-06 21:24:35] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:39] [INFO ] Implicit Places using invariants and state equation in 3981 ms returned []
Implicit Place search using SMT with State Equation took 4566 ms to find 0 implicit places.
[2023-04-06 21:24:39] [INFO ] Redundant transitions in 138 ms returned []
[2023-04-06 21:24:39] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:39] [INFO ] Invariant cache hit.
[2023-04-06 21:24:40] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5956 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 26 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:24:40] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:24:40] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:24:40] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:24:40] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:40] [INFO ] After 16ms 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-06 21:24:40] [INFO ] After 91ms 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 392359 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 392359 steps, saw 259154 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:24:43] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:24:44] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:44] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:44] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:44] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:44] [INFO ] After 92ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:24:44] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:24:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:24:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 295 ms
[2023-04-06 21:24:44] [INFO ] After 412ms 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-06 21:24:44] [INFO ] After 783ms 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 133 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 134 ms. Remains : 590/590 places, 3890/3890 transitions.
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 395230 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395230 steps, saw 260443 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:48] [INFO ] Invariant cache hit.
[2023-04-06 21:24:48] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:48] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:24:48] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:48] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:48] [INFO ] After 85ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:48] [INFO ] After 137ms 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-06 21:24:48] [INFO ] After 507ms 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 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 127 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:24:48] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:48] [INFO ] Invariant cache hit.
[2023-04-06 21:24:49] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-04-06 21:24:49] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:49] [INFO ] Invariant cache hit.
[2023-04-06 21:24:49] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:53] [INFO ] Implicit Places using invariants and state equation in 3860 ms returned []
Implicit Place search using SMT with State Equation took 4452 ms to find 0 implicit places.
[2023-04-06 21:24:53] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 21:24:53] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:24:53] [INFO ] Invariant cache hit.
[2023-04-06 21:24:54] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5877 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 29 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:24:54] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:24:54] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:24:54] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:24:54] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24: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 14 ms.
[2023-04-06 21:24:54] [INFO ] After 94ms 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396517 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396517 steps, saw 261390 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:24:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:24:57] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:24:57] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:24:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:24:57] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:24:58] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:58] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:24:58] [INFO ] After 77ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:24:58] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:24:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:24:58] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 21:24:58] [INFO ] After 573ms 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 128 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.
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 404426 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404426 steps, saw 266174 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:01] [INFO ] Invariant cache hit.
[2023-04-06 21:25:01] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:01] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:02] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:02] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:02] [INFO ] After 79ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:02] [INFO ] After 130ms 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-06 21:25:02] [INFO ] After 490ms 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 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 130 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:25:02] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:02] [INFO ] Invariant cache hit.
[2023-04-06 21:25:03] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-04-06 21:25:03] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:03] [INFO ] Invariant cache hit.
[2023-04-06 21:25:03] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:06] [INFO ] Implicit Places using invariants and state equation in 3792 ms returned []
Implicit Place search using SMT with State Equation took 4371 ms to find 0 implicit places.
[2023-04-06 21:25:06] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 21:25:06] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:06] [INFO ] Invariant cache hit.
[2023-04-06 21:25:08] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5710 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:25:08] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:25:08] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:25:08] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:25:08] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:08] [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-06 21:25:08] [INFO ] After 86ms 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 403810 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403810 steps, saw 265784 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:25:11] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 21:25:11] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:11] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:11] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:11] [INFO ] After 84ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:25:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:25:11] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-06 21:25:11] [INFO ] After 582ms 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 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 129 ms. Remains : 590/590 places, 3890/3890 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) 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 402402 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 402402 steps, saw 264817 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:15] [INFO ] Invariant cache hit.
[2023-04-06 21:25:15] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:15] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:15] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:15] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:15] [INFO ] After 84ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:15] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-04-06 21:25:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:25:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:25:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2023-04-06 21:25:15] [INFO ] After 424ms 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-06 21:25:15] [INFO ] After 771ms 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 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 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:25:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:16] [INFO ] Invariant cache hit.
[2023-04-06 21:25:16] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-04-06 21:25:16] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:16] [INFO ] Invariant cache hit.
[2023-04-06 21:25:16] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:20] [INFO ] Implicit Places using invariants and state equation in 3874 ms returned []
Implicit Place search using SMT with State Equation took 4436 ms to find 0 implicit places.
[2023-04-06 21:25:20] [INFO ] Redundant transitions in 137 ms returned []
[2023-04-06 21:25:20] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:20] [INFO ] Invariant cache hit.
[2023-04-06 21:25:21] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5834 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 27 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:25:21] [INFO ] Computed 21 invariants in 3 ms
[2023-04-06 21:25:21] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:25:21] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:21] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:25:21] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:21] [INFO ] After 15ms 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-06 21:25:22] [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 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 395549 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395549 steps, saw 260672 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:25] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:25:25] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 21:25:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:25] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:25:25] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:25] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:25] [INFO ] After 87ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:25] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:25:25] [INFO ] After 230ms 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-06 21:25:25] [INFO ] After 594ms 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 133 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 134 ms. Remains : 590/590 places, 3890/3890 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 404778 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404778 steps, saw 266422 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:28] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:28] [INFO ] Invariant cache hit.
[2023-04-06 21:25:28] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:29] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:29] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:29] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:29] [INFO ] After 83ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:29] [INFO ] After 139ms 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-06 21:25:29] [INFO ] After 503ms 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 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 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:25:29] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:29] [INFO ] Invariant cache hit.
[2023-04-06 21:25:30] [INFO ] Implicit Places using invariants in 569 ms returned []
[2023-04-06 21:25:30] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:30] [INFO ] Invariant cache hit.
[2023-04-06 21:25:30] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:34] [INFO ] Implicit Places using invariants and state equation in 3826 ms returned []
Implicit Place search using SMT with State Equation took 4396 ms to find 0 implicit places.
[2023-04-06 21:25:34] [INFO ] Redundant transitions in 131 ms returned []
[2023-04-06 21:25:34] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:34] [INFO ] Invariant cache hit.
[2023-04-06 21:25:35] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5735 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:25:35] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:25:35] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:25:35] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:25:35] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:35] [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-06 21:25:35] [INFO ] After 91ms 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 404371 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404371 steps, saw 266155 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:38] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:25:38] [INFO ] Computed 31 invariants in 6 ms
[2023-04-06 21:25:38] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:38] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:38] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:39] [INFO ] After 81ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:39] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:25:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:25:39] [INFO ] After 232ms 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-06 21:25:39] [INFO ] After 589ms 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 128 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.
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 403348 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 403348 steps, saw 265473 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:42] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:42] [INFO ] Invariant cache hit.
[2023-04-06 21:25:42] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:42] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 4 ms returned sat
[2023-04-06 21:25:42] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:42] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:42] [INFO ] After 81ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:42] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-06 21:25:42] [INFO ] After 488ms 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 131 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 131 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-06 21:25:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:43] [INFO ] Invariant cache hit.
[2023-04-06 21:25:43] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-04-06 21:25:43] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:43] [INFO ] Invariant cache hit.
[2023-04-06 21:25:44] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:47] [INFO ] Implicit Places using invariants and state equation in 3879 ms returned []
Implicit Place search using SMT with State Equation took 4458 ms to find 0 implicit places.
[2023-04-06 21:25:47] [INFO ] Redundant transitions in 135 ms returned []
[2023-04-06 21:25:47] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:47] [INFO ] Invariant cache hit.
[2023-04-06 21:25:48] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5799 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 29 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:25:48] [INFO ] Computed 21 invariants in 0 ms
[2023-04-06 21:25:48] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:48] [INFO ] [Nat]Absence check using 21 positive place invariants in 2 ms returned sat
[2023-04-06 21:25:48] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:25:48] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:48] [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-06 21:25:48] [INFO ] After 79ms 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 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 406769 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :{}
Probabilistic random walk after 406769 steps, saw 267647 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:52] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:25:52] [INFO ] Computed 31 invariants in 7 ms
[2023-04-06 21:25:52] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:52] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:52] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:52] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:52] [INFO ] After 93ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:52] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:25:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:25:52] [INFO ] After 232ms 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-06 21:25:52] [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 132 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 132 ms. Remains : 590/590 places, 3890/3890 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 404558 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404558 steps, saw 266258 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:25:55] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:55] [INFO ] Invariant cache hit.
[2023-04-06 21:25:55] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:25:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:25:56] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:25:56] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:56] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:25:56] [INFO ] After 82ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:25:56] [INFO ] After 138ms 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-06 21:25:56] [INFO ] After 496ms 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 125 ms. Remains 590 /590 variables (removed 0) and now considering 3890/3890 (removed 0) transitions.
[2023-04-06 21:25:56] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:56] [INFO ] Invariant cache hit.
[2023-04-06 21:25:57] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-04-06 21:25:57] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:25:57] [INFO ] Invariant cache hit.
[2023-04-06 21:25:57] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:26:01] [INFO ] Implicit Places using invariants and state equation in 3955 ms returned []
Implicit Place search using SMT with State Equation took 4554 ms to find 0 implicit places.
[2023-04-06 21:26:01] [INFO ] Redundant transitions in 132 ms returned []
[2023-04-06 21:26:01] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:26:01] [INFO ] Invariant cache hit.
[2023-04-06 21:26:02] [INFO ] Dead Transitions using invariants and state equation in 1128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5948 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 24 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:26:02] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:26:02] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:26:02] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:26:02] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:26:02] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:02] [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-06 21:26:02] [INFO ] After 81ms 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 400345 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 400345 steps, saw 263517 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:26:05] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
// Phase 1: matrix 1020 rows 590 cols
[2023-04-06 21:26:05] [INFO ] Computed 31 invariants in 5 ms
[2023-04-06 21:26:05] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:26:05] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-04-06 21:26:05] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 13 ms returned sat
[2023-04-06 21:26:06] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:06] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:26:06] [INFO ] After 89ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:06] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:26:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:26:06] [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-06 21:26:06] [INFO ] After 603ms 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.
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 399740 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 399740 steps, saw 263108 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:26:09] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:26:09] [INFO ] Invariant cache hit.
[2023-04-06 21:26:09] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:26:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-04-06 21:26:09] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 5 ms returned sat
[2023-04-06 21:26:09] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:09] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:26:10] [INFO ] After 84ms SMT Verify possible using 436 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:10] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:26:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 21:26:10] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-04-06 21:26:10] [INFO ] After 603ms 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 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-06 21:26:10] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:26:10] [INFO ] Invariant cache hit.
[2023-04-06 21:26:11] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-04-06 21:26:11] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:26:11] [INFO ] Invariant cache hit.
[2023-04-06 21:26:11] [INFO ] State equation strengthened by 436 read => feed constraints.
[2023-04-06 21:26:15] [INFO ] Implicit Places using invariants and state equation in 3927 ms returned []
Implicit Place search using SMT with State Equation took 4507 ms to find 0 implicit places.
[2023-04-06 21:26:15] [INFO ] Redundant transitions in 133 ms returned []
[2023-04-06 21:26:15] [INFO ] Flow matrix only has 1020 transitions (discarded 2870 similar events)
[2023-04-06 21:26:15] [INFO ] Invariant cache hit.
[2023-04-06 21:26:16] [INFO ] Dead Transitions using invariants and state equation in 1121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5897 ms. Remains : 590/590 places, 3890/3890 transitions.
Graph (trivial) has 3668 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 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 500 transition count 631
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 239 place count 381 transition count 631
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 239 place count 381 transition count 610
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 291 place count 350 transition count 610
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 649 place count 171 transition count 431
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 2 with 90 rules applied. Total rules applied 739 place count 171 transition count 341
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 759 place count 161 transition count 341
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 769 place count 161 transition count 331
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 779 place count 161 transition count 321
Free-agglomeration rule applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 869 place count 161 transition count 231
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 959 place count 71 transition count 231
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 969 place count 71 transition count 231
Applied a total of 969 rules in 25 ms. Remains 71 /590 variables (removed 519) and now considering 231/3890 (removed 3659) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 71 cols
[2023-04-06 21:26:16] [INFO ] Computed 21 invariants in 1 ms
[2023-04-06 21:26:16] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:26:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-04-06 21:26:16] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:26:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:26:16] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:26: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-06 21:26:16] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 3396 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 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 500 transition count 640
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 1 with 110 rules applied. Total rules applied 221 place count 390 transition count 640
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 221 place count 390 transition count 619
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 273 place count 359 transition count 619
Performed 161 Post agglomeration using F-continuation condition.Transition count delta: 161
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 595 place count 198 transition count 458
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 2 with 76 rules applied. Total rules applied 671 place count 198 transition count 382
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 689 place count 189 transition count 382
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 698 place count 189 transition count 373
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 713 place count 189 transition count 358
Free-agglomeration rule applied 99 times.
Iterating global reduction 4 with 99 rules applied. Total rules applied 812 place count 189 transition count 259
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 4 with 99 rules applied. Total rules applied 911 place count 90 transition count 259
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 921 place count 90 transition count 259
Applied a total of 921 rules in 30 ms. Remains 90 /590 variables (removed 500) and now considering 259/3890 (removed 3631) transitions.
Running SMT prover for 20 properties.
// Phase 1: matrix 259 rows 90 cols
[2023-04-06 21:26:16] [INFO ] Computed 21 invariants in 0 ms
[2023-04-06 21:26:16] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-06 21:26:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-04-06 21:26:16] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-04-06 21:26:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-06 21:26:16] [INFO ] After 122ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :20
[2023-04-06 21:26:17] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-04-06 21:26:17] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Unable to solve all queries for examination StableMarking. Remains :20 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 20 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1029830 ms.
starting LoLA
BK_INPUT EisenbergMcGuire-PT-10
BK_EXAMINATION: StableMarking
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: StableMarking
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 12071704 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16121316 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES PLACE p18_7_5
sara: try reading problem file stateEquationProblem-ConstantPlace-663.sara.
lola: LAUNCH SYMM
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 1007
lola: find path: 83
lola: reporting
lola: not produced: 673
lola: find path: 417
lola: reporting
lola: not produced: 673
lola: find path: 417
lola: reporting
lola: not produced: 669
lola: find path: 421
lola: reporting
lola: not produced: 664
lola: find path: 426
lola: reporting
lola: not produced: 664
lola: find path: 426
lola: reporting
lola: not produced: 655
lola: find path: 435
lola: reporting
lola: not produced: 648
lola: find path: 442
lola: reporting
lola: not produced: 648
lola: find path: 442
lola: reporting
lola: not produced: 642
lola: find path: 448
lola: reporting
lola: not produced: 642
lola: find path: 448
lola: reporting
lola: not produced: 642
lola: find path: 448
lola: reporting
lola: not produced: 639
lola: find path: 451
lola: reporting
lola: not produced: 639
lola: find path: 451
lola: reporting
lola: not produced: 626
lola: find path: 464
lola: reporting
lola: not produced: 626
lola: find path: 464
lola: reporting
lola: not produced: 626
lola: find path: 464
lola: reporting
lola: not produced: 626
lola: find path: 464
lola: reporting
lola: not produced: 613
lola: find path: 477
lola: reporting
lola: not produced: 609
lola: find path: 481
lola: reporting
lola: not produced: 609
lola: find path: 481
lola: reporting
lola: not produced: 603
lola: find path: 487
lola: reporting
lola: not produced: 600
lola: find path: 490
lola: reporting
lola: not produced: 600
lola: find path: 490
lola: reporting
lola: not produced: 595
lola: find path: 495
lola: reporting
lola: not produced: 592
lola: find path: 498
lola: reporting
lola: not produced: 589
lola: find path: 501
lola: reporting
lola: not produced: 588
lola: find path: 502
lola: reporting
lola: not produced: 588
lola: find path: 502
lola: reporting
lola: not produced: 588
lola: find path: 502
lola: reporting
lola: not produced: 588
lola: find path: 502
lola: reporting
lola: not produced: 588
lola: find path: 502
lola: reporting
lola: not produced: 582
lola: find path: 508
lola: reporting
lola: not produced: 582
lola: find path: 508
lola: reporting
lola: not produced: 582
lola: find path: 508
lola: reporting
lola: not produced: 573
lola: find path: 517
lola: reporting
lola: not produced: 570
lola: find path: 520
lola: reporting
lola: not produced: 570
lola: find path: 520
lola: reporting
lola: not produced: 570
lola: find path: 520
lola: reporting
lola: not produced: 559
lola: find path: 531
lola: reporting
lola: not produced: 556
lola: find path: 534
lola: reporting
lola: not produced: 556
lola: find path: 534
lola: reporting
lola: not produced: 555
lola: find path: 535
lola: reporting
lola: not produced: 555
lola: find path: 535
lola: reporting
lola: not produced: 554
lola: find path: 536
lola: reporting
lola: not produced: 554
lola: find path: 536
lola: reporting
lola: not produced: 554
lola: find path: 536
lola: reporting
lola: not produced: 553
lola: find path: 537
lola: reporting
lola: not produced: 551
lola: find path: 539
lola: reporting
lola: not produced: 551
lola: find path: 539
lola: reporting
lola: not produced: 551
lola: find path: 539
lola: reporting
lola: not produced: 550
lola: find path: 540
lola: reporting
lola: not produced: 548
lola: find path: 542
lola: reporting
lola: not produced: 548
lola: find path: 542
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 547
lola: find path: 543
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 546
lola: find path: 544
lola: reporting
lola: not produced: 157
lola: find path: 544
lola: goal oriented search: 389
lola: reporting
lola: not produced: 157
lola: find path: 544
lola: goal oriented search: 389
lola: reporting
lola: not produced: 153
lola: find path: 548
lola: goal oriented search: 389
lola: reporting
lola: not produced: 148
lola: find path: 553
lola: goal oriented search: 389
lola: reporting
lola: not produced: 148
lola: find path: 553
lola: goal oriented search: 389
lola: reporting
lola: not produced: 95
lola: find path: 553
lola: goal oriented search: 442
lola: reporting
lola: not produced: 94
lola: find path: 554
lola: goal oriented search: 442
lola: reporting
lola: not produced: 94
lola: find path: 554
lola: goal oriented search: 442
lola: reporting
lola: not produced: 93
lola: find path: 555
lola: goal oriented search: 442
lola: reporting
lola: not produced: 84
lola: find path: 555
lola: goal oriented search: 451
lola: reporting
lola: not produced: 82
lola: find path: 557
lola: goal oriented search: 451
lola: reporting
lola: not produced: 82
lola: find path: 557
lola: goal oriented search: 451
lola: reporting
lola: not produced: 82
lola: find path: 557
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 80
lola: find path: 559
lola: goal oriented search: 451
lola: reporting
lola: not produced: 79
lola: find path: 560
lola: goal oriented search: 451
lola: reporting
lola: not produced: 79
lola: find path: 560
lola: goal oriented search: 451
lola: reporting
lola: not produced: 78
lola: find path: 561
lola: goal oriented search: 451
lola: reporting
lola: not produced: 78
lola: find path: 561
lola: goal oriented search: 451
lola: reporting
lola: not produced: 78
lola: find path: 561
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 77
lola: find path: 562
lola: goal oriented search: 451
lola: reporting
lola: not produced: 76
lola: find path: 563
lola: goal oriented search: 451
lola: reporting
lola: not produced: 76
lola: find path: 563
lola: goal oriented search: 451
lola: reporting
lola: not produced: 74
lola: find path: 565
lola: goal oriented search: 451
lola: reporting
lola: not produced: 74
lola: find path: 565
lola: goal oriented search: 451
lola: reporting
lola: not produced: 74
lola: find path: 565
lola: goal oriented search: 451
lola: reporting
lola: not produced: 74
lola: find path: 565
lola: goal oriented search: 451
lola: reporting
lola: not produced: 74
lola: find path: 565
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 73
lola: find path: 566
lola: goal oriented search: 451
lola: reporting
lola: not produced: 72
lola: find path: 567
lola: goal oriented search: 451
lola: reporting
lola: not produced: 72
lola: find path: 567
lola: goal oriented search: 451
lola: reporting
lola: not produced: 72
lola: find path: 567
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 71
lola: find path: 568
lola: goal oriented search: 451
lola: reporting
lola: not produced: 70
lola: find path: 569
lola: goal oriented search: 451
lola: reporting
lola: not produced: 70
lola: find path: 569
lola: goal oriented search: 451
lola: reporting
lola: not produced: 70
lola: find path: 569
lola: goal oriented search: 451
lola: caught signal Terminated - aborting LoLA

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY


Time elapsed: 767 secs. Pages in use: 67

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="StableMarking"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is EisenbergMcGuire-PT-10, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r533-tall-167987253200173"
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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;