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.r537-tall-167987255000157.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 smartxred
Input is EisenbergMcGuire-PT-07, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987255000157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 1.2M Mar 31 16:48 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1680814704815

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 20:58:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-04-06 20:58:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:58:26] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2023-04-06 20:58:26] [INFO ] Transformed 553 places.
[2023-04-06 20:58:26] [INFO ] Transformed 1960 transitions.
[2023-04-06 20:58:26] [INFO ] Found NUPN structural information;
[2023-04-06 20:58:26] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 203 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 546 transition count 1799
Deduced a syphon composed of 154 places in 13 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 392 transition count 1799
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1757
Applied a total of 406 rules in 102 ms. Remains 350 /553 variables (removed 203) and now considering 1757/1960 (removed 203) transitions.
[2023-04-06 20:58:26] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 350 cols
[2023-04-06 20:58:26] [INFO ] Computed 22 invariants in 23 ms
[2023-04-06 20:58:27] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-04-06 20:58:27] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2023-04-06 20:58:27] [INFO ] Invariant cache hit.
[2023-04-06 20:58:27] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 20:58:28] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
[2023-04-06 20:58:28] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2023-04-06 20:58:28] [INFO ] Invariant cache hit.
[2023-04-06 20:58:29] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 350/553 places, 1757/1960 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 2843 ms. Remains : 350/553 places, 1757/1960 transitions.
Initial state reduction rules removed 7 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1498 ms. (steps per millisecond=6 ) properties (out of 1750) seen :336
Running SMT prover for 1414 properties.
[2023-04-06 20:58:31] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2023-04-06 20:58:31] [INFO ] Invariant cache hit.
[2023-04-06 20:58:39] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 20:58:39] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-06 20:58:56] [INFO ] After 9892ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1086 real:328
[2023-04-06 20:58:56] [INFO ] State equation strengthened by 472 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:342)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 20:58:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 20:58:56] [INFO ] After 25028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1414 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 268 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Applied a total of 0 rules in 92 ms. Remains 350 /350 variables (removed 0) and now considering 1757/1757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 350/350 places, 1757/1757 transitions.
Interrupted random walk after 258141 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1385) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1385) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1385) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1385) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1385) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1385) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1384) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1384) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1382) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1382) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1382) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1380) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1378) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1378) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1377) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1377) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1377) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1376) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1375) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1374) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1374) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 1373) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1373) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1373) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1372) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 1372) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1371) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1371) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1370) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1370) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1369) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1369) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1369) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1369) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1369) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1368) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1366) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1366) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1366) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1366) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1366) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1366) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1365) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1365) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1363) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1362) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 1362) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 1361) seen :0
Probabilistic random walk after 1000000 steps, saw 578750 distinct states, run finished after 53091 ms. (steps per millisecond=18 ) properties seen :368
Running SMT prover for 993 properties.
[2023-04-06 21:00:22] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2023-04-06 21:00:22] [INFO ] Invariant cache hit.
[2023-04-06 21:00:28] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 21:00:28] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-06 21:01:00] [INFO ] After 37969ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:993
[2023-04-06 21:01:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 15 ms returned sat
[2023-04-06 21:01:05] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 10 ms returned sat
[2023-04-06 21:01:35] [INFO ] After 24532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :993
[2023-04-06 21:01:35] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 21:02:06] [INFO ] After 31256ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :993
[2023-04-06 21:02:07] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 4 ms to minimize.
[2023-04-06 21:02:07] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 1 ms to minimize.
[2023-04-06 21:02:07] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-04-06 21:02:07] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 2 ms to minimize.
[2023-04-06 21:02:07] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 1 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 0 ms to minimize.
[2023-04-06 21:02:08] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 25 places in 110 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 4 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:02:09] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2728 ms
[2023-04-06 21:02:10] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:02:10] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-06 21:02:10] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:02:10] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 21:02:11] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 21:02:11] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:02:11] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 21:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-04-06 21:02:11] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 21:02:12] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:02:16] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 0 ms to minimize.
[2023-04-06 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 21:02:18] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 0 ms to minimize.
[2023-04-06 21:02:18] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 0 ms to minimize.
[2023-04-06 21:02:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2023-04-06 21:02:20] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 0 ms to minimize.
[2023-04-06 21:02:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-04-06 21:02:31] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 1 ms to minimize.
[2023-04-06 21:02:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-04-06 21:02:34] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 3 ms to minimize.
[2023-04-06 21:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2023-04-06 21:02:37] [INFO ] Deduced a trap composed of 82 places in 111 ms of which 0 ms to minimize.
[2023-04-06 21:02:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 21:02:42] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 0 ms to minimize.
[2023-04-06 21:02:42] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 0 ms to minimize.
[2023-04-06 21:02:42] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 0 ms to minimize.
[2023-04-06 21:02:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2023-04-06 21:02:50] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:02:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 21:02:51] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 0 ms to minimize.
[2023-04-06 21:02:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2023-04-06 21:02:53] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:02:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:02:56] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 188 ms
[2023-04-06 21:03:04] [INFO ] After 89010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :993
Attempting to minimize the solution found.
Minimization took 34469 ms.
[2023-04-06 21:03:39] [INFO ] After 158449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :993
Fused 993 Parikh solutions to 969 different solutions.
Parikh walk visited 0 properties in 5739 ms.
Support contains 172 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 342 transition count 1701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 342 transition count 1701
Applied a total of 16 rules in 69 ms. Remains 342 /350 variables (removed 8) and now considering 1701/1757 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 342/350 places, 1701/1757 transitions.
Interrupted random walk after 349296 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 993) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 992) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 992) seen :0
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 47929 ms. (steps per millisecond=20 ) properties seen :23
Running SMT prover for 969 properties.
[2023-04-06 21:05:04] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:05:04] [INFO ] Computed 22 invariants in 9 ms
[2023-04-06 21:05:09] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:09] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:05:41] [INFO ] After 36704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:969
[2023-04-06 21:05:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:46] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:06:15] [INFO ] After 23771ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :969
[2023-04-06 21:06:15] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:06:43] [INFO ] After 27818ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :969
[2023-04-06 21:06:43] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2023-04-06 21:06:43] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:06:43] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2023-04-06 21:06:43] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 1 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 4 ms to minimize.
[2023-04-06 21:06:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1714 ms
[2023-04-06 21:06:45] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 21:06:45] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:06:45] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 21:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-04-06 21:06:45] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:06:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:06:46] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-04-06 21:06:46] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-04-06 21:06:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2023-04-06 21:06:49] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 1 ms to minimize.
[2023-04-06 21:06:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2023-04-06 21:06:50] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:06:52] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 11 ms to minimize.
[2023-04-06 21:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-06 21:06:52] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 4 ms to minimize.
[2023-04-06 21:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:06:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:06:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 21:06:53] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:06:54] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 21:06:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:06:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 21:06:56] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 0 ms to minimize.
[2023-04-06 21:06:56] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 1 ms to minimize.
[2023-04-06 21:06:56] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2023-04-06 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 487 ms
[2023-04-06 21:06:56] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 0 ms to minimize.
[2023-04-06 21:06:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
[2023-04-06 21:06:57] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:06:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:06:58] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2023-04-06 21:06:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:06:59] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2023-04-06 21:06:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-04-06 21:07:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:07:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 21:07:04] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:07:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 21:07:05] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:07:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2023-04-06 21:07:06] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-04-06 21:07:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 21:07:09] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 1 ms to minimize.
[2023-04-06 21:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-04-06 21:07:09] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 1 ms to minimize.
[2023-04-06 21:07:09] [INFO ] Deduced a trap composed of 48 places in 138 ms of which 0 ms to minimize.
[2023-04-06 21:07:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2023-04-06 21:07:10] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 1 ms to minimize.
[2023-04-06 21:07:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-04-06 21:07:11] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 0 ms to minimize.
[2023-04-06 21:07:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-04-06 21:07:16] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:07:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-06 21:07:28] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:07:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-06 21:07:37] [INFO ] After 81783ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :969
Attempting to minimize the solution found.
Minimization took 32862 ms.
[2023-04-06 21:08:10] [INFO ] After 148661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :969
Fused 969 Parikh solutions to 934 different solutions.
Parikh walk visited 0 properties in 4966 ms.
Support contains 162 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 53 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 342/342 places, 1701/1701 transitions.
Interrupted random walk after 322510 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 969) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 968) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 48982 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 967 properties.
[2023-04-06 21:09:35] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:09:35] [INFO ] Invariant cache hit.
[2023-04-06 21:09:40] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:09:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:10:13] [INFO ] After 38073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:967
[2023-04-06 21:10:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-06 21:10:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:10:45] [INFO ] After 22250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :967
[2023-04-06 21:10:45] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:11:16] [INFO ] After 31108ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :967
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 1 ms to minimize.
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 0 ms to minimize.
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 0 ms to minimize.
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 0 ms to minimize.
[2023-04-06 21:11:17] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1723 ms
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 1 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:11:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 212 ms
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:11:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 390 ms
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 0 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-04-06 21:11:20] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:11:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 21:11:21] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-04-06 21:11:21] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-04-06 21:11:21] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:11:21] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 194 ms
[2023-04-06 21:11:22] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2023-04-06 21:11:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2023-04-06 21:11:22] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:11:22] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:11:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-04-06 21:11:23] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2023-04-06 21:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-06 21:11:23] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:11:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-06 21:11:25] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 1 ms to minimize.
[2023-04-06 21:11:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-06 21:11:37] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:11:45] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:11:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-04-06 21:11:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 21:11:52] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 1 ms to minimize.
[2023-04-06 21:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-04-06 21:12:04] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 1 ms to minimize.
[2023-04-06 21:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 1 ms to minimize.
[2023-04-06 21:12:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2023-04-06 21:12:10] [INFO ] After 84725ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :967
Attempting to minimize the solution found.
Minimization took 32004 ms.
[2023-04-06 21:12:42] [INFO ] After 148916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :967
Fused 967 Parikh solutions to 957 different solutions.
Parikh walk visited 0 properties in 5028 ms.
Support contains 162 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 57 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 342/342 places, 1701/1701 transitions.
Interrupted random walk after 423713 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 967) seen :0
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 41571 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 967 properties.
[2023-04-06 21:13:59] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:13:59] [INFO ] Invariant cache hit.
[2023-04-06 21:14:05] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:14:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 10 ms returned sat
[2023-04-06 21:14:38] [INFO ] After 38147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:967
[2023-04-06 21:14:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-06 21:14:43] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:15:11] [INFO ] After 23016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :967
[2023-04-06 21:15:11] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:15:39] [INFO ] After 28470ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :967
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 1 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 1 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 0 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:15:40] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1602 ms
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 227 ms
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:15:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 0 ms to minimize.
[2023-04-06 21:15:42] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2023-04-06 21:15:43] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:15:43] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 21:15:43] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:15:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-04-06 21:15:44] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2023-04-06 21:15:44] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:15:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-04-06 21:15:44] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:15:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-06 21:15:45] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-04-06 21:15:45] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-04-06 21:15:45] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:15:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-04-06 21:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 21:15:48] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 0 ms to minimize.
[2023-04-06 21:15:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-04-06 21:15:59] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:15:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:16:07] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-06 21:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 21:16:07] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:16:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 21:16:13] [INFO ] Deduced a trap composed of 85 places in 150 ms of which 1 ms to minimize.
[2023-04-06 21:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2023-04-06 21:16:25] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2023-04-06 21:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-04-06 21:16:25] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:16:25] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2023-04-06 21:16:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 346 ms
[2023-04-06 21:16:31] [INFO ] After 79765ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :967
Attempting to minimize the solution found.
Minimization took 31172 ms.
[2023-04-06 21:17:02] [INFO ] After 143912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :967
Fused 967 Parikh solutions to 957 different solutions.
Parikh walk visited 0 properties in 4745 ms.
Support contains 162 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 39 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 37 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2023-04-06 21:17:07] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:17:07] [INFO ] Invariant cache hit.
[2023-04-06 21:17:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-06 21:17:07] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:17:07] [INFO ] Invariant cache hit.
[2023-04-06 21:17:07] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:17:07] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 825 ms to find 0 implicit places.
[2023-04-06 21:17:08] [INFO ] Redundant transitions in 90 ms returned []
[2023-04-06 21:17:08] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:17:08] [INFO ] Invariant cache hit.
[2023-04-06 21:17:08] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1452 ms. Remains : 342/342 places, 1701/1701 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2116 ms. (steps per millisecond=47 ) properties (out of 162) seen :90
Running SMT prover for 72 properties.
[2023-04-06 21:17:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:17:10] [INFO ] Invariant cache hit.
[2023-04-06 21:17:10] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:17:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:17:11] [INFO ] After 186ms SMT Verify possible using state equation in real domain returned unsat :0 sat :72
[2023-04-06 21:17:11] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:17:11] [INFO ] After 269ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :72
[2023-04-06 21:17:11] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 0 ms to minimize.
[2023-04-06 21:17:11] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 0 ms to minimize.
[2023-04-06 21:17:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 366 ms
[2023-04-06 21:17:12] [INFO ] Deduced a trap composed of 98 places in 123 ms of which 0 ms to minimize.
[2023-04-06 21:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 183 ms
[2023-04-06 21:17:13] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 1 ms to minimize.
[2023-04-06 21:17:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-04-06 21:17:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2023-04-06 21:17:15] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-04-06 21:17:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 21:17:16] [INFO ] After 5048ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:72
[2023-04-06 21:17:16] [INFO ] After 5426ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2023-04-06 21:17:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:17:16] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:17:16] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2023-04-06 21:17:16] [INFO ] After 373ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :72
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 1 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 0 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-04-06 21:17:17] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 0 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 0 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 1 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1717 ms
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-04-06 21:17:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-04-06 21:17:19] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:17:19] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:17:19] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:17:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 260 ms
[2023-04-06 21:17:19] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:17:19] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:17:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-04-06 21:17:20] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 21:17:20] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 0 ms to minimize.
[2023-04-06 21:17:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-04-06 21:17:20] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 0 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:17:21] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:17:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-04-06 21:17:22] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2023-04-06 21:17:22] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:17:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 180 ms
[2023-04-06 21:17:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 21:17:23] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2023-04-06 21:17:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:17:23] [INFO ] After 6734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
Attempting to minimize the solution found.
Minimization took 394 ms.
[2023-04-06 21:17:23] [INFO ] After 7444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
Interrupted random walk after 434378 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=14 ) properties seen 0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 967) seen :0
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 42140 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 967 properties.
[2023-04-06 21:18:36] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:18:36] [INFO ] Invariant cache hit.
[2023-04-06 21:18:41] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 21:18:41] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 21:19:13] [INFO ] After 36910ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:967
[2023-04-06 21:19:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:19:18] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:19:46] [INFO ] After 22996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :967
[2023-04-06 21:19:46] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:20:14] [INFO ] After 28223ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :967
[2023-04-06 21:20:14] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 28 places in 162 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2023-04-06 21:20:15] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1702 ms
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 47 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 203 ms
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 200 ms
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2023-04-06 21:20:17] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 407 ms
[2023-04-06 21:20:18] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-04-06 21:20:18] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2023-04-06 21:20:18] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2023-04-06 21:20:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-04-06 21:20:19] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2023-04-06 21:20:19] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2023-04-06 21:20:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-04-06 21:20:19] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-04-06 21:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:20:20] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:20:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2023-04-06 21:20:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2023-04-06 21:20:20] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:20:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-04-06 21:20:20] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:20:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 21:20:23] [INFO ] Deduced a trap composed of 80 places in 134 ms of which 1 ms to minimize.
[2023-04-06 21:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2023-04-06 21:20:34] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-04-06 21:20:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 21:20:42] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-06 21:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:20:42] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:20:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 21:20:49] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 0 ms to minimize.
[2023-04-06 21:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-04-06 21:21:00] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 1 ms to minimize.
[2023-04-06 21:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-04-06 21:21:01] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 0 ms to minimize.
[2023-04-06 21:21:01] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 0 ms to minimize.
[2023-04-06 21:21:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2023-04-06 21:21:06] [INFO ] After 79815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :967
Attempting to minimize the solution found.
Minimization took 31759 ms.
[2023-04-06 21:21:38] [INFO ] After 144537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :967
Fused 967 Parikh solutions to 957 different solutions.
Parikh walk visited 0 properties in 5060 ms.
Support contains 162 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 39 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 39 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2023-04-06 21:21:43] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:21:43] [INFO ] Invariant cache hit.
[2023-04-06 21:21:43] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-04-06 21:21:43] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:21:43] [INFO ] Invariant cache hit.
[2023-04-06 21:21:43] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:21:44] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2023-04-06 21:21:44] [INFO ] Redundant transitions in 30 ms returned []
[2023-04-06 21:21:44] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:21:44] [INFO ] Invariant cache hit.
[2023-04-06 21:21:44] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1393 ms. Remains : 342/342 places, 1701/1701 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 2346 ms. (steps per millisecond=42 ) properties (out of 162) seen :90
Running SMT prover for 72 properties.
[2023-04-06 21:21:46] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:21:46] [INFO ] Invariant cache hit.
[2023-04-06 21:21:47] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:21:47] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:21:47] [INFO ] After 204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :72
[2023-04-06 21:21:47] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:21:47] [INFO ] After 283ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :72
[2023-04-06 21:21:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-06 21:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:21:49] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 1 ms to minimize.
[2023-04-06 21:21:49] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 0 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 520 ms
[2023-04-06 21:21:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-04-06 21:21:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 21:21:50] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-06 21:21:50] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-04-06 21:21:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:21:51] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2023-04-06 21:21:51] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:21:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 21:21:52] [INFO ] After 4882ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:72
[2023-04-06 21:21:52] [INFO ] After 5190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:72
[2023-04-06 21:21:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:21:52] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:21:52] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :72
[2023-04-06 21:21:52] [INFO ] After 358ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :72
[2023-04-06 21:21:52] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 465 ms
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 0 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 369 ms
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 1 ms to minimize.
[2023-04-06 21:21:53] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 1 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-04-06 21:21:54] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 0 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 0 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1012 ms
[2023-04-06 21:21:55] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 0 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 286 ms
[2023-04-06 21:21:55] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 1 ms to minimize.
[2023-04-06 21:21:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2023-04-06 21:21:56] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 21:21:57] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-04-06 21:21:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:21:58] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-04-06 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-04-06 21:21:58] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:21:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2023-04-06 21:21:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 188 ms
[2023-04-06 21:21:59] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2023-04-06 21:21:59] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-04-06 21:21:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-06 21:21:59] [INFO ] After 6938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :72
Attempting to minimize the solution found.
Minimization took 429 ms.
[2023-04-06 21:21:59] [INFO ] After 7667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :72
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 282 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=294 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 302 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=151 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 376 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 237 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=237 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 532 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 397 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=198 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 631 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=315 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 506 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=253 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 761 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=380 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 281 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 417 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=208 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 577 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=288 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 605 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=302 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 142 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=142 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 441 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=220 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 586 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=293 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 578 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=192 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 181 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=181 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 239 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=119 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 542 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 675 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=337 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 118 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=118 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 280 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 330 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=330 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 596 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=298 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 140 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 255 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 276 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=138 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 106 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 423 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=423 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 275 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=137 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 284 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=142 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 429 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=429 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 579 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=289 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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 616264 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 616264 steps, saw 351354 distinct states, run finished after 3002 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:03] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:22:03] [INFO ] Invariant cache hit.
[2023-04-06 21:22:03] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:03] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:03] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:03] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:03] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:03] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:22:03] [INFO ] After 61ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2023-04-06 21:22:03] [INFO ] After 169ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 21:22:03] [INFO ] After 406ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 59 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 729008 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :{}
Probabilistic random walk after 729008 steps, saw 250712 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:22:06] [INFO ] Computed 22 invariants in 10 ms
[2023-04-06 21:22:06] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:06] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:07] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:07] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:07] [INFO ] After 43ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:07] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:22:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-04-06 21:22:07] [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 21 ms.
[2023-04-06 21:22:07] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 37 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 32 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:22:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:07] [INFO ] Invariant cache hit.
[2023-04-06 21:22:07] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-04-06 21:22:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:07] [INFO ] Invariant cache hit.
[2023-04-06 21:22:07] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:08] [INFO ] Implicit Places using invariants and state equation in 970 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-04-06 21:22:08] [INFO ] Redundant transitions in 82 ms returned []
[2023-04-06 21:22:08] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:08] [INFO ] Invariant cache hit.
[2023-04-06 21:22:09] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1802 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 369 place count 99 transition count 177
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 381 place count 93 transition count 177
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 387 place count 93 transition count 171
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 394 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 437 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 480 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 487 place count 50 transition count 121
Applied a total of 487 rules in 30 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2023-04-06 21:22:09] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 21:22:09] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:09] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:22:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:22:09] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:09] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:09] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:09] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:09] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:22:09] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 91 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 178 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=178 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 307 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=153 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 423 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=211 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 555 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=277 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 646 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=323 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649048 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649048 steps, saw 365895 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:12] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:22:12] [INFO ] Computed 22 invariants in 8 ms
[2023-04-06 21:22:12] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:12] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:12] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:12] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:12] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:12] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:22:12] [INFO ] After 63ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-06 21:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-06 21:22:13] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 21:22:13] [INFO ] After 428ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 50 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 68542 steps, run visited all 1 properties in 287 ms. (steps per millisecond=238 )
Probabilistic random walk after 68542 steps, saw 41426 distinct states, run finished after 287 ms. (steps per millisecond=238 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645944 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645944 steps, saw 364313 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:16] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:22:16] [INFO ] Invariant cache hit.
[2023-04-06 21:22:16] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:16] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:16] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:16] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:16] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:16] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:22:17] [INFO ] After 63ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:17] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 21:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:22:17] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-04-06 21:22:17] [INFO ] After 404ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 49 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) 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
Finished probabilistic random walk after 520654 steps, run visited all 1 properties in 2098 ms. (steps per millisecond=248 )
Probabilistic random walk after 520654 steps, saw 200529 distinct states, run finished after 2098 ms. (steps per millisecond=248 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 578966 steps, run visited all 1 properties in 2669 ms. (steps per millisecond=216 )
Probabilistic random walk after 578966 steps, saw 333761 distinct states, run finished after 2669 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 96174 steps, run visited all 1 properties in 442 ms. (steps per millisecond=217 )
Probabilistic random walk after 96174 steps, saw 65378 distinct states, run finished after 442 ms. (steps per millisecond=217 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652744 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652744 steps, saw 367468 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:25] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:22:25] [INFO ] Invariant cache hit.
[2023-04-06 21:22:25] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:25] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:22:25] [INFO ] After 221ms 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 15 positive place invariants in 8 ms returned sat
[2023-04-06 21:22:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:22:25] [INFO ] After 172ms 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 424 read => feed constraints.
[2023-04-06 21:22:26] [INFO ] After 57ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-06 21:22:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-06 21:22:26] [INFO ] After 155ms 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:22:26] [INFO ] After 429ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 38 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 26934 steps, run visited all 1 properties in 117 ms. (steps per millisecond=230 )
Probabilistic random walk after 26934 steps, saw 18143 distinct states, run finished after 117 ms. (steps per millisecond=230 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 5605 steps, including 1 resets, run visited all 1 properties in 12 ms. (steps per millisecond=467 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652992 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652992 steps, saw 367478 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:29] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:22:29] [INFO ] Invariant cache hit.
[2023-04-06 21:22:29] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:29] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:29] [INFO ] After 214ms 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 15 positive place invariants in 17 ms returned sat
[2023-04-06 21:22:29] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:29] [INFO ] After 153ms 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 424 read => feed constraints.
[2023-04-06 21:22:29] [INFO ] After 64ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:30] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-06 21:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 21:22:30] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-06 21:22:30] [INFO ] After 452ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 35 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 749152 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 749152 steps, saw 253110 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:22:33] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 21:22:33] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:33] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:22:33] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:33] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:22:33] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:33] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:33] [INFO ] After 48ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:33] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2023-04-06 21:22:33] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-04-06 21:22:33] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2023-04-06 21:22:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 254 ms
[2023-04-06 21:22:33] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 21:22:33] [INFO ] After 523ms 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 36 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:22:33] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:33] [INFO ] Invariant cache hit.
[2023-04-06 21:22:34] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-04-06 21:22:34] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:34] [INFO ] Invariant cache hit.
[2023-04-06 21:22:34] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:35] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1261 ms to find 0 implicit places.
[2023-04-06 21:22:35] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-06 21:22:35] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:35] [INFO ] Invariant cache hit.
[2023-04-06 21:22:35] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1749 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 18 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2023-04-06 21:22:35] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 21:22:35] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:35] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:22:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:22:35] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:35] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:35] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:35] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:35] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:22:35] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651840 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651840 steps, saw 367358 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:38] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:22:38] [INFO ] Computed 22 invariants in 11 ms
[2023-04-06 21:22:38] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:38] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:22:39] [INFO ] After 207ms 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 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:39] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:39] [INFO ] After 143ms 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 424 read => feed constraints.
[2023-04-06 21:22:39] [INFO ] After 61ms SMT Verify possible using 424 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 45 ms of which 0 ms to minimize.
[2023-04-06 21:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-06 21:22:39] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-04-06 21:22:39] [INFO ] After 417ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 36 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 744160 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 744160 steps, saw 252443 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:42] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:22:42] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 21:22:42] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:42] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:42] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:42] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:42] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:42] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:42] [INFO ] After 39ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:42] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 21:22:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-06 21:22:42] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-04-06 21:22:43] [INFO ] After 331ms 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 32 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:22:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:43] [INFO ] Invariant cache hit.
[2023-04-06 21:22:43] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-04-06 21:22:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:43] [INFO ] Invariant cache hit.
[2023-04-06 21:22:43] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:22:44] [INFO ] Implicit Places using invariants and state equation in 984 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-04-06 21:22:44] [INFO ] Redundant transitions in 27 ms returned []
[2023-04-06 21:22:44] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:22:44] [INFO ] Invariant cache hit.
[2023-04-06 21:22:44] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1717 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 17 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2023-04-06 21:22:44] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 21:22:44] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:44] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:22:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:22:44] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:44] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:22:44] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:44] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:44] [INFO ] After 9ms 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:44] [INFO ] After 55ms 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 128790 steps, run visited all 1 properties in 594 ms. (steps per millisecond=216 )
Probabilistic random walk after 128790 steps, saw 85754 distinct states, run finished after 594 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 172198 steps, run visited all 1 properties in 804 ms. (steps per millisecond=214 )
Probabilistic random walk after 172198 steps, saw 111859 distinct states, run finished after 805 ms. (steps per millisecond=213 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 90342 steps, run visited all 1 properties in 415 ms. (steps per millisecond=217 )
Probabilistic random walk after 90342 steps, saw 61693 distinct states, run finished after 415 ms. (steps per millisecond=217 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 133406 steps, run visited all 1 properties in 616 ms. (steps per millisecond=216 )
Probabilistic random walk after 133406 steps, saw 88796 distinct states, run finished after 616 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 8938 steps, including 2 resets, run visited all 1 properties in 18 ms. (steps per millisecond=496 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 229926 steps, run visited all 1 properties in 1058 ms. (steps per millisecond=217 )
Probabilistic random walk after 229926 steps, saw 146021 distinct states, run finished after 1059 ms. (steps per millisecond=217 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 649472 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 649472 steps, saw 366174 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:51] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:22:51] [INFO ] Computed 22 invariants in 9 ms
[2023-04-06 21:22:51] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-06 21:22:51] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:22:51] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 21:22:51] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:51] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:22:52] [INFO ] After 58ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:52] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-06 21:22:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:22:52] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:22:52] [INFO ] After 401ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 36 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 123574 steps, run visited all 1 properties in 515 ms. (steps per millisecond=239 )
Probabilistic random walk after 123574 steps, saw 68256 distinct states, run finished after 516 ms. (steps per millisecond=239 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 47790 steps, run visited all 1 properties in 221 ms. (steps per millisecond=216 )
Probabilistic random walk after 47790 steps, saw 34076 distinct states, run finished after 221 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646136 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646136 steps, saw 364416 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:22:56] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:22:56] [INFO ] Invariant cache hit.
[2023-04-06 21:22:56] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:22:56] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:22:56] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:22:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:22:56] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2023-04-06 21:22:56] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:56] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:22:56] [INFO ] After 60ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:22:56] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-06 21:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 21:22:56] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-04-06 21:22:56] [INFO ] After 429ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 33 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 600326 steps, run visited all 1 properties in 2430 ms. (steps per millisecond=247 )
Probabilistic random walk after 600326 steps, saw 223795 distinct states, run finished after 2430 ms. (steps per millisecond=247 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 364350 steps, run visited all 1 properties in 1691 ms. (steps per millisecond=215 )
Probabilistic random walk after 364350 steps, saw 222216 distinct states, run finished after 1691 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 113158 steps, run visited all 1 properties in 532 ms. (steps per millisecond=212 )
Probabilistic random walk after 113158 steps, saw 76084 distinct states, run finished after 532 ms. (steps per millisecond=212 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 26470 steps, run visited all 1 properties in 123 ms. (steps per millisecond=215 )
Probabilistic random walk after 26470 steps, saw 19571 distinct states, run finished after 123 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22478 steps, run visited all 1 properties in 104 ms. (steps per millisecond=216 )
Probabilistic random walk after 22478 steps, saw 16711 distinct states, run finished after 105 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9766 steps, run visited all 1 properties in 47 ms. (steps per millisecond=207 )
Probabilistic random walk after 9766 steps, saw 7506 distinct states, run finished after 47 ms. (steps per millisecond=207 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69470 steps, run visited all 1 properties in 321 ms. (steps per millisecond=216 )
Probabilistic random walk after 69470 steps, saw 48247 distinct states, run finished after 322 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 156830 steps, run visited all 1 properties in 735 ms. (steps per millisecond=213 )
Probabilistic random walk after 156830 steps, saw 102967 distinct states, run finished after 735 ms. (steps per millisecond=213 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 137334 steps, run visited all 1 properties in 635 ms. (steps per millisecond=216 )
Probabilistic random walk after 137334 steps, saw 91235 distinct states, run finished after 635 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 65622 steps, run visited all 1 properties in 302 ms. (steps per millisecond=217 )
Probabilistic random walk after 65622 steps, saw 45757 distinct states, run finished after 302 ms. (steps per millisecond=217 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2966 steps, run visited all 1 properties in 16 ms. (steps per millisecond=185 )
Probabilistic random walk after 2966 steps, saw 2436 distinct states, run finished after 16 ms. (steps per millisecond=185 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2246 steps, run visited all 1 properties in 13 ms. (steps per millisecond=172 )
Probabilistic random walk after 2246 steps, saw 1845 distinct states, run finished after 13 ms. (steps per millisecond=172 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651992 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651992 steps, saw 367372 distinct states, run finished after 3002 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:07] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:23:07] [INFO ] Invariant cache hit.
[2023-04-06 21:23:07] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 21:23:07] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 21:23:07] [INFO ] After 215ms 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 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:23:07] [INFO ] After 149ms 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 424 read => feed constraints.
[2023-04-06 21:23:07] [INFO ] After 65ms SMT Verify possible using 424 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 43 ms of which 1 ms to minimize.
[2023-04-06 21:23:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-06 21:23:07] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-04-06 21:23:07] [INFO ] After 430ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 38 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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 738912 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{}
Probabilistic random walk after 738912 steps, saw 251888 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:23:10] [INFO ] Computed 22 invariants in 4 ms
[2023-04-06 21:23:10] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:10] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:10] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:11] [INFO ] After 104ms 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 220 read => feed constraints.
[2023-04-06 21:23:11] [INFO ] After 44ms SMT Verify possible using 220 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 37 ms of which 1 ms to minimize.
[2023-04-06 21:23:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-04-06 21:23:11] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 21:23:11] [INFO ] After 313ms 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 28 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:23:11] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:11] [INFO ] Invariant cache hit.
[2023-04-06 21:23:11] [INFO ] Implicit Places using invariants in 237 ms returned []
[2023-04-06 21:23:11] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:11] [INFO ] Invariant cache hit.
[2023-04-06 21:23:11] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:23:12] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1226 ms to find 0 implicit places.
[2023-04-06 21:23:12] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 21:23:12] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:12] [INFO ] Invariant cache hit.
[2023-04-06 21:23:12] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1705 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 93 transition count 179
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 18 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2023-04-06 21:23:13] [INFO ] Computed 15 invariants in 3 ms
[2023-04-06 21:23:13] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:13] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:23:13] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:13] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:13] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:13] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:13] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:23:13] [INFO ] After 63ms 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 650168 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 650168 steps, saw 366553 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:16] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:23:16] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 21:23:16] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:16] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-06 21:23:16] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:16] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:23:16] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:16] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:23:16] [INFO ] After 58ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:16] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:23:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-06 21:23:16] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-04-06 21:23:16] [INFO ] After 392ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 35 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 51886 steps, run visited all 1 properties in 219 ms. (steps per millisecond=236 )
Probabilistic random walk after 51886 steps, saw 32735 distinct states, run finished after 220 ms. (steps per millisecond=235 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 102246 steps, run visited all 1 properties in 471 ms. (steps per millisecond=217 )
Probabilistic random walk after 102246 steps, saw 69177 distinct states, run finished after 472 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 151782 steps, run visited all 1 properties in 702 ms. (steps per millisecond=216 )
Probabilistic random walk after 151782 steps, saw 99847 distinct states, run finished after 703 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 69038 steps, run visited all 1 properties in 319 ms. (steps per millisecond=216 )
Probabilistic random walk after 69038 steps, saw 48014 distinct states, run finished after 320 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1366 steps, run visited all 1 properties in 9 ms. (steps per millisecond=151 )
Probabilistic random walk after 1366 steps, saw 1152 distinct states, run finished after 9 ms. (steps per millisecond=151 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 758 steps, run visited all 1 properties in 6 ms. (steps per millisecond=126 )
Probabilistic random walk after 758 steps, saw 651 distinct states, run finished after 6 ms. (steps per millisecond=126 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 72278 steps, run visited all 1 properties in 334 ms. (steps per millisecond=216 )
Probabilistic random walk after 72278 steps, saw 50032 distinct states, run finished after 335 ms. (steps per millisecond=215 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 49510 steps, run visited all 1 properties in 235 ms. (steps per millisecond=210 )
Probabilistic random walk after 49510 steps, saw 35268 distinct states, run finished after 236 ms. (steps per millisecond=209 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 23638 steps, run visited all 1 properties in 110 ms. (steps per millisecond=214 )
Probabilistic random walk after 23638 steps, saw 17572 distinct states, run finished after 111 ms. (steps per millisecond=212 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 9014 steps, run visited all 1 properties in 44 ms. (steps per millisecond=204 )
Probabilistic random walk after 9014 steps, saw 6971 distinct states, run finished after 44 ms. (steps per millisecond=204 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10662 steps, run visited all 1 properties in 51 ms. (steps per millisecond=209 )
Probabilistic random walk after 10662 steps, saw 8235 distinct states, run finished after 52 ms. (steps per millisecond=205 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3854 steps, run visited all 1 properties in 20 ms. (steps per millisecond=192 )
Probabilistic random walk after 3854 steps, saw 3124 distinct states, run finished after 20 ms. (steps per millisecond=192 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 148 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=148 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 281 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=281 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 375 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=187 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 513 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=256 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 576 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=288 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 186 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 314 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=157 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 404 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=202 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 477 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=238 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 579 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=289 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 569 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=284 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 648824 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :{}
Probabilistic random walk after 648824 steps, saw 365797 distinct states, run finished after 3001 ms. (steps per millisecond=216 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:22] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2023-04-06 21:23:22] [INFO ] Invariant cache hit.
[2023-04-06 21:23:22] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 21:23:22] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:22] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:23] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:23:23] [INFO ] After 60ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:23] [INFO ] After 294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:23] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:23:23] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:23] [INFO ] After 61ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:23] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-04-06 21:23:23] [INFO ] After 316ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 34 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 743000 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :{}
Probabilistic random walk after 743000 steps, saw 252351 distinct states, run finished after 3001 ms. (steps per millisecond=247 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:26] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:23:26] [INFO ] Computed 22 invariants in 6 ms
[2023-04-06 21:23:26] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-04-06 21:23:26] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2023-04-06 21:23:26] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:23:26] [INFO ] After 39ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:26] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-04-06 21:23:26] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 21:23:26] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:26] [INFO ] After 40ms SMT Verify possible using 220 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 36 ms of which 0 ms to minimize.
[2023-04-06 21:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2023-04-06 21:23:26] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 21:23:26] [INFO ] After 303ms 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 26 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:23:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:27] [INFO ] Invariant cache hit.
[2023-04-06 21:23:27] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-04-06 21:23:27] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:27] [INFO ] Invariant cache hit.
[2023-04-06 21:23:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:23:28] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1211 ms to find 0 implicit places.
[2023-04-06 21:23:28] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 21:23:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:28] [INFO ] Invariant cache hit.
[2023-04-06 21:23:28] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1688 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 16 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 21:23:28] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 21:23:28] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:28] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:28] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:23:28] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:28] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:28] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:28] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 21:23:28] [INFO ] After 53ms 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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 651616 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 651616 steps, saw 367331 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:31] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:23:31] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 21:23:31] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:31] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:32] [INFO ] After 143ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:32] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:23:32] [INFO ] After 61ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:32] [INFO ] After 274ms 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 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:32] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:32] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:32] [INFO ] After 55ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:32] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:23:32] [INFO ] After 317ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 42 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 749000 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 749000 steps, saw 253054 distinct states, run finished after 3001 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:35] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 21:23:35] [INFO ] Computed 22 invariants in 5 ms
[2023-04-06 21:23:35] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:35] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 21:23:35] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:35] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:23:35] [INFO ] After 41ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:35] [INFO ] After 206ms 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 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:35] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:23:35] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:35] [INFO ] After 37ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:35] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-04-06 21:23:35] [INFO ] After 251ms 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 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 21:23:36] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:36] [INFO ] Invariant cache hit.
[2023-04-06 21:23:36] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-04-06 21:23:36] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:36] [INFO ] Invariant cache hit.
[2023-04-06 21:23:36] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 21:23:37] [INFO ] Implicit Places using invariants and state equation in 1000 ms returned []
Implicit Place search using SMT with State Equation took 1242 ms to find 0 implicit places.
[2023-04-06 21:23:37] [INFO ] Redundant transitions in 24 ms returned []
[2023-04-06 21:23:37] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 21:23:37] [INFO ] Invariant cache hit.
[2023-04-06 21:23:37] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1725 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 23 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 21:23:37] [INFO ] Computed 15 invariants in 0 ms
[2023-04-06 21:23:37] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:37] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 21:23:37] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:37] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 21:23:37] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:37] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:37] [INFO ] After 10ms 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:37] [INFO ] After 62ms 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 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 652296 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 652296 steps, saw 367402 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:23:40] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2023-04-06 21:23:40] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 21:23:40] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2023-04-06 21:23:41] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-06 21:23:41] [INFO ] State equation strengthened by 424 read => feed constraints.
[2023-04-06 21:23:41] [INFO ] After 59ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:41] [INFO ] After 281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 21:23:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:23:41] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:41] [INFO ] After 53ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 21:23:41] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-04-06 21:23:41] [INFO ] After 309ms 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 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 35 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/342 places, 1463/1701 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 520590 steps, run visited all 1 properties in 2118 ms. (steps per millisecond=245 )
Probabilistic random walk after 520590 steps, saw 200480 distinct states, run finished after 2119 ms. (steps per millisecond=245 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 251 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 554 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=184 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 187 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=187 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 269 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=269 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 398 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=398 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 433 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=216 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 572 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=286 )
Parikh walk visited 0 properties in 0 ms.
Finished random walk after 664 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=221 )
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10110 steps, run visited all 1 properties in 48 ms. (steps per millisecond=210 )
Probabilistic random walk after 10110 steps, saw 7778 distinct states, run finished after 48 ms. (steps per millisecond=210 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10118 steps, run visited all 1 properties in 49 ms. (steps per millisecond=206 )
Probabilistic random walk after 10118 steps, saw 7785 distinct states, run finished after 49 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10126 steps, run visited all 1 properties in 50 ms. (steps per millisecond=202 )
Probabilistic random walk after 10126 steps, saw 7792 distinct states, run finished after 51 ms. (steps per millisecond=198 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10134 steps, run visited all 1 properties in 48 ms. (steps per millisecond=211 )
Probabilistic random walk after 10134 steps, saw 7799 distinct states, run finished after 49 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10142 steps, run visited all 1 properties in 48 ms. (steps per millisecond=211 )
Probabilistic random walk after 10142 steps, saw 7806 distinct states, run finished after 49 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46862 steps, run visited all 1 properties in 218 ms. (steps per millisecond=214 )
Probabilistic random walk after 46862 steps, saw 33349 distinct states, run finished after 218 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13662 steps, run visited all 1 properties in 65 ms. (steps per millisecond=210 )
Probabilistic random walk after 13662 steps, saw 10321 distinct states, run finished after 65 ms. (steps per millisecond=210 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46838 steps, run visited all 1 properties in 216 ms. (steps per millisecond=216 )
Probabilistic random walk after 46838 steps, saw 33328 distinct states, run finished after 216 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46846 steps, run visited all 1 properties in 230 ms. (steps per millisecond=203 )
Probabilistic random walk after 46846 steps, saw 33335 distinct states, run finished after 231 ms. (steps per millisecond=202 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 46854 steps, run visited all 1 properties in 215 ms. (steps per millisecond=217 )
Probabilistic random walk after 46854 steps, saw 33342 distinct states, run finished after 216 ms. (steps per millisecond=216 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16942 steps, run visited all 1 properties in 79 ms. (steps per millisecond=214 )
Probabilistic random walk after 16942 steps, saw 12667 distinct states, run finished after 79 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16950 steps, run visited all 1 properties in 79 ms. (steps per millisecond=214 )
Probabilistic random walk after 16950 steps, saw 12674 distinct states, run finished after 80 ms. (steps per millisecond=211 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16918 steps, run visited all 1 properties in 79 ms. (steps per millisecond=214 )
Probabilistic random walk after 16918 steps, saw 12646 distinct states, run finished after 79 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16926 steps, run visited all 1 properties in 79 ms. (steps per millisecond=214 )
Probabilistic random walk after 16926 steps, saw 12653 distinct states, run finished after 79 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16934 steps, run visited all 1 properties in 79 ms. (steps per millisecond=214 )
Probabilistic random walk after 16934 steps, saw 12660 distinct states, run finished after 79 ms. (steps per millisecond=214 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6190 steps, run visited all 1 properties in 31 ms. (steps per millisecond=199 )
Probabilistic random walk after 6190 steps, saw 4788 distinct states, run finished after 31 ms. (steps per millisecond=199 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6198 steps, run visited all 1 properties in 30 ms. (steps per millisecond=206 )
Probabilistic random walk after 6198 steps, saw 4795 distinct states, run finished after 30 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6206 steps, run visited all 1 properties in 35 ms. (steps per millisecond=177 )
Probabilistic random walk after 6206 steps, saw 4802 distinct states, run finished after 35 ms. (steps per millisecond=177 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6174 steps, run visited all 1 properties in 30 ms. (steps per millisecond=205 )
Probabilistic random walk after 6174 steps, saw 4774 distinct states, run finished after 30 ms. (steps per millisecond=205 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 6182 steps, run visited all 1 properties in 30 ms. (steps per millisecond=206 )
Probabilistic random walk after 6182 steps, saw 4781 distinct states, run finished after 30 ms. (steps per millisecond=206 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1846 steps, run visited all 1 properties in 11 ms. (steps per millisecond=167 )
Probabilistic random walk after 1846 steps, saw 1516 distinct states, run finished after 11 ms. (steps per millisecond=167 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1854 steps, run visited all 1 properties in 11 ms. (steps per millisecond=168 )
Probabilistic random walk after 1854 steps, saw 1523 distinct states, run finished after 11 ms. (steps per millisecond=168 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1862 steps, run visited all 1 properties in 11 ms. (steps per millisecond=169 )
Probabilistic random walk after 1862 steps, saw 1530 distinct states, run finished after 11 ms. (steps per millisecond=169 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1870 steps, run visited all 1 properties in 11 ms. (steps per millisecond=170 )
Probabilistic random walk after 1870 steps, saw 1537 distinct states, run finished after 11 ms. (steps per millisecond=170 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1838 steps, run visited all 1 properties in 11 ms. (steps per millisecond=167 )
Probabilistic random walk after 1838 steps, saw 1509 distinct states, run finished after 11 ms. (steps per millisecond=167 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 518 steps, run visited all 1 properties in 5 ms. (steps per millisecond=103 )
Probabilistic random walk after 518 steps, saw 445 distinct states, run finished after 5 ms. (steps per millisecond=103 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 526 steps, run visited all 1 properties in 8 ms. (steps per millisecond=65 )
Probabilistic random walk after 526 steps, saw 452 distinct states, run finished after 8 ms. (steps per millisecond=65 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 534 steps, run visited all 1 properties in 5 ms. (steps per millisecond=106 )
Probabilistic random walk after 534 steps, saw 459 distinct states, run finished after 5 ms. (steps per millisecond=106 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 542 steps, run visited all 1 properties in 5 ms. (steps per millisecond=108 )
Probabilistic random walk after 542 steps, saw 466 distinct states, run finished after 5 ms. (steps per millisecond=108 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 550 steps, run visited all 1 properties in 5 ms. (steps per millisecond=110 )
Probabilistic random walk after 550 steps, saw 473 distinct states, run finished after 5 ms. (steps per millisecond=110 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 158 steps, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Probabilistic random walk after 158 steps, saw 141 distinct states, run finished after 3 ms. (steps per millisecond=52 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 166 steps, run visited all 1 properties in 3 ms. (steps per millisecond=55 )
Probabilistic random walk after 166 steps, saw 148 distinct states, run finished after 3 ms. (steps per millisecond=55 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 4 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Graph (trivial) has 201 edges and 342 vertex of which 15 / 342 are part of one of the 7 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 25 transitions
Ensure Unique test removed 962 transitions
Reduce isomorphic transitions removed 987 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 334 transition count 702
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 18 rules applied. Total rules applied 31 place count 322 transition count 696
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 37 place count 316 transition count 696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 37 place count 316 transition count 695
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 39 place count 315 transition count 695
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 313 transition count 693
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 45 place count 312 transition count 712
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 65 place count 312 transition count 692
Drop transitions removed 178 transitions
Redundant transition composition rules discarded 178 transitions
Iterating global reduction 4 with 178 rules applied. Total rules applied 243 place count 312 transition count 514
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 255 place count 306 transition count 568
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 289 place count 306 transition count 534
Free-agglomeration rule applied 46 times.
Iterating global reduction 4 with 46 rules applied. Total rules applied 335 place count 306 transition count 488
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 381 place count 260 transition count 488
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 387 place count 260 transition count 488
Applied a total of 387 rules in 25 ms. Remains 260 /342 variables (removed 82) and now considering 488/1701 (removed 1213) transitions.
Running SMT prover for 967 properties.
// Phase 1: matrix 488 rows 260 cols
[2023-04-06 21:23:46] [INFO ] Computed 22 invariants in 3 ms
[2023-04-06 21:23:50] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:23:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:24:13] [INFO ] After 19134ms SMT Verify possible using state equation in real domain returned unsat :0 sat :66 real:901
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2023-04-06 21:24:14] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2023-04-06 21:24:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-06 21:24:15] [INFO ] After 21142ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :7 real:960
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-04-06 21:24:16] [INFO ] After 29182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:966
[2023-04-06 21:24:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 21:24:19] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 21:24:38] [INFO ] After 15214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :967
[2023-04-06 21:24:39] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-04-06 21:24:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-04-06 21:24:41] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-04-06 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-04-06 21:24:41] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2023-04-06 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-04-06 21:24:41] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2023-04-06 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-04-06 21:24:41] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-04-06 21:24:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-04-06 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-04-06 21:25:00] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-04-06 21:25:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-04-06 21:25:03] [INFO ] After 39676ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :967
Attempting to minimize the solution found.
Minimization took 14745 ms.
[2023-04-06 21:25:18] [INFO ] After 62017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :967
Unable to solve all queries for examination QuasiLiveness. Remains :967 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 967 properties from file /home/mcc/execution/QuasiLiveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 1611758 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 07
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 553 places, 1960 transitions, 9212 arcs.
(potential((tk(P29)>=1) & (tk(P8)>=1)))
(potential((tk(P29)>=1) & (tk(P10)>=1)))
(potential((tk(P30)>=1) & (tk(P11)>=1)))
(potential((tk(P30)>=1) & (tk(P13)>=1)))
(potential((tk(P31)>=1) & (tk(P14)>=1)))
(potential((tk(P31)>=1) & (tk(P16)>=1)))
(potential((tk(P32)>=1) & (tk(P17)>=1)))
(potential((tk(P32)>=1) & (tk(P19)>=1)))
(potential((tk(P33)>=1) & (tk(P20)>=1)))
(potential((tk(P33)>=1) & (tk(P22)>=1)))
(potential((tk(P34)>=1) & (tk(P23)>=1)))
(potential((tk(P34)>=1) & (tk(P25)>=1)))
(potential((tk(P35)>=1) & (tk(P26)>=1)))
(potential((tk(P35)>=1) & (tk(P28)>=1)))
(potential((tk(P36)>=1) & (tk(P1)>=1)))
(potential((tk(P36)>=1) & (tk(P2)>=1)))
(potential((tk(P36)>=1) & (tk(P3)>=1)))
(potential((tk(P36)>=1) & (tk(P4)>=1)))
(potential((tk(P36)>=1) & (tk(P5)>=1)))
(potential((tk(P36)>=1) & (tk(P6)>=1)))
(potential((tk(P36)>=1) & (tk(P7)>=1)))
(potential((tk(P37)>=1) & (tk(P1)>=1)))
(potential((tk(P37)>=1) & (tk(P2)>=1)))
(potential((tk(P37)>=1) & (tk(P3)>=1)))
(potential((tk(P37)>=1) & (tk(P4)>=1)))
(potential((tk(P37)>=1) & (tk(P5)>=1)))
(potential((tk(P37)>=1) & (tk(P6)>=1)))
(potential((tk(P37)>=1) & (tk(P7)>=1)))
(potential((tk(P38)>=1) & (tk(P1)>=1)))
(potential((tk(P38)>=1) & (tk(P2)>=1)))
(potential((tk(P38)>=1) & (tk(P3)>=1)))
(potential((tk(P38)>=1) & (tk(P4)>=1)))
(potential((tk(P38)>=1) & (tk(P5)>=1)))
(potential((tk(P38)>=1) & (tk(P6)>=1)))
(potential((tk(P38)>=1) & (tk(P7)>=1)))
(potential((tk(P39)>=1) & (tk(P1)>=1)))
(potential((tk(P39)>=1) & (tk(P2)>=1)))
(potential((tk(P39)>=1) & (tk(P3)>=1)))
(potential((tk(P39)>=1) & (tk(P4)>=1)))
(potential((tk(P39)>=1) & (tk(P5)>=1)))
(potential((tk(P39)>=1) & (tk(P6)>=1)))
(potential((tk(P39)>=1) & (tk(P7)>=1)))
(potential((tk(P40)>=1) & (tk(P1)>=1)))
(potential((tk(P40)>=1) & (tk(P2)>=1)))
(potential((tk(P40)>=1) & (tk(P3)>=1)))
(potential((tk(P40)>=1) & (tk(P4)>=1)))
(potential((tk(P40)>=1) & (tk(P5)>=1)))
(potential((tk(P40)>=1) & (tk(P6)>=1)))
(potential((tk(P40)>=1) & (tk(P7)>=1)))
(potential((tk(P41)>=1) & (tk(P1)>=1)))
(potential((tk(P41)>=1) & (tk(P2)>=1)))
(potential((tk(P41)>=1) & (tk(P3)>=1)))
(potential((tk(P41)>=1) & (tk(P4)>=1)))
(potential((tk(P41)>=1) & (tk(P5)>=1)))
(potential((tk(P41)>=1) & (tk(P6)>=1)))
(potential((tk(P41)>=1) & (tk(P7)>=1)))
(potential((tk(P42)>=1) & (tk(P1)>=1)))
(potential((tk(P42)>=1) & (tk(P2)>=1)))
(potential((tk(P42)>=1) & (tk(P3)>=1)))
(potential((tk(P42)>=1) & (tk(P4)>=1)))
(potential((tk(P42)>=1) & (tk(P5)>=1)))
(potential((tk(P42)>=1) & (tk(P6)>=1)))
(potential((tk(P42)>=1) & (tk(P7)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P46)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P49)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P53)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P55)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P60)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P62)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P64)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P68)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P71)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P73)>=1)))
(potential((tk(P74)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P77)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P79)>=1)))
(potential((tk(P80)>=1)))
(potential((tk(P81)>=1)))
(potential((tk(P82)>=1)))
(potential((tk(P84)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P86)>=1)))
(potential((tk(P87)>=1)))
(potential((tk(P88)>=1)))
(potential((tk(P89)>=1)))
(potential((tk(P90)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P67)>=1)))
(potential((tk(P75)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P92)>=1) & (tk(P12)>=1)))
(potential((tk(P92)>=1) & (tk(P13)>=1)))
(potential((tk(P93)>=1) & (tk(P15)>=1)))
(potential((tk(P93)>=1) & (tk(P16)>=1)))
(potential((tk(P94)>=1) & (tk(P18)>=1)))
(potential((tk(P94)>=1) & (tk(P19)>=1)))
(potential((tk(P95)>=1) & (tk(P21)>=1)))
(potential((tk(P95)>=1) & (tk(P22)>=1)))
(potential((tk(P96)>=1) & (tk(P24)>=1)))
(potential((tk(P96)>=1) & (tk(P25)>=1)))
(potential((tk(P97)>=1) & (tk(P27)>=1)))
(potential((tk(P97)>=1) & (tk(P28)>=1)))
(potential((tk(P98)>=1) & (tk(P9)>=1)))
(potential((tk(P98)>=1) & (tk(P10)>=1)))
(potential((tk(P99)>=1) & (tk(P15)>=1)))
(potential((tk(P99)>=1) & (tk(P16)>=1)))
(potential((tk(P100)>=1) & (tk(P18)>=1)))
(potential((tk(P100)>=1) & (tk(P19)>=1)))
(potential((tk(P101)>=1) & (tk(P21)>=1)))
(potential((tk(P101)>=1) & (tk(P22)>=1)))
(potential((tk(P102)>=1) & (tk(P24)>=1)))
(potential((tk(P102)>=1) & (tk(P25)>=1)))
(potential((tk(P103)>=1) & (tk(P27)>=1)))
(potential((tk(P103)>=1) & (tk(P28)>=1)))
(potential((tk(P104)>=1) & (tk(P9)>=1)))
(potential((tk(P104)>=1) & (tk(P10)>=1)))
(potential((tk(P105)>=1) & (tk(P12)>=1)))
(potential((tk(P105)>=1) & (tk(P13)>=1)))
(potential((tk(P106)>=1) & (tk(P18)>=1)))
(potential((tk(P106)>=1) & (tk(P19)>=1)))
(potential((tk(P107)>=1) & (tk(P21)>=1)))
(potential((tk(P107)>=1) & (tk(P22)>=1)))
(potential((tk(P108)>=1) & (tk(P24)>=1)))
(potential((tk(P108)>=1) & (tk(P25)>=1)))
(potential((tk(P109)>=1) & (tk(P27)>=1)))
(potential((tk(P109)>=1) & (tk(P28)>=1)))
(potential((tk(P110)>=1) & (tk(P9)>=1)))
(potential((tk(P110)>=1) & (tk(P10)>=1)))
(potential((tk(P111)>=1) & (tk(P12)>=1)))
(potential((tk(P111)>=1) & (tk(P13)>=1)))
(potential((tk(P112)>=1) & (tk(P15)>=1)))
(potential((tk(P112)>=1) & (tk(P16)>=1)))
(potential((tk(P113)>=1) & (tk(P21)>=1)))
(potential((tk(P113)>=1) & (tk(P22)>=1)))
(potential((tk(P114)>=1) & (tk(P24)>=1)))
(potential((tk(P114)>=1) & (tk(P25)>=1)))
(potential((tk(P115)>=1) & (tk(P27)>=1)))
(potential((tk(P115)>=1) & (tk(P28)>=1)))
(potential((tk(P116)>=1) & (tk(P9)>=1)))
(potential((tk(P116)>=1) & (tk(P10)>=1)))
(potential((tk(P117)>=1) & (tk(P12)>=1)))
(potential((tk(P117)>=1) & (tk(P13)>=1)))
(potential((tk(P118)>=1) & (tk(P15)>=1)))
(potential((tk(P118)>=1) & (tk(P16)>=1)))
(potential((tk(P119)>=1) & (tk(P18)>=1)))
(potential((tk(P119)>=1) & (tk(P19)>=1)))
(potential((tk(P120)>=1) & (tk(P24)>=1)))
(potential((tk(P120)>=1) & (tk(P25)>=1)))
(potential((tk(P121)>=1) & (tk(P27)>=1)))
(potential((tk(P121)>=1) & (tk(P28)>=1)))
(potential((tk(P122)>=1) & (tk(P9)>=1)))
(potential((tk(P122)>=1) & (tk(P10)>=1)))
(potential((tk(P123)>=1) & (tk(P12)>=1)))
(potential((tk(P123)>=1) & (tk(P13)>=1)))
(potential((tk(P124)>=1) & (tk(P15)>=1)))
(potential((tk(P124)>=1) & (tk(P16)>=1)))
(potential((tk(P125)>=1) & (tk(P18)>=1)))
(potential((tk(P125)>=1) & (tk(P19)>=1)))
(potential((tk(P126)>=1) & (tk(P21)>=1)))
(potential((tk(P126)>=1) & (tk(P22)>=1)))
(potential((tk(P127)>=1) & (tk(P27)>=1)))
(potential((tk(P127)>=1) & (tk(P28)>=1)))
(potential((tk(P128)>=1) & (tk(P9)>=1)))
(potential((tk(P128)>=1) & (tk(P10)>=1)))
(potential((tk(P129)>=1) & (tk(P12)>=1)))
(potential((tk(P129)>=1) & (tk(P13)>=1)))
(potential((tk(P130)>=1) & (tk(P15)>=1)))
(potential((tk(P130)>=1) & (tk(P16)>=1)))
(potential((tk(P131)>=1) & (tk(P18)>=1)))
(potential((tk(P131)>=1) & (tk(P19)>=1)))
(potential((tk(P132)>=1) & (tk(P21)>=1)))
(potential((tk(P132)>=1) & (tk(P22)>=1)))
(potential((tk(P133)>=1) & (tk(P24)>=1)))
(potential((tk(P133)>=1) & (tk(P25)>=1)))
(potential((tk(P92)>=1) & (tk(P11)>=1)))
(potential((tk(P93)>=1) & (tk(P14)>=1)))
(potential((tk(P94)>=1) & (tk(P17)>=1)))
(potential((tk(P95)>=1) & (tk(P20)>=1)))
(potential((tk(P96)>=1) & (tk(P23)>=1)))
(potential((tk(P97)>=1) & (tk(P26)>=1)))
(potential((tk(P98)>=1) & (tk(P8)>=1)))
(potential((tk(P99)>=1) & (tk(P14)>=1)))
(potential((tk(P100)>=1) & (tk(P17)>=1)))
(potential((tk(P101)>=1) & (tk(P20)>=1)))
(potential((tk(P102)>=1) & (tk(P23)>=1)))
(potential((tk(P103)>=1) & (tk(P26)>=1)))
(potential((tk(P104)>=1) & (tk(P8)>=1)))
(potential((tk(P105)>=1) & (tk(P11)>=1)))
(potential((tk(P106)>=1) & (tk(P17)>=1)))
(potential((tk(P107)>=1) & (tk(P20)>=1)))
(potential((tk(P108)>=1) & (tk(P23)>=1)))
(potential((tk(P109)>=1) & (tk(P26)>=1)))
(potential((tk(P110)>=1) & (tk(P8)>=1)))
(potential((tk(P111)>=1) & (tk(P11)>=1)))
(potential((tk(P112)>=1) & (tk(P14)>=1)))
(potential((tk(P113)>=1) & (tk(P20)>=1)))
(potential((tk(P114)>=1) & (tk(P23)>=1)))
(potential((tk(P115)>=1) & (tk(P26)>=1)))
(potential((tk(P116)>=1) & (tk(P8)>=1)))
(potential((tk(P117)>=1) & (tk(P11)>=1)))
(potential((tk(P118)>=1) & (tk(P14)>=1)))
(potential((tk(P119)>=1) & (tk(P17)>=1)))
(potential((tk(P120)>=1) & (tk(P23)>=1)))
(potential((tk(P121)>=1) & (tk(P26)>=1)))
(potential((tk(P122)>=1) & (tk(P8)>=1)))
(potential((tk(P123)>=1) & (tk(P11)>=1)))
(potential((tk(P124)>=1) & (tk(P14)>=1)))
(potential((tk(P125)>=1) & (tk(P17)>=1)))
(potential((tk(P126)>=1) & (tk(P20)>=1)))
(potential((tk(P127)>=1) & (tk(P26)>=1)))
(potential((tk(P128)>=1) & (tk(P8)>=1)))
(potential((tk(P129)>=1) & (tk(P11)>=1)))
(potential((tk(P130)>=1) & (tk(P14)>=1)))
(potential((tk(P131)>=1) & (tk(P17)>=1)))
(potential((tk(P132)>=1) & (tk(P20)>=1)))
(potential((tk(P133)>=1) & (tk(P23)>=1)))
(potential((tk(P134)>=1) & (tk(P1)>=1)))
(potential((tk(P134)>=1) & (tk(P2)>=1)))
(potential((tk(P134)>=1) & (tk(P3)>=1)))
(potential((tk(P134)>=1) & (tk(P4)>=1)))
(potential((tk(P134)>=1) & (tk(P5)>=1)))
(potential((tk(P134)>=1) & (tk(P6)>=1)))
(potential((tk(P134)>=1) & (tk(P7)>=1)))
(potential((tk(P135)>=1) & (tk(P1)>=1)))
(potential((tk(P135)>=1) & (tk(P2)>=1)))
(potential((tk(P135)>=1) & (tk(P3)>=1)))
(potential((tk(P135)>=1) & (tk(P4)>=1)))
(potential((tk(P135)>=1) & (tk(P5)>=1)))
(potential((tk(P135)>=1) & (tk(P6)>=1)))
(potential((tk(P135)>=1) & (tk(P7)>=1)))
(potential((tk(P136)>=1) & (tk(P1)>=1)))
(potential((tk(P136)>=1) & (tk(P2)>=1)))
(potential((tk(P136)>=1) & (tk(P3)>=1)))
(potential((tk(P136)>=1) & (tk(P4)>=1)))
(potential((tk(P136)>=1) & (tk(P5)>=1)))
(potential((tk(P136)>=1) & (tk(P6)>=1)))
(potential((tk(P136)>=1) & (tk(P7)>=1)))
(potential((tk(P137)>=1) & (tk(P1)>=1)))
(potential((tk(P137)>=1) & (tk(P2)>=1)))
(potential((tk(P137)>=1) & (tk(P3)>=1)))
(potential((tk(P137)>=1) & (tk(P4)>=1)))
(potential((tk(P137)>=1) & (tk(P5)>=1)))
(potential((tk(P137)>=1) & (tk(P6)>=1)))
(potential((tk(P137)>=1) & (tk(P7)>=1)))
(potential((tk(P138)>=1) & (tk(P1)>=1)))
(potential((tk(P138)>=1) & (tk(P2)>=1)))
(potential((tk(P138)>=1) & (tk(P3)>=1)))
(potential((tk(P138)>=1) & (tk(P4)>=1)))
(potential((tk(P138)>=1) & (tk(P5)>=1)))
(potential((tk(P138)>=1) & (tk(P6)>=1)))
(potential((tk(P138)>=1) & (tk(P7)>=1)))
(potential((tk(P139)>=1) & (tk(P1)>=1)))
(potential((tk(P139)>=1) & (tk(P2)>=1)))
(potential((tk(P139)>=1) & (tk(P3)>=1)))
(potential((tk(P139)>=1) & (tk(P4)>=1)))
(potential((tk(P139)>=1) & (tk(P5)>=1)))
(potential((tk(P139)>=1) & (tk(P6)>=1)))
(potential((tk(P139)>=1) & (tk(P7)>=1)))
(potential((tk(P140)>=1) & (tk(P1)>=1)))
(potential((tk(P140)>=1) & (tk(P2)>=1)))
(potential((tk(P140)>=1) & (tk(P3)>=1)))
(potential((tk(P140)>=1) & (tk(P4)>=1)))
(potential((tk(P140)>=1) & (tk(P5)>=1)))
(potential((tk(P140)>=1) & (tk(P6)>=1)))
(potential((tk(P140)>=1) & (tk(P7)>=1)))
(potential((tk(P141)>=1) & (tk(P1)>=1)))
(potential((tk(P141)>=1) & (tk(P2)>=1)))
(potential((tk(P141)>=1) & (tk(P3)>=1)))
(potential((tk(P141)>=1) & (tk(P4)>=1)))
(potential((tk(P141)>=1) & (tk(P5)>=1)))
(potential((tk(P141)>=1) & (tk(P6)>=1)))
(potential((tk(P141)>=1) & (tk(P7)>=1)))
(potential((tk(P142)>=1) & (tk(P1)>=1)))
(potential((tk(P142)>=1) & (tk(P2)>=1)))
(potential((tk(P142)>=1) & (tk(P3)>=1)))
(potential((tk(P142)>=1) & (tk(P4)>=1)))
(potential((tk(P142)>=1) & (tk(P5)>=1)))
(potential((tk(P142)>=1) & (tk(P6)>=1)))
(potential((tk(P142)>=1) & (tk(P7)>=1)))
(potential((tk(P143)>=1) & (tk(P1)>=1)))
(potential((tk(P143)>=1) & (tk(P2)>=1)))
(potential((tk(P143)>=1) & (tk(P3)>=1)))
(potential((tk(P143)>=1) & (tk(P4)>=1)))
(potential((tk(P143)>=1) & (tk(P5)>=1)))
(potential((tk(P143)>=1) & (tk(P6)>=1)))
(potential((tk(P143)>=1) & (tk(P7)>=1)))
(potential((tk(P144)>=1) & (tk(P1)>=1)))
(potential((tk(P144)>=1) & (tk(P2)>=1)))
(potential((tk(P144)>=1) & (tk(P3)>=1)))
(potential((tk(P144)>=1) & (tk(P4)>=1)))
(potential((tk(P144)>=1) & (tk(P5)>=1)))
(potential((tk(P144)>=1) & (tk(P6)>=1)))
(potential((tk(P144)>=1) & (tk(P7)>=1)))
(potential((tk(P145)>=1) & (tk(P1)>=1)))
(potential((tk(P145)>=1) & (tk(P2)>=1)))
(potential((tk(P145)>=1) & (tk(P3)>=1)))
(potential((tk(P145)>=1) & (tk(P4)>=1)))
(potential((tk(P145)>=1) & (tk(P5)>=1)))
(potential((tk(P145)>=1) & (tk(P6)>=1)))
(potential((tk(P145)>=1) & (tk(P7)>=1)))
(potential((tk(P146)>=1) & (tk(P1)>=1)))
(potential((tk(P146)>=1) & (tk(P2)>=1)))
(potential((tk(P146)>=1) & (tk(P3)>=1)))
(potential((tk(P146)>=1) & (tk(P4)>=1)))
(potential((tk(P146)>=1) & (tk(P5)>=1)))
(potential((tk(P146)>=1) & (tk(P6)>=1)))
(potential((tk(P146)>=1) & (tk(P7)>=1)))
(potential((tk(P147)>=1) & (tk(P1)>=1)))
(potential((tk(P147)>=1) & (tk(P2)>=1)))
(potential((tk(P147)>=1) & (tk(P3)>=1)))
(potential((tk(P147)>=1) & (tk(P4)>=1)))
(potential((tk(P147)>=1) & (tk(P5)>=1)))
(potential((tk(P147)>=1) & (tk(P6)>=1)))
(potential((tk(P147)>=1) & (tk(P7)>=1)))
(potential((tk(P148)>=1) & (tk(P1)>=1)))
(potential((tk(P148)>=1) & (tk(P2)>=1)))
(potential((tk(P148)>=1) & (tk(P3)>=1)))
(potential((tk(P148)>=1) & (tk(P4)>=1)))
(potential((tk(P148)>=1) & (tk(P5)>=1)))
(potential((tk(P148)>=1) & (tk(P6)>=1)))
(potential((tk(P148)>=1) & (tk(P7)>=1)))
(potential((tk(P149)>=1) & (tk(P1)>=1)))
(potential((tk(P149)>=1) & (tk(P2)>=1)))
(potential((tk(P149)>=1) & (tk(P3)>=1)))
(potential((tk(P149)>=1) & (tk(P4)>=1)))
(potential((tk(P149)>=1) & (tk(P5)>=1)))
(potential((tk(P149)>=1) & (tk(P6)>=1)))
(potential((tk(P149)>=1) & (tk(P7)>=1)))
(potential((tk(P150)>=1) & (tk(P1)>=1)))
(potential((tk(P150)>=1) & (tk(P2)>=1)))
(potential((tk(P150)>=1) & (tk(P3)>=1)))
(potential((tk(P150)>=1) & (tk(P4)>=1)))
(potential((tk(P150)>=1) & (tk(P5)>=1)))
(potential((tk(P150)>=1) & (tk(P6)>=1)))
(potential((tk(P150)>=1) & (tk(P7)>=1)))
(potential((tk(P151)>=1) & (tk(P1)>=1)))
(potential((tk(P151)>=1) & (tk(P2)>=1)))
(potential((tk(P151)>=1) & (tk(P3)>=1)))
(potential((tk(P151)>=1) & (tk(P4)>=1)))
(potential((tk(P151)>=1) & (tk(P5)>=1)))
(potential((tk(P151)>=1) & (tk(P6)>=1)))
(potential((tk(P151)>=1) & (tk(P7)>=1)))
(potential((tk(P152)>=1) & (tk(P1)>=1)))
(potential((tk(P152)>=1) & (tk(P2)>=1)))
(potential((tk(P152)>=1) & (tk(P3)>=1)))
(potential((tk(P152)>=1) & (tk(P4)>=1)))
(potential((tk(P152)>=1) & (tk(P5)>=1)))
(potential((tk(P152)>=1) & (tk(P6)>=1)))
(potential((tk(P152)>=1) & (tk(P7)>=1)))
(potential((tk(P153)>=1) & (tk(P1)>=1)))
(potential((tk(P153)>=1) & (tk(P2)>=1)))
(potential((tk(P153)>=1) & (tk(P3)>=1)))
(potential((tk(P153)>=1) & (tk(P4)>=1)))
(potential((tk(P153)>=1) & (tk(P5)>=1)))
(potential((tk(P153)>=1) & (tk(P6)>=1)))
(potential((tk(P153)>=1) & (tk(P7)>=1)))
(potential((tk(P154)>=1) & (tk(P1)>=1)))
(potential((tk(P154)>=1) & (tk(P2)>=1)))
(potential((tk(P154)>=1) & (tk(P3)>=1)))
(potential((tk(P154)>=1) & (tk(P4)>=1)))
(potential((tk(P154)>=1) & (tk(P5)>=1)))
(potential((tk(P154)>=1) & (tk(P6)>=1)))
(potential((tk(P154)>=1) & (tk(P7)>=1)))
(potential((tk(P155)>=1) & (tk(P1)>=1)))
(potential((tk(P155)>=1) & (tk(P2)>=1)))
(potential((tk(P155)>=1) & (tk(P3)>=1)))
(potential((tk(P155)>=1) & (tk(P4)>=1)))
(potential((tk(P155)>=1) & (tk(P5)>=1)))
(potential((tk(P155)>=1) & (tk(P6)>=1)))
(potential((tk(P155)>=1) & (tk(P7)>=1)))
(potential((tk(P156)>=1) & (tk(P1)>=1)))
(potential((tk(P156)>=1) & (tk(P2)>=1)))
(potential((tk(P156)>=1) & (tk(P3)>=1)))
(potential((tk(P156)>=1) & (tk(P4)>=1)))
(potential((tk(P156)>=1) & (tk(P5)>=1)))
(potential((tk(P156)>=1) & (tk(P6)>=1)))
(potential((tk(P156)>=1) & (tk(P7)>=1)))
(potential((tk(P157)>=1) & (tk(P1)>=1)))
(potential((tk(P157)>=1) & (tk(P2)>=1)))
(potential((tk(P157)>=1) & (tk(P3)>=1)))
(potential((tk(P157)>=1) & (tk(P4)>=1)))
(potential((tk(P157)>=1) & (tk(P5)>=1)))
(potential((tk(P157)>=1) & (tk(P6)>=1)))
(potential((tk(P157)>=1) & (tk(P7)>=1)))
(potential((tk(P158)>=1) & (tk(P1)>=1)))
(potential((tk(P158)>=1) & (tk(P2)>=1)))
(potential((tk(P158)>=1) & (tk(P3)>=1)))
(potential((tk(P158)>=1) & (tk(P4)>=1)))
(potential((tk(P158)>=1) & (tk(P5)>=1)))
(potential((tk(P158)>=1) & (tk(P6)>=1)))
(potential((tk(P158)>=1) & (tk(P7)>=1)))
(potential((tk(P159)>=1) & (tk(P1)>=1)))
(potential((tk(P159)>=1) & (tk(P2)>=1)))
(potential((tk(P159)>=1) & (tk(P3)>=1)))
(potential((tk(P159)>=1) & (tk(P4)>=1)))
(potential((tk(P159)>=1) & (tk(P5)>=1)))
(potential((tk(P159)>=1) & (tk(P6)>=1)))
(potential((tk(P159)>=1) & (tk(P7)>=1)))
(potential((tk(P160)>=1) & (tk(P1)>=1)))
(potential((tk(P160)>=1) & (tk(P2)>=1)))
(potential((tk(P160)>=1) & (tk(P3)>=1)))
(potential((tk(P160)>=1) & (tk(P4)>=1)))
(potential((tk(P160)>=1) & (tk(P5)>=1)))
(potential((tk(P160)>=1) & (tk(P6)>=1)))
(potential((tk(P160)>=1) & (tk(P7)>=1)))
(potential((tk(P161)>=1) & (tk(P1)>=1)))
(potential((tk(P161)>=1) & (tk(P2)>=1)))
(potential((tk(P161)>=1) & (tk(P3)>=1)))
(potential((tk(P161)>=1) & (tk(P4)>=1)))
(potential((tk(P161)>=1) & (tk(P5)>=1)))
(potential((tk(P161)>=1) & (tk(P6)>=1)))
(potential((tk(P161)>=1) & (tk(P7)>=1)))
(potential((tk(P162)>=1) & (tk(P1)>=1)))
(potential((tk(P162)>=1) & (tk(P2)>=1)))
(potential((tk(P162)>=1) & (tk(P3)>=1)))
(potential((tk(P162)>=1) & (tk(P4)>=1)))
(potential((tk(P162)>=1) & (tk(P5)>=1)))
(potential((tk(P162)>=1) & (tk(P6)>=1)))
(potential((tk(P162)>=1) & (tk(P7)>=1)))
(potential((tk(P163)>=1) & (tk(P1)>=1)))
(potential((tk(P163)>=1) & (tk(P2)>=1)))
(potential((tk(P163)>=1) & (tk(P3)>=1)))
(potential((tk(P163)>=1) & (tk(P4)>=1)))
(potential((tk(P163)>=1) & (tk(P5)>=1)))
(potential((tk(P163)>=1) & (tk(P6)>=1)))
(potential((tk(P163)>=1) & (tk(P7)>=1)))
(potential((tk(P164)>=1) & (tk(P1)>=1)))
(potential((tk(P164)>=1) & (tk(P2)>=1)))
(potential((tk(P164)>=1) & (tk(P3)>=1)))
(potential((tk(P164)>=1) & (tk(P4)>=1)))
(potential((tk(P164)>=1) & (tk(P5)>=1)))
(potential((tk(P164)>=1) & (tk(P6)>=1)))
(potential((tk(P164)>=1) & (tk(P7)>=1)))
(potential((tk(P165)>=1) & (tk(P1)>=1)))
(potential((tk(P165)>=1) & (tk(P2)>=1)))
(potential((tk(P165)>=1) & (tk(P3)>=1)))
(potential((tk(P165)>=1) & (tk(P4)>=1)))
(potential((tk(P165)>=1) & (tk(P5)>=1)))
(potential((tk(P165)>=1) & (tk(P6)>=1)))
(potential((tk(P165)>=1) & (tk(P7)>=1)))
(potential((tk(P166)>=1) & (tk(P1)>=1)))
(potential((tk(P166)>=1) & (tk(P2)>=1)))
(potential((tk(P166)>=1) & (tk(P3)>=1)))
(potential((tk(P166)>=1) & (tk(P4)>=1)))
(potential((tk(P166)>=1) & (tk(P5)>=1)))
(potential((tk(P166)>=1) & (tk(P6)>=1)))
(potential((tk(P166)>=1) & (tk(P7)>=1)))
(potential((tk(P167)>=1) & (tk(P1)>=1)))
(potential((tk(P167)>=1) & (tk(P2)>=1)))
(potential((tk(P167)>=1) & (tk(P3)>=1)))
(potential((tk(P167)>=1) & (tk(P4)>=1)))
(potential((tk(P167)>=1) & (tk(P5)>=1)))
(potential((tk(P167)>=1) & (tk(P6)>=1)))
(potential((tk(P167)>=1) & (tk(P7)>=1)))
(potential((tk(P168)>=1) & (tk(P1)>=1)))
(potential((tk(P168)>=1) & (tk(P2)>=1)))
(potential((tk(P168)>=1) & (tk(P3)>=1)))
(potential((tk(P168)>=1) & (tk(P4)>=1)))
(potential((tk(P168)>=1) & (tk(P5)>=1)))
(potential((tk(P168)>=1) & (tk(P6)>=1)))
(potential((tk(P168)>=1) & (tk(P7)>=1)))
(potential((tk(P169)>=1) & (tk(P1)>=1)))
(potential((tk(P169)>=1) & (tk(P2)>=1)))
(potential((tk(P169)>=1) & (tk(P3)>=1)))
(potential((tk(P169)>=1) & (tk(P4)>=1)))
(potential((tk(P169)>=1) & (tk(P5)>=1)))
(potential((tk(P169)>=1) & (tk(P6)>=1)))
(potential((tk(P169)>=1) & (tk(P7)>=1)))
(potential((tk(P170)>=1) & (tk(P1)>=1)))
(potential((tk(P170)>=1) & (tk(P2)>=1)))
(potential((tk(P170)>=1) & (tk(P3)>=1)))
(potential((tk(P170)>=1) & (tk(P4)>=1)))
(potential((tk(P170)>=1) & (tk(P5)>=1)))
(potential((tk(P170)>=1) & (tk(P6)>=1)))
(potential((tk(P170)>=1) & (tk(P7)>=1)))
(potential((tk(P171)>=1) & (tk(P1)>=1)))
(potential((tk(P171)>=1) & (tk(P2)>=1)))
(potential((tk(P171)>=1) & (tk(P3)>=1)))
(potential((tk(P171)>=1) & (tk(P4)>=1)))
(potential((tk(P171)>=1) & (tk(P5)>=1)))
(potential((tk(P171)>=1) & (tk(P6)>=1)))
(potential((tk(P171)>=1) & (tk(P7)>=1)))
(potential((tk(P172)>=1) & (tk(P1)>=1)))
(potential((tk(P172)>=1) & (tk(P2)>=1)))
(potential((tk(P172)>=1) & (tk(P3)>=1)))
(potential((tk(P172)>=1) & (tk(P4)>=1)))
(potential((tk(P172)>=1) & (tk(P5)>=1)))
(potential((tk(P172)>=1) & (tk(P6)>=1)))
(potential((tk(P172)>=1) & (tk(P7)>=1)))
(potential((tk(P173)>=1) & (tk(P1)>=1)))
(potential((tk(P173)>=1) & (tk(P2)>=1)))
(potential((tk(P173)>=1) & (tk(P3)>=1)))
(potential((tk(P173)>=1) & (tk(P4)>=1)))
(potential((tk(P173)>=1) & (tk(P5)>=1)))
(potential((tk(P173)>=1) & (tk(P6)>=1)))
(potential((tk(P173)>=1) & (tk(P7)>=1)))
(potential((tk(P174)>=1) & (tk(P1)>=1)))
(potential((tk(P174)>=1) & (tk(P2)>=1)))
(potential((tk(P174)>=1) & (tk(P3)>=1)))
(potential((tk(P174)>=1) & (tk(P4)>=1)))
(potential((tk(P174)>=1) & (tk(P5)>=1)))
(potential((tk(P174)>=1) & (tk(P6)>=1)))
(potential((tk(P174)>=1) & (tk(P7)>=1)))
(potential((tk(P175)>=1) & (tk(P1)>=1)))
(potential((tk(P175)>=1) & (tk(P2)>=1)))
(potential((tk(P175)>=1) & (tk(P3)>=1)))
(potential((tk(P175)>=1) & (tk(P4)>=1)))
(potential((tk(P175)>=1) & (tk(P5)>=1)))
(potential((tk(P175)>=1) & (tk(P6)>=1)))
(potential((tk(P175)>=1) & (tk(P7)>=1)))
(potential((tk(P176)>=1)))
(potential((tk(P177)>=1)))
(potential((tk(P178)>=1)))
(potential((tk(P179)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P182)>=1)))
(potential((tk(P183)>=1)))
(potential((tk(P184)>=1)))
(potential((tk(P185)>=1)))
(potential((tk(P186)>=1)))
(potential((tk(P187)>=1)))
(potential((tk(P188)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P190)>=1)))
(potential((tk(P191)>=1)))
(potential((tk(P192)>=1)))
(potential((tk(P193)>=1)))
(potential((tk(P194)>=1)))
(potential((tk(P195)>=1)))
(potential((tk(P196)>=1)))
(potential((tk(P197)>=1)))
(potential((tk(P198)>=1)))
(potential((tk(P199)>=1)))
(potential((tk(P200)>=1)))
(potential((tk(P201)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P203)>=1)))
(potential((tk(P204)>=1)))
(potential((tk(P205)>=1)))
(potential((tk(P206)>=1)))
(potential((tk(P207)>=1)))
(potential((tk(P208)>=1)))
(potential((tk(P209)>=1)))
(potential((tk(P210)>=1)))
(potential((tk(P211)>=1)))
(potential((tk(P212)>=1)))
(potential((tk(P213)>=1)))
(potential((tk(P214)>=1)))
(potential((tk(P215)>=1)))
(potential((tk(P216)>=1)))
(potential((tk(P217)>=1)))
(potential((tk(P260)>=1) & (tk(P9)>=1)))
(potential((tk(P261)>=1) & (tk(P12)>=1)))
(potential((tk(P262)>=1) & (tk(P15)>=1)))
(potential((tk(P263)>=1) & (tk(P18)>=1)))
(potential((tk(P264)>=1) & (tk(P21)>=1)))
(potential((tk(P265)>=1) & (tk(P24)>=1)))
(potential((tk(P266)>=1) & (tk(P27)>=1)))
(potential((tk(P267)>=1)))
(potential((tk(P268)>=1)))
(potential((tk(P269)>=1)))
(potential((tk(P270)>=1)))
(potential((tk(P271)>=1)))
(potential((tk(P272)>=1)))
(potential((tk(P273)>=1)))
(potential((tk(P274)>=1) & (tk(P10)>=1)))
(potential((tk(P275)>=1) & (tk(P11)>=1)))
(potential((tk(P275)>=1) & (tk(P12)>=1)))
(potential((tk(P276)>=1) & (tk(P14)>=1)))
(potential((tk(P276)>=1) & (tk(P15)>=1)))
(potential((tk(P277)>=1) & (tk(P17)>=1)))
(potential((tk(P277)>=1) & (tk(P18)>=1)))
(potential((tk(P278)>=1) & (tk(P20)>=1)))
(potential((tk(P278)>=1) & (tk(P21)>=1)))
(potential((tk(P279)>=1) & (tk(P23)>=1)))
(potential((tk(P279)>=1) & (tk(P24)>=1)))
(potential((tk(P280)>=1) & (tk(P26)>=1)))
(potential((tk(P280)>=1) & (tk(P27)>=1)))
(potential((tk(P282)>=1) & (tk(P8)>=1)))
(potential((tk(P282)>=1) & (tk(P9)>=1)))
(potential((tk(P283)>=1) & (tk(P13)>=1)))
(potential((tk(P284)>=1) & (tk(P14)>=1)))
(potential((tk(P284)>=1) & (tk(P15)>=1)))
(potential((tk(P285)>=1) & (tk(P17)>=1)))
(potential((tk(P285)>=1) & (tk(P18)>=1)))
(potential((tk(P286)>=1) & (tk(P20)>=1)))
(potential((tk(P286)>=1) & (tk(P21)>=1)))
(potential((tk(P287)>=1) & (tk(P23)>=1)))
(potential((tk(P287)>=1) & (tk(P24)>=1)))
(potential((tk(P288)>=1) & (tk(P26)>=1)))
(potential((tk(P288)>=1) & (tk(P27)>=1)))
(potential((tk(P290)>=1) & (tk(P8)>=1)))
(potential((tk(P290)>=1) & (tk(P9)>=1)))
(potential((tk(P291)>=1) & (tk(P11)>=1)))
(potential((tk(P291)>=1) & (tk(P12)>=1)))
(potential((tk(P292)>=1) & (tk(P16)>=1)))
(potential((tk(P293)>=1) & (tk(P17)>=1)))
(potential((tk(P293)>=1) & (tk(P18)>=1)))
(potential((tk(P294)>=1) & (tk(P20)>=1)))
(potential((tk(P294)>=1) & (tk(P21)>=1)))
(potential((tk(P295)>=1) & (tk(P23)>=1)))
(potential((tk(P295)>=1) & (tk(P24)>=1)))
(potential((tk(P296)>=1) & (tk(P26)>=1)))
(potential((tk(P296)>=1) & (tk(P27)>=1)))
(potential((tk(P298)>=1) & (tk(P8)>=1)))
(potential((tk(P298)>=1) & (tk(P9)>=1)))
(potential((tk(P299)>=1) & (tk(P11)>=1)))
(potential((tk(P299)>=1) & (tk(P12)>=1)))
(potential((tk(P300)>=1) & (tk(P14)>=1)))
(potential((tk(P300)>=1) & (tk(P15)>=1)))
(potential((tk(P301)>=1) & (tk(P19)>=1)))
(potential((tk(P302)>=1) & (tk(P20)>=1)))
(potential((tk(P302)>=1) & (tk(P21)>=1)))
(potential((tk(P303)>=1) & (tk(P23)>=1)))
(potential((tk(P303)>=1) & (tk(P24)>=1)))
(potential((tk(P304)>=1) & (tk(P26)>=1)))
(potential((tk(P304)>=1) & (tk(P27)>=1)))
(potential((tk(P306)>=1) & (tk(P8)>=1)))
(potential((tk(P306)>=1) & (tk(P9)>=1)))
(potential((tk(P307)>=1) & (tk(P11)>=1)))
(potential((tk(P307)>=1) & (tk(P12)>=1)))
(potential((tk(P308)>=1) & (tk(P14)>=1)))
(potential((tk(P308)>=1) & (tk(P15)>=1)))
(potential((tk(P309)>=1) & (tk(P17)>=1)))
(potential((tk(P309)>=1) & (tk(P18)>=1)))
(potential((tk(P310)>=1) & (tk(P22)>=1)))
(potential((tk(P311)>=1) & (tk(P23)>=1)))
(potential((tk(P311)>=1) & (tk(P24)>=1)))
(potential((tk(P312)>=1) & (tk(P26)>=1)))
(potential((tk(P312)>=1) & (tk(P27)>=1)))
(potential((tk(P314)>=1) & (tk(P8)>=1)))
(potential((tk(P314)>=1) & (tk(P9)>=1)))
(potential((tk(P315)>=1) & (tk(P11)>=1)))
(potential((tk(P315)>=1) & (tk(P12)>=1)))
(potential((tk(P316)>=1) & (tk(P14)>=1)))
(potential((tk(P316)>=1) & (tk(P15)>=1)))
(potential((tk(P317)>=1) & (tk(P17)>=1)))
(potential((tk(P317)>=1) & (tk(P18)>=1)))
(potential((tk(P318)>=1) & (tk(P20)>=1)))
(potential((tk(P318)>=1) & (tk(P21)>=1)))
(potential((tk(P319)>=1) & (tk(P25)>=1)))
(potential((tk(P320)>=1) & (tk(P26)>=1)))
(potential((tk(P320)>=1) & (tk(P27)>=1)))
(potential((tk(P322)>=1) & (tk(P8)>=1)))
(potential((tk(P322)>=1) & (tk(P9)>=1)))
(potential((tk(P323)>=1) & (tk(P11)>=1)))
(potential((tk(P323)>=1) & (tk(P12)>=1)))
(potential((tk(P324)>=1) & (tk(P14)>=1)))
(potential((tk(P324)>=1) & (tk(P15)>=1)))
(potential((tk(P325)>=1) & (tk(P17)>=1)))
(potential((tk(P325)>=1) & (tk(P18)>=1)))
(potential((tk(P326)>=1) & (tk(P20)>=1)))
(potential((tk(P326)>=1) & (tk(P21)>=1)))
(potential((tk(P327)>=1) & (tk(P23)>=1)))
(potential((tk(P327)>=1) & (tk(P24)>=1)))
(potential((tk(P328)>=1) & (tk(P28)>=1)))
(potential((tk(P281)>=1)))
(potential((tk(P289)>=1)))
(potential((tk(P297)>=1)))
(potential((tk(P305)>=1)))
(potential((tk(P313)>=1)))
(potential((tk(P321)>=1)))
(potential((tk(P329)>=1)))
(potential((tk(P275)>=1) & (tk(P13)>=1)))
(potential((tk(P276)>=1) & (tk(P16)>=1)))
(potential((tk(P277)>=1) & (tk(P19)>=1)))
(potential((tk(P278)>=1) & (tk(P22)>=1)))
(potential((tk(P279)>=1) & (tk(P25)>=1)))
(potential((tk(P280)>=1) & (tk(P28)>=1)))
(potential((tk(P282)>=1) & (tk(P10)>=1)))
(potential((tk(P284)>=1) & (tk(P16)>=1)))
(potential((tk(P285)>=1) & (tk(P19)>=1)))
(potential((tk(P286)>=1) & (tk(P22)>=1)))
(potential((tk(P287)>=1) & (tk(P25)>=1)))
(potential((tk(P288)>=1) & (tk(P28)>=1)))
(potential((tk(P290)>=1) & (tk(P10)>=1)))
(potential((tk(P291)>=1) & (tk(P13)>=1)))
(potential((tk(P293)>=1) & (tk(P19)>=1)))
(potential((tk(P294)>=1) & (tk(P22)>=1)))
(potential((tk(P295)>=1) & (tk(P25)>=1)))
(potential((tk(P296)>=1) & (tk(P28)>=1)))
(potential((tk(P298)>=1) & (tk(P10)>=1)))
(potential((tk(P299)>=1) & (tk(P13)>=1)))
(potential((tk(P300)>=1) & (tk(P16)>=1)))
(potential((tk(P302)>=1) & (tk(P22)>=1)))
(potential((tk(P303)>=1) & (tk(P25)>=1)))
(potential((tk(P304)>=1) & (tk(P28)>=1)))
(potential((tk(P306)>=1) & (tk(P10)>=1)))
(potential((tk(P307)>=1) & (tk(P13)>=1)))
(potential((tk(P308)>=1) & (tk(P16)>=1)))
(potential((tk(P309)>=1) & (tk(P19)>=1)))
(potential((tk(P311)>=1) & (tk(P25)>=1)))
(potential((tk(P312)>=1) & (tk(P28)>=1)))
(potential((tk(P314)>=1) & (tk(P10)>=1)))
(potential((tk(P315)>=1) & (tk(P13)>=1)))
(potential((tk(P316)>=1) & (tk(P16)>=1)))
(potential((tk(P317)>=1) & (tk(P19)>=1)))
(potential((tk(P318)>=1) & (tk(P22)>=1)))
(potential((tk(P320)>=1) & (tk(P28)>=1)))
(potential((tk(P322)>=1) & (tk(P10)>=1)))
(potential((tk(P323)>=1) & (tk(P13)>=1)))
(potential((tk(P324)>=1) & (tk(P16)>=1)))
(potential((tk(P325)>=1) & (tk(P19)>=1)))
(potential((tk(P326)>=1) & (tk(P22)>=1)))
(potential((tk(P327)>=1) & (tk(P25)>=1)))
(potential((tk(P330)>=1)))
(potential((tk(P331)>=1)))
(potential((tk(P332)>=1)))
(potential((tk(P333)>=1)))
(potential((tk(P334)>=1)))
(potential((tk(P335)>=1)))
(potential((tk(P336)>=1)))
(potential((tk(P337)>=1)))
(potential((tk(P338)>=1)))
(potential((tk(P339)>=1)))
(potential((tk(P340)>=1)))
(potential((tk(P341)>=1)))
(potential((tk(P342)>=1)))
(potential((tk(P343)>=1)))
(potential((tk(P344)>=1)))
(potential((tk(P345)>=1)))
(potential((tk(P346)>=1)))
(potential((tk(P347)>=1)))
(potential((tk(P348)>=1)))
(potential((tk(P349)>=1)))
(potential((tk(P350)>=1)))
(potential((tk(P351)>=1)))
(potential((tk(P352)>=1)))
(potential((tk(P353)>=1)))
(potential((tk(P354)>=1)))
(potential((tk(P355)>=1)))
(potential((tk(P356)>=1)))
(potential((tk(P357)>=1)))
(potential((tk(P358)>=1)))
(potential((tk(P359)>=1)))
(potential((tk(P360)>=1)))
(potential((tk(P361)>=1)))
(potential((tk(P362)>=1)))
(potential((tk(P363)>=1)))
(potential((tk(P364)>=1)))
(potential((tk(P365)>=1)))
(potential((tk(P366)>=1)))
(potential((tk(P367)>=1)))
(potential((tk(P368)>=1)))
(potential((tk(P369)>=1)))
(potential((tk(P370)>=1)))
(potential((tk(P371)>=1)))
(potential((tk(P372)>=1)))
(potential((tk(P373)>=1)))
(potential((tk(P374)>=1)))
(potential((tk(P375)>=1)))
(potential((tk(P376)>=1)))
(potential((tk(P377)>=1)))
(potential((tk(P378)>=1)))
(potential((tk(P385)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P385)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P385)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P385)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P385)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P385)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P385)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P392)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P392)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P392)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P392)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P392)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P392)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P392)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P399)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P399)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P399)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P399)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P399)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P399)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P399)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P406)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P406)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P406)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P406)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P406)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P406)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P406)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P413)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P413)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P413)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P413)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P413)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P413)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P413)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P420)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P420)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P420)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P420)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P420)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P420)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P420)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P427)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P427)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P427)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P427)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P427)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P427)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P427)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P379)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P379)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P379)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P379)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P379)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P379)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P379)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P379)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P379)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P379)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P379)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P379)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P379)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P379)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P379)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P379)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P379)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P379)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P380)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P380)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P380)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P380)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P380)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P380)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P380)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P380)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P380)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P380)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P380)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P380)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P380)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P380)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P380)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P380)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P380)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P380)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P381)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P381)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P381)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P381)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P381)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P381)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P381)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P381)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P381)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P381)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P381)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P381)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P381)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P381)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P381)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P381)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P381)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P381)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P382)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P382)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P382)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P382)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P382)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P382)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P382)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P382)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P382)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P382)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P382)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P382)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P382)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P382)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P382)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P382)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P382)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P382)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P383)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P383)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P383)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P383)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P383)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P383)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P383)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P383)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P383)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P383)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P383)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P383)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P383)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P383)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P383)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P383)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P383)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P383)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P384)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P384)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P384)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P384)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P384)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P384)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P384)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P384)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P384)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P384)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P384)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P384)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P384)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P384)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P384)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P384)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P384)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P384)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P385)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P385)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P385)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P385)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P385)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P385)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P385)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P385)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P385)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P385)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P385)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P385)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P386)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P386)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P386)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P386)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P386)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P386)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P386)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P386)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P386)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P386)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P386)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P386)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P386)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P386)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P386)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P386)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P386)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P386)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P387)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P387)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P387)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P387)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P387)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P387)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P387)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P387)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P387)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P387)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P387)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P387)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P387)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P387)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P387)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P387)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P387)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P387)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P388)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P388)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P388)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P388)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P388)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P388)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P388)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P388)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P388)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P388)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P388)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P388)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P388)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P388)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P388)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P388)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P388)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P388)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P389)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P389)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P389)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P389)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P389)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P389)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P389)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P389)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P389)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P389)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P389)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P389)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P389)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P389)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P389)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P389)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P389)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P389)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P390)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P390)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P390)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P390)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P390)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P390)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P390)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P390)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P390)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P390)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P390)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P390)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P390)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P390)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P390)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P390)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P390)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P390)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P391)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P391)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P391)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P391)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P391)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P391)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P391)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P391)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P391)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P391)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P391)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P391)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P391)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P391)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P391)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P391)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P391)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P391)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P392)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P392)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P392)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P392)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P392)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P392)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P392)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P392)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P392)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P392)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P392)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P392)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P393)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P393)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P393)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P393)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P393)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P393)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P393)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P393)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P393)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P393)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P393)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P393)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P393)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P393)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P393)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P393)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P393)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P393)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P394)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P394)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P394)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P394)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P394)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P394)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P394)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P394)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P394)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P394)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P394)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P394)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P394)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P394)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P394)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P394)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P394)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P394)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P395)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P395)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P395)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P395)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P395)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P395)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P395)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P395)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P395)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P395)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P395)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P395)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P395)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P395)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P395)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P395)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P395)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P395)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P396)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P396)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P396)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P396)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P396)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P396)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P396)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P396)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P396)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P396)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P396)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P396)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P396)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P396)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P396)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P396)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P396)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P396)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P397)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P397)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P397)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P397)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P397)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P397)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P397)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P397)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P397)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P397)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P397)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P397)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P397)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P397)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P397)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P397)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P397)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P397)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P398)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P398)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P398)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P398)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P398)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P398)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P398)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P398)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P398)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P398)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P398)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P398)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P398)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P398)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P398)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P398)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P398)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P398)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P399)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P399)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P399)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P399)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P399)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P399)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P399)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P399)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P399)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P399)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P399)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P399)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P400)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P400)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P400)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P400)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P400)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P400)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P400)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P400)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P400)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P400)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P400)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P400)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P400)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P400)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P400)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P400)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P400)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P400)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P401)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P401)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P401)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P401)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P401)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P401)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P401)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P401)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P401)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P401)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P401)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P401)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P401)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P401)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P401)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P401)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P401)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P401)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P402)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P402)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P402)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P402)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P402)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P402)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P402)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P402)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P402)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P402)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P402)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P402)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P402)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P402)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P402)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P402)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P402)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P402)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P403)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P403)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P403)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P403)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P403)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P403)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P403)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P403)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P403)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P403)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P403)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P403)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P403)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P403)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P403)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P403)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P403)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P403)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P404)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P404)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P404)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P404)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P404)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P404)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P404)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P404)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P404)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P404)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P404)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P404)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P404)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P404)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P404)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P404)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P404)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P404)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P405)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P405)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P405)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P405)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P405)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P405)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P405)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P405)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P405)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P405)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P405)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P405)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P405)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P405)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P405)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P405)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P405)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P405)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P406)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P406)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P406)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P406)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P406)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P406)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P406)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P406)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P406)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P406)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P406)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P406)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P407)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P407)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P407)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P407)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P407)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P407)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P407)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P407)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P407)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P407)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P407)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P407)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P407)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P407)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P407)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P407)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P407)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P407)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P408)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P408)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P408)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P408)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P408)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P408)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P408)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P408)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P408)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P408)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P408)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P408)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P408)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P408)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P408)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P408)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P408)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P408)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P409)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P409)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P409)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P409)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P409)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P409)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P409)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P409)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P409)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P409)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P409)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P409)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P409)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P409)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P409)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P409)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P409)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P409)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P410)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P410)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P410)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P410)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P410)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P410)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P410)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P410)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P410)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P410)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P410)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P410)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P410)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P410)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P410)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P410)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P410)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P410)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P411)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P411)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P411)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P411)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P411)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P411)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P411)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P411)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P411)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P411)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P411)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P411)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P411)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P411)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P411)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P411)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P411)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P411)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P412)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P412)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P412)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P412)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P412)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P412)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P412)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P412)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P412)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P412)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P412)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P412)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P412)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P412)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P412)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P412)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P412)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P412)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P413)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P413)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P413)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P413)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P413)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P413)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P413)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P413)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P413)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P413)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P413)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P413)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P414)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P414)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P414)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P414)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P414)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P414)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P414)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P414)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P414)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P414)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P414)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P414)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P414)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P414)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P414)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P414)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P414)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P414)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P415)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P415)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P415)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P415)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P415)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P415)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P415)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P415)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P415)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P415)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P415)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P415)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P415)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P415)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P415)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P415)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P415)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P415)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P416)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P416)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P416)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P416)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P416)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P416)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P416)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P416)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P416)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P416)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P416)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P416)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P416)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P416)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P416)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P416)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P416)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P416)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P417)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P417)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P417)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P417)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P417)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P417)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P417)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P417)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P417)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P417)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P417)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P417)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P417)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P417)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P417)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P417)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P417)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P417)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P418)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P418)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P418)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P418)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P418)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P418)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P418)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P418)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P418)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P418)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P418)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P418)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P418)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P418)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P418)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P418)>=1) & (tk(P7)>=1) & (tk(P26)>=1)))
(potential((tk(P418)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P418)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P419)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P419)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P419)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P419)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P419)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P419)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P419)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P419)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P419)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P419)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P419)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P419)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P419)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P419)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P419)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P419)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P419)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P419)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P420)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P420)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P420)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P420)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P420)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P420)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P420)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P420)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P420)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P420)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P420)>=1) & (tk(P7)>=1) & (tk(P27)>=1)))
(potential((tk(P420)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P421)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P421)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P421)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P421)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P421)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P421)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P421)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P421)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P421)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P421)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P421)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P421)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P421)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P421)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P421)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P421)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P421)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P421)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P422)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P422)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P422)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P422)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P422)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P422)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P422)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P422)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P422)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P422)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P422)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P422)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P422)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P422)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P422)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P422)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P422)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P422)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P423)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P423)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P423)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P423)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P423)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P423)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P423)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P423)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P423)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P423)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P423)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P423)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P423)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P423)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P423)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P423)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P423)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P423)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P424)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P424)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P424)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P424)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P424)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P424)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P424)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P424)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P424)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P424)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P424)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P424)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P424)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P424)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P424)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P424)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P424)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P424)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P425)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P425)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P425)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P425)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P425)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P425)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P425)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P425)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P425)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P425)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P425)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P425)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P425)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P425)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P425)>=1) & (tk(P6)>=1) & (tk(P23)>=1)))
(potential((tk(P425)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P425)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P425)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P426)>=1) & (tk(P1)>=1) & (tk(P8)>=1)))
(potential((tk(P426)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P426)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P426)>=1) & (tk(P2)>=1) & (tk(P11)>=1)))
(potential((tk(P426)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P426)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P426)>=1) & (tk(P3)>=1) & (tk(P14)>=1)))
(potential((tk(P426)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P426)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P426)>=1) & (tk(P4)>=1) & (tk(P17)>=1)))
(potential((tk(P426)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P426)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P426)>=1) & (tk(P5)>=1) & (tk(P20)>=1)))
(potential((tk(P426)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P426)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P426)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P426)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P426)>=1) & (tk(P7)>=1) & (tk(P28)>=1)))
(potential((tk(P427)>=1) & (tk(P1)>=1) & (tk(P9)>=1)))
(potential((tk(P427)>=1) & (tk(P1)>=1) & (tk(P10)>=1)))
(potential((tk(P427)>=1) & (tk(P2)>=1) & (tk(P12)>=1)))
(potential((tk(P427)>=1) & (tk(P2)>=1) & (tk(P13)>=1)))
(potential((tk(P427)>=1) & (tk(P3)>=1) & (tk(P15)>=1)))
(potential((tk(P427)>=1) & (tk(P3)>=1) & (tk(P16)>=1)))
(potential((tk(P427)>=1) & (tk(P4)>=1) & (tk(P18)>=1)))
(potential((tk(P427)>=1) & (tk(P4)>=1) & (tk(P19)>=1)))
(potential((tk(P427)>=1) & (tk(P5)>=1) & (tk(P21)>=1)))
(potential((tk(P427)>=1) & (tk(P5)>=1) & (tk(P22)>=1)))
(potential((tk(P427)>=1) & (tk(P6)>=1) & (tk(P24)>=1)))
(potential((tk(P427)>=1) & (tk(P6)>=1) & (tk(P25)>=1)))
(potential((tk(P428)>=1) & (tk(P1)>=1)))
(potential((tk(P428)>=1) & (tk(P2)>=1)))
(potential((tk(P428)>=1) & (tk(P3)>=1)))
(potential((tk(P428)>=1) & (tk(P4)>=1)))
(potential((tk(P428)>=1) & (tk(P5)>=1)))
(potential((tk(P428)>=1) & (tk(P6)>=1)))
(potential((tk(P428)>=1) & (tk(P7)>=1)))
(potential((tk(P429)>=1) & (tk(P1)>=1)))
(potential((tk(P429)>=1) & (tk(P2)>=1)))
(potential((tk(P429)>=1) & (tk(P3)>=1)))
(potential((tk(P429)>=1) & (tk(P4)>=1)))
(potential((tk(P429)>=1) & (tk(P5)>=1)))
(potential((tk(P429)>=1) & (tk(P6)>=1)))
(potential((tk(P429)>=1) & (tk(P7)>=1)))
(potential((tk(P430)>=1) & (tk(P1)>=1)))
(potential((tk(P430)>=1) & (tk(P2)>=1)))
(potential((tk(P430)>=1) & (tk(P3)>=1)))
(potential((tk(P430)>=1) & (tk(P4)>=1)))
(potential((tk(P430)>=1) & (tk(P5)>=1)))
(potential((tk(P430)>=1) & (tk(P6)>=1)))
(potential((tk(P430)>=1) & (tk(P7)>=1)))
(potential((tk(P431)>=1) & (tk(P1)>=1)))
(potential((tk(P431)>=1) & (tk(P2)>=1)))
(potential((tk(P431)>=1) & (tk(P3)>=1)))
(potential((tk(P431)>=1) & (tk(P4)>=1)))
(potential((tk(P431)>=1) & (tk(P5)>=1)))
(potential((tk(P431)>=1) & (tk(P6)>=1)))
(potential((tk(P431)>=1) & (tk(P7)>=1)))
(potential((tk(P432)>=1) & (tk(P1)>=1)))
(potential((tk(P432)>=1) & (tk(P2)>=1)))
(potential((tk(P432)>=1) & (tk(P3)>=1)))
(potential((tk(P432)>=1) & (tk(P4)>=1)))
(potential((tk(P432)>=1) & (tk(P5)>=1)))
(potential((tk(P432)>=1) & (tk(P6)>=1)))
(potential((tk(P432)>=1) & (tk(P7)>=1)))
(potential((tk(P433)>=1) & (tk(P1)>=1)))
(potential((tk(P433)>=1) & (tk(P2)>=1)))
(potential((tk(P433)>=1) & (tk(P3)>=1)))
(potential((tk(P433)>=1) & (tk(P4)>=1)))
(potential((tk(P433)>=1) & (tk(P5)>=1)))
(potential((tk(P433)>=1) & (tk(P6)>=1)))
(potential((tk(P433)>=1) & (tk(P7)>=1)))
(potential((tk(P434)>=1) & (tk(P1)>=1)))
(potential((tk(P434)>=1) & (tk(P2)>=1)))
(potential((tk(P434)>=1) & (tk(P3)>=1)))
(potential((tk(P434)>=1) & (tk(P4)>=1)))
(potential((tk(P434)>=1) & (tk(P5)>=1)))
(potential((tk(P434)>=1) & (tk(P6)>=1)))
(potential((tk(P434)>=1) & (tk(P7)>=1)))
(potential((tk(P547)>=1)))
(potential((tk(P548)>=1)))
(potential((tk(P549)>=1)))
(potential((tk(P550)>=1)))
(potential((tk(P551)>=1)))
(potential((tk(P552)>=1)))
(potential((tk(P553)>=1)))
(potential((tk(P435)>=1) & (tk(P1)>=1)))
(potential((tk(P436)>=1) & (tk(P2)>=1)))
(potential((tk(P437)>=1) & (tk(P3)>=1)))
(potential((tk(P438)>=1) & (tk(P4)>=1)))
(potential((tk(P439)>=1) & (tk(P5)>=1)))
(potential((tk(P440)>=1) & (tk(P6)>=1)))
(potential((tk(P441)>=1) & (tk(P7)>=1)))
(potential((tk(P443)>=1) & (tk(P11)>=1)))
(potential((tk(P444)>=1) & (tk(P14)>=1)))
(potential((tk(P445)>=1) & (tk(P17)>=1)))
(potential((tk(P446)>=1) & (tk(P20)>=1)))
(potential((tk(P447)>=1) & (tk(P23)>=1)))
(potential((tk(P448)>=1) & (tk(P26)>=1)))
(potential((tk(P449)>=1) & (tk(P8)>=1)))
(potential((tk(P451)>=1) & (tk(P14)>=1)))
(potential((tk(P452)>=1) & (tk(P17)>=1)))
(potential((tk(P453)>=1) & (tk(P20)>=1)))
(potential((tk(P454)>=1) & (tk(P23)>=1)))
(potential((tk(P455)>=1) & (tk(P26)>=1)))
(potential((tk(P456)>=1) & (tk(P8)>=1)))
(potential((tk(P457)>=1) & (tk(P11)>=1)))
(potential((tk(P459)>=1) & (tk(P17)>=1)))
(potential((tk(P460)>=1) & (tk(P20)>=1)))
(potential((tk(P461)>=1) & (tk(P23)>=1)))
(potential((tk(P462)>=1) & (tk(P26)>=1)))
(potential((tk(P463)>=1) & (tk(P8)>=1)))
(potential((tk(P464)>=1) & (tk(P11)>=1)))
(potential((tk(P465)>=1) & (tk(P14)>=1)))
(potential((tk(P467)>=1) & (tk(P20)>=1)))
(potential((tk(P468)>=1) & (tk(P23)>=1)))
(potential((tk(P469)>=1) & (tk(P26)>=1)))
(potential((tk(P470)>=1) & (tk(P8)>=1)))
(potential((tk(P471)>=1) & (tk(P11)>=1)))
(potential((tk(P472)>=1) & (tk(P14)>=1)))
(potential((tk(P473)>=1) & (tk(P17)>=1)))
(potential((tk(P475)>=1) & (tk(P23)>=1)))
(potential((tk(P476)>=1) & (tk(P26)>=1)))
(potential((tk(P477)>=1) & (tk(P8)>=1)))
(potential((tk(P478)>=1) & (tk(P11)>=1)))
(potential((tk(P479)>=1) & (tk(P14)>=1)))
(potential((tk(P480)>=1) & (tk(P17)>=1)))
(potential((tk(P481)>=1) & (tk(P20)>=1)))
(potential((tk(P483)>=1) & (tk(P26)>=1)))
(potential((tk(P484)>=1) & (tk(P8)>=1)))
(potential((tk(P485)>=1) & (tk(P11)>=1)))
(potential((tk(P486)>=1) & (tk(P14)>=1)))
(potential((tk(P487)>=1) & (tk(P17)>=1)))
(potential((tk(P488)>=1) & (tk(P20)>=1)))
(potential((tk(P489)>=1) & (tk(P23)>=1)))
(potential((tk(P442)>=1) & (tk(P10)>=1)))
(potential((tk(P443)>=1) & (tk(P12)>=1)))
(potential((tk(P443)>=1) & (tk(P13)>=1)))
(potential((tk(P444)>=1) & (tk(P15)>=1)))
(potential((tk(P444)>=1) & (tk(P16)>=1)))
(potential((tk(P445)>=1) & (tk(P18)>=1)))
(potential((tk(P445)>=1) & (tk(P19)>=1)))
(potential((tk(P446)>=1) & (tk(P21)>=1)))
(potential((tk(P446)>=1) & (tk(P22)>=1)))
(potential((tk(P447)>=1) & (tk(P24)>=1)))
(potential((tk(P447)>=1) & (tk(P25)>=1)))
(potential((tk(P448)>=1) & (tk(P27)>=1)))
(potential((tk(P448)>=1) & (tk(P28)>=1)))
(potential((tk(P449)>=1) & (tk(P9)>=1)))
(potential((tk(P449)>=1) & (tk(P10)>=1)))
(potential((tk(P450)>=1) & (tk(P13)>=1)))
(potential((tk(P451)>=1) & (tk(P15)>=1)))
(potential((tk(P451)>=1) & (tk(P16)>=1)))
(potential((tk(P452)>=1) & (tk(P18)>=1)))
(potential((tk(P452)>=1) & (tk(P19)>=1)))
(potential((tk(P453)>=1) & (tk(P21)>=1)))
(potential((tk(P453)>=1) & (tk(P22)>=1)))
(potential((tk(P454)>=1) & (tk(P24)>=1)))
(potential((tk(P454)>=1) & (tk(P25)>=1)))
(potential((tk(P455)>=1) & (tk(P27)>=1)))
(potential((tk(P455)>=1) & (tk(P28)>=1)))
(potential((tk(P456)>=1) & (tk(P9)>=1)))
(potential((tk(P456)>=1) & (tk(P10)>=1)))
(potential((tk(P457)>=1) & (tk(P12)>=1)))
(potential((tk(P457)>=1) & (tk(P13)>=1)))
(potential((tk(P458)>=1) & (tk(P16)>=1)))
(potential((tk(P459)>=1) & (tk(P18)>=1)))
(potential((tk(P459)>=1) & (tk(P19)>=1)))
(potential((tk(P460)>=1) & (tk(P21)>=1)))
(potential((tk(P460)>=1) & (tk(P22)>=1)))
(potential((tk(P461)>=1) & (tk(P24)>=1)))
(potential((tk(P461)>=1) & (tk(P25)>=1)))
(potential((tk(P462)>=1) & (tk(P27)>=1)))
(potential((tk(P462)>=1) & (tk(P28)>=1)))
(potential((tk(P463)>=1) & (tk(P9)>=1)))
(potential((tk(P463)>=1) & (tk(P10)>=1)))
(potential((tk(P464)>=1) & (tk(P12)>=1)))
(potential((tk(P464)>=1) & (tk(P13)>=1)))
(potential((tk(P465)>=1) & (tk(P15)>=1)))
(potential((tk(P465)>=1) & (tk(P16)>=1)))
(potential((tk(P466)>=1) & (tk(P19)>=1)))
(potential((tk(P467)>=1) & (tk(P21)>=1)))
(potential((tk(P467)>=1) & (tk(P22)>=1)))
(potential((tk(P468)>=1) & (tk(P24)>=1)))
(potential((tk(P468)>=1) & (tk(P25)>=1)))
(potential((tk(P469)>=1) & (tk(P27)>=1)))
(potential((tk(P469)>=1) & (tk(P28)>=1)))
(potential((tk(P470)>=1) & (tk(P9)>=1)))
(potential((tk(P470)>=1) & (tk(P10)>=1)))
(potential((tk(P471)>=1) & (tk(P12)>=1)))
(potential((tk(P471)>=1) & (tk(P13)>=1)))
(potential((tk(P472)>=1) & (tk(P15)>=1)))
(potential((tk(P472)>=1) & (tk(P16)>=1)))
(potential((tk(P473)>=1) & (tk(P18)>=1)))
(potential((tk(P473)>=1) & (tk(P19)>=1)))
(potential((tk(P474)>=1) & (tk(P22)>=1)))
(potential((tk(P475)>=1) & (tk(P24)>=1)))
(potential((tk(P475)>=1) & (tk(P25)>=1)))
(potential((tk(P476)>=1) & (tk(P27)>=1)))
(potential((tk(P476)>=1) & (tk(P28)>=1)))
(potential((tk(P477)>=1) & (tk(P9)>=1)))
(potential((tk(P477)>=1) & (tk(P10)>=1)))
(potential((tk(P478)>=1) & (tk(P12)>=1)))
(potential((tk(P478)>=1) & (tk(P13)>=1)))
(potential((tk(P479)>=1) & (tk(P15)>=1)))
(potential((tk(P479)>=1) & (tk(P16)>=1)))
(potential((tk(P480)>=1) & (tk(P18)>=1)))
(potential((tk(P480)>=1) & (tk(P19)>=1)))
(potential((tk(P481)>=1) & (tk(P21)>=1)))
(potential((tk(P481)>=1) & (tk(P22)>=1)))
(potential((tk(P482)>=1) & (tk(P25)>=1)))
(potential((tk(P483)>=1) & (tk(P27)>=1)))
(potential((tk(P483)>=1) & (tk(P28)>=1)))
(potential((tk(P484)>=1) & (tk(P9)>=1)))
(potential((tk(P484)>=1) & (tk(P10)>=1)))
(potential((tk(P485)>=1) & (tk(P12)>=1)))
(potential((tk(P485)>=1) & (tk(P13)>=1)))
(potential((tk(P486)>=1) & (tk(P15)>=1)))
(potential((tk(P486)>=1) & (tk(P16)>=1)))
(potential((tk(P487)>=1) & (tk(P18)>=1)))
(potential((tk(P487)>=1) & (tk(P19)>=1)))
(potential((tk(P488)>=1) & (tk(P21)>=1)))
(potential((tk(P488)>=1) & (tk(P22)>=1)))
(potential((tk(P489)>=1) & (tk(P24)>=1)))
(potential((tk(P489)>=1) & (tk(P25)>=1)))
(potential((tk(P490)>=1) & (tk(P28)>=1)))
(potential((tk(P218)>=1)))
(potential((tk(P219)>=1)))
(potential((tk(P220)>=1)))
(potential((tk(P221)>=1)))
(potential((tk(P222)>=1)))
(potential((tk(P223)>=1)))
(potential((tk(P224)>=1)))
(potential((tk(P225)>=1)))
(potential((tk(P226)>=1)))
(potential((tk(P227)>=1)))
(potential((tk(P228)>=1)))
(potential((tk(P229)>=1)))
(potential((tk(P230)>=1)))
(potential((tk(P231)>=1)))
(potential((tk(P232)>=1)))
(potential((tk(P233)>=1)))
(potential((tk(P234)>=1)))
(potential((tk(P235)>=1)))
(potential((tk(P236)>=1)))
(potential((tk(P237)>=1)))
(potential((tk(P238)>=1)))
(potential((tk(P239)>=1)))
(potential((tk(P240)>=1)))
(potential((tk(P241)>=1)))
(potential((tk(P242)>=1)))
(potential((tk(P243)>=1)))
(potential((tk(P244)>=1)))
(potential((tk(P245)>=1)))
(potential((tk(P246)>=1)))
(potential((tk(P247)>=1)))
(potential((tk(P248)>=1)))
(potential((tk(P249)>=1)))
(potential((tk(P250)>=1)))
(potential((tk(P251)>=1)))
(potential((tk(P252)>=1)))
(potential((tk(P253)>=1)))
(potential((tk(P254)>=1)))
(potential((tk(P255)>=1)))
(potential((tk(P256)>=1)))
(potential((tk(P257)>=1)))
(potential((tk(P258)>=1)))
(potential((tk(P259)>=1)))
(potential((tk(P491)>=1) & (tk(P1)>=1)))
(potential((tk(P492)>=1) & (tk(P1)>=1)))
(potential((tk(P493)>=1) & (tk(P1)>=1)))
(potential((tk(P494)>=1) & (tk(P1)>=1)))
(potential((tk(P495)>=1) & (tk(P1)>=1)))
(potential((tk(P496)>=1) & (tk(P1)>=1)))
(potential((tk(P497)>=1) & (tk(P1)>=1)))
(potential((tk(P498)>=1) & (tk(P2)>=1)))
(potential((tk(P499)>=1) & (tk(P2)>=1)))
(potential((tk(P500)>=1) & (tk(P2)>=1)))
(potential((tk(P501)>=1) & (tk(P2)>=1)))
(potential((tk(P502)>=1) & (tk(P2)>=1)))
(potential((tk(P503)>=1) & (tk(P2)>=1)))
(potential((tk(P504)>=1) & (tk(P2)>=1)))
(potential((tk(P505)>=1) & (tk(P3)>=1)))
(potential((tk(P506)>=1) & (tk(P3)>=1)))
(potential((tk(P507)>=1) & (tk(P3)>=1)))
(potential((tk(P508)>=1) & (tk(P3)>=1)))
(potential((tk(P509)>=1) & (tk(P3)>=1)))
(potential((tk(P510)>=1) & (tk(P3)>=1)))
(potential((tk(P511)>=1) & (tk(P3)>=1)))
(potential((tk(P512)>=1) & (tk(P4)>=1)))
(potential((tk(P513)>=1) & (tk(P4)>=1)))
(potential((tk(P514)>=1) & (tk(P4)>=1)))
(potential((tk(P515)>=1) & (tk(P4)>=1)))
(potential((tk(P516)>=1) & (tk(P4)>=1)))
(potential((tk(P517)>=1) & (tk(P4)>=1)))
(potential((tk(P518)>=1) & (tk(P4)>=1)))
(potential((tk(P519)>=1) & (tk(P5)>=1)))
(potential((tk(P520)>=1) & (tk(P5)>=1)))
(potential((tk(P521)>=1) & (tk(P5)>=1)))
(potential((tk(P522)>=1) & (tk(P5)>=1)))
(potential((tk(P523)>=1) & (tk(P5)>=1)))
(potential((tk(P524)>=1) & (tk(P5)>=1)))
(potential((tk(P525)>=1) & (tk(P5)>=1)))
(potential((tk(P526)>=1) & (tk(P6)>=1)))
(potential((tk(P527)>=1) & (tk(P6)>=1)))
(potential((tk(P528)>=1) & (tk(P6)>=1)))
(potential((tk(P529)>=1) & (tk(P6)>=1)))
(potential((tk(P530)>=1) & (tk(P6)>=1)))
(potential((tk(P531)>=1) & (tk(P6)>=1)))
(potential((tk(P532)>=1) & (tk(P6)>=1)))
(potential((tk(P533)>=1) & (tk(P7)>=1)))
(potential((tk(P534)>=1) & (tk(P7)>=1)))
(potential((tk(P535)>=1) & (tk(P7)>=1)))
(potential((tk(P536)>=1) & (tk(P7)>=1)))
(potential((tk(P537)>=1) & (tk(P7)>=1)))
(potential((tk(P538)>=1) & (tk(P7)>=1)))
(potential((tk(P539)>=1) & (tk(P7)>=1)))
(potential((tk(P540)>=1) & (tk(P10)>=1)))
(potential((tk(P541)>=1) & (tk(P13)>=1)))
(potential((tk(P542)>=1) & (tk(P16)>=1)))
(potential((tk(P543)>=1) & (tk(P19)>=1)))
(potential((tk(P544)>=1) & (tk(P22)>=1)))
(potential((tk(P545)>=1) & (tk(P25)>=1)))
(potential((tk(P546)>=1) & (tk(P28)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 15136124 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16163872 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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-07"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-07, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r537-tall-167987255000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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