Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r025-oct2-167813611800307.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-24b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-oct2-167813611800307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.1K Feb 25 18:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 18:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 18:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 18:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 18:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 18:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 538K Mar 5 18:22 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 1679007795174

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=AutoFlight-PT-24b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 23:03:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-16 23:03:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 23:03:17] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2023-03-16 23:03:17] [INFO ] Transformed 2230 places.
[2023-03-16 23:03:17] [INFO ] Transformed 2228 transitions.
[2023-03-16 23:03:17] [INFO ] Found NUPN structural information;
[2023-03-16 23:03:18] [INFO ] Parsed PT model containing 2230 places and 2228 transitions and 5186 arcs in 371 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2230/2230 places, 2228/2228 transitions.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 2230 transition count 1336
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1060 rules applied. Total rules applied 1952 place count 1338 transition count 1168
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 2 with 48 rules applied. Total rules applied 2000 place count 1290 transition count 1168
Performed 295 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 295 Pre rules applied. Total rules applied 2000 place count 1290 transition count 873
Deduced a syphon composed of 295 places in 15 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 3 with 590 rules applied. Total rules applied 2590 place count 995 transition count 873
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 1 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 3 with 868 rules applied. Total rules applied 3458 place count 561 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Applied a total of 3458 rules in 234 ms. Remains 561 /2230 variables (removed 1669) and now considering 439/2228 (removed 1789) transitions.
// Phase 1: matrix 439 rows 561 cols
[2023-03-16 23:03:18] [INFO ] Computed 148 place invariants in 21 ms
[2023-03-16 23:03:20] [INFO ] Implicit Places using invariants in 1772 ms returned [171, 174, 177, 180, 183, 186, 189, 192, 195, 198, 201, 204, 207, 210, 213, 216, 219, 222, 225, 228, 231, 234, 237, 240, 560]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 1806 ms to find 25 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 536/2230 places, 439/2228 transitions.
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 24 Pre rules applied. Total rules applied 0 place count 536 transition count 415
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 512 transition count 415
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 100 place count 486 transition count 389
Applied a total of 100 rules in 33 ms. Remains 486 /536 variables (removed 50) and now considering 389/439 (removed 50) transitions.
// Phase 1: matrix 389 rows 486 cols
[2023-03-16 23:03:20] [INFO ] Computed 123 place invariants in 4 ms
[2023-03-16 23:03:20] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-16 23:03:20] [INFO ] Invariant cache hit.
[2023-03-16 23:03:21] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-16 23:03:24] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 3984 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 486/2230 places, 389/2228 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6058 ms. Remains : 486/2230 places, 389/2228 transitions.
Discarding 96 transitions out of 389. Remains 293
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 620 ms. (steps per millisecond=16 ) properties (out of 292) seen :132
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 101 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 160) seen :0
Running SMT prover for 160 properties.
[2023-03-16 23:03:24] [INFO ] Invariant cache hit.
[2023-03-16 23:03:27] [INFO ] [Real]Absence check using 123 positive place invariants in 60 ms returned sat
[2023-03-16 23:03:39] [INFO ] After 14267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:160
[2023-03-16 23:03:41] [INFO ] [Nat]Absence check using 123 positive place invariants in 54 ms returned sat
[2023-03-16 23:03:50] [INFO ] After 6790ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :160
[2023-03-16 23:03:50] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-16 23:04:00] [INFO ] After 9431ms SMT Verify possible using 120 Read/Feed constraints in natural domain returned unsat :0 sat :160
[2023-03-16 23:04:00] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 5 ms to minimize.
[2023-03-16 23:04:00] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 6 ms to minimize.
[2023-03-16 23:04:01] [INFO ] Deduced a trap composed of 6 places in 945 ms of which 2 ms to minimize.
[2023-03-16 23:04:01] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 40 ms to minimize.
[2023-03-16 23:04:01] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-16 23:04:01] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2023-03-16 23:04:01] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2023-03-16 23:04:02] [INFO ] Deduced a trap composed of 6 places in 526 ms of which 1 ms to minimize.
[2023-03-16 23:04:03] [INFO ] Deduced a trap composed of 6 places in 891 ms of which 1 ms to minimize.
[2023-03-16 23:04:04] [INFO ] Deduced a trap composed of 6 places in 853 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
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:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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-03-16 23:04:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 23:04:04] [INFO ] After 25256ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:160
Parikh walk visited 126 properties in 22719 ms.
Support contains 68 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 389/389 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 461 transition count 364
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 461 transition count 364
Free-agglomeration rule applied 52 times.
Iterating global reduction 0 with 52 rules applied. Total rules applied 102 place count 461 transition count 312
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 154 place count 409 transition count 312
Applied a total of 154 rules in 72 ms. Remains 409 /486 variables (removed 77) and now considering 312/389 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 409/486 places, 312/389 transitions.
Interrupted random walk after 642437 steps, including 6372 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 11
Incomplete Best-First random walk after 100001 steps, including 64 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 508 ms. (steps per millisecond=196 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 550 ms. (steps per millisecond=181 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 82 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 516 ms. (steps per millisecond=193 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 415 ms. (steps per millisecond=240 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 520 ms. (steps per millisecond=192 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 530 ms. (steps per millisecond=188 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 533 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 71 resets, run finished after 534 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 540 ms. (steps per millisecond=185 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 532 ms. (steps per millisecond=187 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 85 resets, run finished after 521 ms. (steps per millisecond=191 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 80 resets, run finished after 549 ms. (steps per millisecond=182 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 79 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 69 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 78 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 312 rows 409 cols
[2023-03-16 23:05:09] [INFO ] Computed 123 place invariants in 2 ms
[2023-03-16 23:05:09] [INFO ] [Real]Absence check using 123 positive place invariants in 24 ms returned sat
[2023-03-16 23:05:11] [INFO ] After 1623ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:05:11] [INFO ] [Nat]Absence check using 123 positive place invariants in 25 ms returned sat
[2023-03-16 23:05:12] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:05:12] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-16 23:05:14] [INFO ] After 1887ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:05:17] [INFO ] After 4580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1813 ms.
[2023-03-16 23:05:19] [INFO ] After 8209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 610 ms.
Support contains 46 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 312/312 transitions.
Applied a total of 0 rules in 13 ms. Remains 409 /409 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 409/409 places, 312/312 transitions.
Interrupted random walk after 747901 steps, including 7383 resets, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 67 resets, run finished after 473 ms. (steps per millisecond=211 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 82 resets, run finished after 524 ms. (steps per millisecond=190 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 541 ms. (steps per millisecond=184 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 80 resets, run finished after 596 ms. (steps per millisecond=167 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 562 ms. (steps per millisecond=177 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 537 ms. (steps per millisecond=186 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 542 ms. (steps per millisecond=184 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 565 ms. (steps per millisecond=176 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 512 ms. (steps per millisecond=195 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 545 ms. (steps per millisecond=183 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 581 ms. (steps per millisecond=172 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 560 ms. (steps per millisecond=178 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 78 resets, run finished after 656 ms. (steps per millisecond=152 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 538 ms. (steps per millisecond=185 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 80 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 81 resets, run finished after 558 ms. (steps per millisecond=179 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 76 resets, run finished after 559 ms. (steps per millisecond=178 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 73 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 79 resets, run finished after 543 ms. (steps per millisecond=184 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 79 resets, run finished after 575 ms. (steps per millisecond=173 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 76 resets, run finished after 557 ms. (steps per millisecond=179 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 552 ms. (steps per millisecond=181 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 77 resets, run finished after 572 ms. (steps per millisecond=174 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 7367523 steps, run timeout after 126001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 7367523 steps, saw 2361189 distinct states, run finished after 126007 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 23 properties.
[2023-03-16 23:08:08] [INFO ] Invariant cache hit.
[2023-03-16 23:08:08] [INFO ] [Real]Absence check using 123 positive place invariants in 35 ms returned sat
[2023-03-16 23:08:10] [INFO ] After 1788ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:08:10] [INFO ] [Nat]Absence check using 123 positive place invariants in 42 ms returned sat
[2023-03-16 23:08:11] [INFO ] After 920ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:08:11] [INFO ] State equation strengthened by 172 read => feed constraints.
[2023-03-16 23:08:13] [INFO ] After 1623ms SMT Verify possible using 172 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:08:16] [INFO ] After 4166ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 1650 ms.
[2023-03-16 23:08:17] [INFO ] After 7403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 1144 ms.
Support contains 46 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 312/312 transitions.
Applied a total of 0 rules in 13 ms. Remains 409 /409 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 409/409 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 312/312 transitions.
Applied a total of 0 rules in 11 ms. Remains 409 /409 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-16 23:08:18] [INFO ] Invariant cache hit.
[2023-03-16 23:08:19] [INFO ] Implicit Places using invariants in 501 ms returned [1, 2, 6, 7, 11, 12, 16, 17, 21, 22, 26, 27, 31, 32, 36, 37, 41, 42, 46, 47, 51, 52, 56, 57, 61, 62, 66, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 92, 96, 97, 101, 102, 106, 107, 111, 112, 113, 114, 115, 116, 239, 312, 316, 320, 324, 328, 332, 336, 340, 344, 348, 352, 356, 360, 364, 368, 372, 376, 380, 384, 388, 392, 396, 400, 404]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 525 ms to find 75 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 334/409 places, 312/312 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 334 transition count 261
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 283 transition count 260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 282 transition count 260
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 104 place count 282 transition count 233
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 158 place count 255 transition count 233
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 181 place count 232 transition count 210
Iterating global reduction 3 with 23 rules applied. Total rules applied 204 place count 232 transition count 210
Applied a total of 204 rules in 21 ms. Remains 232 /334 variables (removed 102) and now considering 210/312 (removed 102) transitions.
// Phase 1: matrix 210 rows 232 cols
[2023-03-16 23:08:19] [INFO ] Computed 48 place invariants in 1 ms
[2023-03-16 23:08:19] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-16 23:08:19] [INFO ] Invariant cache hit.
[2023-03-16 23:08:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:08:20] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 232/409 places, 210/312 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1235 ms. Remains : 232/409 places, 210/312 transitions.
Interrupted random walk after 802145 steps, including 12715 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 67 resets, run finished after 296 ms. (steps per millisecond=337 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 307 ms. (steps per millisecond=325 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 331 ms. (steps per millisecond=302 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 301 ms. (steps per millisecond=332 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 319 ms. (steps per millisecond=313 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 323 ms. (steps per millisecond=309 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 281 ms. (steps per millisecond=355 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 357 ms. (steps per millisecond=280 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 93 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 340 ms. (steps per millisecond=294 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 340 ms. (steps per millisecond=294 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 85 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 303 ms. (steps per millisecond=330 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 350 ms. (steps per millisecond=285 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 244 ms. (steps per millisecond=409 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 315 ms. (steps per millisecond=317 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 318 ms. (steps per millisecond=314 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 93 resets, run finished after 346 ms. (steps per millisecond=289 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 93 resets, run finished after 322 ms. (steps per millisecond=310 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 319 ms. (steps per millisecond=313 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 96 resets, run finished after 300 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 15454773 steps, run timeout after 111001 ms. (steps per millisecond=139 ) properties seen :{}
Probabilistic random walk after 15454773 steps, saw 1952654 distinct states, run finished after 111002 ms. (steps per millisecond=139 ) properties seen :0
Running SMT prover for 23 properties.
[2023-03-16 23:10:48] [INFO ] Invariant cache hit.
[2023-03-16 23:10:48] [INFO ] [Real]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:10:49] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:10:49] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-16 23:10:50] [INFO ] After 499ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:10:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:10:51] [INFO ] After 535ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:10:52] [INFO ] After 1581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-16 23:10:52] [INFO ] After 2958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 2495 ms.
Support contains 46 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-16 23:10:55] [INFO ] Invariant cache hit.
[2023-03-16 23:10:55] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-16 23:10:55] [INFO ] Invariant cache hit.
[2023-03-16 23:10:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:10:55] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-16 23:10:55] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-16 23:10:55] [INFO ] Invariant cache hit.
[2023-03-16 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 232/232 places, 210/210 transitions.
Incomplete random walk after 100000 steps, including 1564 resets, run finished after 2698 ms. (steps per millisecond=37 ) properties (out of 46) seen :23
Running SMT prover for 23 properties.
[2023-03-16 23:10:58] [INFO ] Invariant cache hit.
[2023-03-16 23:10:58] [INFO ] [Real]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-16 23:10:58] [INFO ] After 70ms SMT Verify possible using state equation in real domain returned unsat :0 sat :23
[2023-03-16 23:10:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:10:58] [INFO ] After 37ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :23
[2023-03-16 23:10:59] [INFO ] After 958ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:10:59] [INFO ] After 1079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:10:59] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-16 23:11:00] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:11:00] [INFO ] After 57ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:11:00] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-16 23:11:00] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Interrupted random walk after 659277 steps, including 10486 resets, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen 0
Incomplete Best-First random walk after 100001 steps, including 67 resets, run finished after 278 ms. (steps per millisecond=359 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 338 ms. (steps per millisecond=295 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 344 ms. (steps per millisecond=290 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 84 resets, run finished after 343 ms. (steps per millisecond=291 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 345 ms. (steps per millisecond=289 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 355 ms. (steps per millisecond=281 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 75 resets, run finished after 372 ms. (steps per millisecond=268 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 88 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 369 ms. (steps per millisecond=271 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 363 ms. (steps per millisecond=275 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 87 resets, run finished after 357 ms. (steps per millisecond=280 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 91 resets, run finished after 357 ms. (steps per millisecond=280 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 362 ms. (steps per millisecond=276 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 92 resets, run finished after 361 ms. (steps per millisecond=277 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 83 resets, run finished after 332 ms. (steps per millisecond=301 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 351 ms. (steps per millisecond=284 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 340 ms. (steps per millisecond=294 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 328 ms. (steps per millisecond=304 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100000 steps, including 94 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 90 resets, run finished after 354 ms. (steps per millisecond=282 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 89 resets, run finished after 363 ms. (steps per millisecond=275 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 100001 steps, including 86 resets, run finished after 341 ms. (steps per millisecond=293 ) properties (out of 23) seen :0
Interrupted probabilistic random walk after 14918576 steps, run timeout after 111001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 14918576 steps, saw 1878042 distinct states, run finished after 111001 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 23 properties.
[2023-03-16 23:13:29] [INFO ] Invariant cache hit.
[2023-03-16 23:13:29] [INFO ] [Real]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:13:30] [INFO ] After 963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:13:30] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2023-03-16 23:13:31] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:13:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:32] [INFO ] After 575ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:13:33] [INFO ] After 1568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 510 ms.
[2023-03-16 23:13:33] [INFO ] After 3133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 2452 ms.
Support contains 46 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 210/210 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-16 23:13:36] [INFO ] Invariant cache hit.
[2023-03-16 23:13:36] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-16 23:13:36] [INFO ] Invariant cache hit.
[2023-03-16 23:13:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-16 23:13:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-16 23:13:36] [INFO ] Invariant cache hit.
[2023-03-16 23:13:36] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 232/232 places, 210/210 transitions.
Incomplete random walk after 100000 steps, including 1576 resets, run finished after 4852 ms. (steps per millisecond=20 ) properties (out of 46) seen :23
Running SMT prover for 23 properties.
[2023-03-16 23:13:41] [INFO ] Invariant cache hit.
[2023-03-16 23:13:41] [INFO ] [Real]Absence check using 48 positive place invariants in 8 ms returned sat
[2023-03-16 23:13:41] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :23
[2023-03-16 23:13:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:41] [INFO ] After 64ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :23
[2023-03-16 23:13:42] [INFO ] After 1008ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:13:42] [INFO ] After 1165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:13:42] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-16 23:13:43] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:13:43] [INFO ] After 144ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-16 23:13:44] [INFO ] After 1014ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-16 23:13:44] [INFO ] After 1311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Incomplete random walk after 10000 steps, including 157 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1368461 steps, run timeout after 3001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 1368461 steps, saw 204099 distinct states, run finished after 3001 ms. (steps per millisecond=456 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:13:47] [INFO ] Invariant cache hit.
[2023-03-16 23:13:47] [INFO ] [Real]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:13:47] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:13:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:47] [INFO ] After 19ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:47] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:47] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:13:47] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:47] [INFO ] After 15ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:47] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-16 23:13:47] [INFO ] After 185ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 230 transition count 208
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 73 place count 230 transition count 139
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 276 edges and 161 vertex of which 113 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 167 place count 113 transition count 115
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 191 place count 113 transition count 91
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 113 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 193 place count 112 transition count 90
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 87 edges and 90 vertex of which 44 / 90 are part of one of the 1 SCC in 2 ms
Free SCC test removed 43 places
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 2 with 64 rules applied. Total rules applied 257 place count 47 transition count 49
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 86 rules applied. Total rules applied 343 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 344 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 344 place count 5 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 346 place count 4 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 347 place count 4 transition count 3
Applied a total of 347 rules in 37 ms. Remains 4 /232 variables (removed 228) and now considering 3/210 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 4/232 places, 3/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 154 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1399664 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 1399664 steps, saw 208789 distinct states, run finished after 3001 ms. (steps per millisecond=466 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:13:50] [INFO ] Invariant cache hit.
[2023-03-16 23:13:50] [INFO ] [Real]Absence check using 48 positive place invariants in 13 ms returned sat
[2023-03-16 23:13:50] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:13:51] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:51] [INFO ] After 25ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:51] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 23:13:51] [INFO ] After 317ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 49 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 169 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1409325 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1409325 steps, saw 210601 distinct states, run finished after 3001 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:13:54] [INFO ] Invariant cache hit.
[2023-03-16 23:13:54] [INFO ] [Real]Absence check using 48 positive place invariants in 17 ms returned sat
[2023-03-16 23:13:54] [INFO ] After 140ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:13:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:54] [INFO ] After 29ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:54] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:54] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-16 23:13:54] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:54] [INFO ] After 32ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:54] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 23:13:54] [INFO ] After 334ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 29 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 157 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1413494 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :{}
Probabilistic random walk after 1413494 steps, saw 211616 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:13:58] [INFO ] Invariant cache hit.
[2023-03-16 23:13:58] [INFO ] [Real]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:13:58] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:13:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:13:58] [INFO ] After 38ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:58] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:13:58] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:13:58] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:58] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:13:58] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 23:13:58] [INFO ] After 254ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 63 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 155 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1452071 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :{}
Probabilistic random walk after 1452071 steps, saw 218539 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:01] [INFO ] Invariant cache hit.
[2023-03-16 23:14:01] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:01] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:02] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-16 23:14:02] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:02] [INFO ] After 36ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:02] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-16 23:14:02] [INFO ] After 236ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 23 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 169 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1408154 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :{}
Probabilistic random walk after 1408154 steps, saw 210373 distinct states, run finished after 3002 ms. (steps per millisecond=469 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:05] [INFO ] Invariant cache hit.
[2023-03-16 23:14:05] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:05] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:05] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:05] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:05] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:05] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-16 23:14:05] [INFO ] After 301ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 36 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 153 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1415262 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :{}
Probabilistic random walk after 1415262 steps, saw 211890 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:08] [INFO ] Invariant cache hit.
[2023-03-16 23:14:08] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:09] [INFO ] After 109ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:09] [INFO ] After 24ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:09] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:09] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-16 23:14:09] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:09] [INFO ] After 24ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:09] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-16 23:14:09] [INFO ] After 281ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 46 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 157 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1391006 steps, run timeout after 3001 ms. (steps per millisecond=463 ) properties seen :{}
Probabilistic random walk after 1391006 steps, saw 207625 distinct states, run finished after 3001 ms. (steps per millisecond=463 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:12] [INFO ] Invariant cache hit.
[2023-03-16 23:14:12] [INFO ] [Real]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:14:12] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:14:13] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:13] [INFO ] After 33ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:13] [INFO ] After 74ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 23:14:13] [INFO ] After 416ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 36 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 170 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1433366 steps, run timeout after 3001 ms. (steps per millisecond=477 ) properties seen :{}
Probabilistic random walk after 1433366 steps, saw 215201 distinct states, run finished after 3001 ms. (steps per millisecond=477 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:16] [INFO ] Invariant cache hit.
[2023-03-16 23:14:16] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:16] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:14:16] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:16] [INFO ] After 23ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:16] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 23:14:16] [INFO ] After 247ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 43 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 152 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1465489 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1465489 steps, saw 220701 distinct states, run finished after 3001 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:19] [INFO ] Invariant cache hit.
[2023-03-16 23:14:19] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:20] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:20] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:14:20] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:20] [INFO ] After 23ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:20] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 23:14:20] [INFO ] After 304ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 32 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 151 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1462362 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :{}
Probabilistic random walk after 1462362 steps, saw 220339 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:23] [INFO ] Invariant cache hit.
[2023-03-16 23:14:23] [INFO ] [Real]Absence check using 48 positive place invariants in 12 ms returned sat
[2023-03-16 23:14:23] [INFO ] After 84ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:23] [INFO ] After 17ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:23] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:23] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:14:23] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:23] [INFO ] After 41ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:23] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 23:14:23] [INFO ] After 276ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 42 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 162 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1480547 steps, run timeout after 3001 ms. (steps per millisecond=493 ) properties seen :{}
Probabilistic random walk after 1480547 steps, saw 222919 distinct states, run finished after 3001 ms. (steps per millisecond=493 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:26] [INFO ] Invariant cache hit.
[2023-03-16 23:14:27] [INFO ] [Real]Absence check using 48 positive place invariants in 18 ms returned sat
[2023-03-16 23:14:27] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:27] [INFO ] After 35ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:27] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:27] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:27] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:27] [INFO ] After 25ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:27] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 23:14:27] [INFO ] After 315ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 29 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 168 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1451340 steps, run timeout after 3001 ms. (steps per millisecond=483 ) properties seen :{}
Probabilistic random walk after 1451340 steps, saw 218437 distinct states, run finished after 3001 ms. (steps per millisecond=483 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:30] [INFO ] Invariant cache hit.
[2023-03-16 23:14:30] [INFO ] [Real]Absence check using 48 positive place invariants in 44 ms returned sat
[2023-03-16 23:14:30] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:30] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:30] [INFO ] After 239ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:30] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:31] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:31] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:31] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-16 23:14:31] [INFO ] After 326ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 31 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 162 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1425427 steps, run timeout after 3001 ms. (steps per millisecond=474 ) properties seen :{}
Probabilistic random walk after 1425427 steps, saw 213491 distinct states, run finished after 3001 ms. (steps per millisecond=474 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:34] [INFO ] Invariant cache hit.
[2023-03-16 23:14:34] [INFO ] [Real]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:14:34] [INFO ] After 104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:34] [INFO ] After 34ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:34] [INFO ] After 256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:34] [INFO ] [Nat]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:34] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:34] [INFO ] After 21ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:34] [INFO ] After 50ms 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-03-16 23:14:34] [INFO ] After 297ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 31 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 163 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1404116 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1404116 steps, saw 209549 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:37] [INFO ] Invariant cache hit.
[2023-03-16 23:14:38] [INFO ] [Real]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:14:38] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:38] [INFO ] After 28ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:38] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:38] [INFO ] [Nat]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:14:38] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:38] [INFO ] After 23ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:38] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 23:14:38] [INFO ] After 288ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 30 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 157 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1443161 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :{}
Probabilistic random walk after 1443161 steps, saw 217188 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:41] [INFO ] Invariant cache hit.
[2023-03-16 23:14:41] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:41] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:41] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2023-03-16 23:14:41] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:41] [INFO ] After 18ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:41] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-16 23:14:42] [INFO ] After 261ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 29 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 161 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1412704 steps, run timeout after 3001 ms. (steps per millisecond=470 ) properties seen :{}
Probabilistic random walk after 1412704 steps, saw 211446 distinct states, run finished after 3001 ms. (steps per millisecond=470 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:45] [INFO ] Invariant cache hit.
[2023-03-16 23:14:45] [INFO ] [Real]Absence check using 48 positive place invariants in 12 ms returned sat
[2023-03-16 23:14:45] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:45] [INFO ] After 31ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:45] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:45] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:45] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:45] [INFO ] After 19ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:45] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-16 23:14:45] [INFO ] After 308ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 44 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 161 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1496952 steps, run timeout after 3001 ms. (steps per millisecond=498 ) properties seen :{}
Probabilistic random walk after 1496952 steps, saw 225003 distinct states, run finished after 3001 ms. (steps per millisecond=498 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:48] [INFO ] Invariant cache hit.
[2023-03-16 23:14:48] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:48] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:49] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:14:49] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:49] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:49] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-16 23:14:49] [INFO ] After 253ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 28 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 164 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1519000 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 1519000 steps, saw 229313 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:52] [INFO ] Invariant cache hit.
[2023-03-16 23:14:52] [INFO ] [Real]Absence check using 48 positive place invariants in 14 ms returned sat
[2023-03-16 23:14:52] [INFO ] After 85ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:52] [INFO ] After 18ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:52] [INFO ] After 194ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:52] [INFO ] [Nat]Absence check using 48 positive place invariants in 9 ms returned sat
[2023-03-16 23:14:52] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:52] [INFO ] After 22ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:52] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-16 23:14:52] [INFO ] After 257ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 30 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 164 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1437732 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :{}
Probabilistic random walk after 1437732 steps, saw 216092 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:55] [INFO ] Invariant cache hit.
[2023-03-16 23:14:55] [INFO ] [Real]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:56] [INFO ] After 105ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:14:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:56] [INFO ] After 23ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:56] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:56] [INFO ] [Nat]Absence check using 48 positive place invariants in 15 ms returned sat
[2023-03-16 23:14:56] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:56] [INFO ] After 32ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:56] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-16 23:14:56] [INFO ] After 329ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 36 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 166 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1462923 steps, run timeout after 3001 ms. (steps per millisecond=487 ) properties seen :{}
Probabilistic random walk after 1462923 steps, saw 220421 distinct states, run finished after 3001 ms. (steps per millisecond=487 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:14:59] [INFO ] Invariant cache hit.
[2023-03-16 23:14:59] [INFO ] [Real]Absence check using 48 positive place invariants in 30 ms returned sat
[2023-03-16 23:14:59] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:14:59] [INFO ] [Nat]Absence check using 48 positive place invariants in 7 ms returned sat
[2023-03-16 23:14:59] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:14:59] [INFO ] After 13ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:14:59] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-16 23:14:59] [INFO ] After 216ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 84 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 1 ms
Free SCC test removed 43 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 63 rules applied. Total rules applied 259 place count 45 transition count 48
Reduce places removed 40 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 85 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 19 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 167 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1501644 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :{}
Probabilistic random walk after 1501644 steps, saw 225861 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:15:02] [INFO ] Invariant cache hit.
[2023-03-16 23:15:03] [INFO ] [Real]Absence check using 48 positive place invariants in 16 ms returned sat
[2023-03-16 23:15:03] [INFO ] After 115ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 23:15:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:15:03] [INFO ] After 24ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:15:03] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:15:03] [INFO ] [Nat]Absence check using 48 positive place invariants in 10 ms returned sat
[2023-03-16 23:15:03] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:15:03] [INFO ] After 18ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:15:03] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-16 23:15:03] [INFO ] After 214ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 231 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 230 transition count 208
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 73 place count 230 transition count 139
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 276 edges and 161 vertex of which 113 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 167 place count 113 transition count 115
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 191 place count 113 transition count 91
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 113 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 193 place count 112 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 194 place count 111 transition count 89
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 85 edges and 89 vertex of which 44 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 64 rules applied. Total rules applied 258 place count 46 transition count 48
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 86 rules applied. Total rules applied 344 place count 5 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 18 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Incomplete random walk after 10000 steps, including 149 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1438194 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :{}
Probabilistic random walk after 1438194 steps, saw 216174 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 23:15:06] [INFO ] Invariant cache hit.
[2023-03-16 23:15:06] [INFO ] [Real]Absence check using 48 positive place invariants in 24 ms returned sat
[2023-03-16 23:15:06] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 23:15:06] [INFO ] [Nat]Absence check using 48 positive place invariants in 27 ms returned sat
[2023-03-16 23:15:06] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 23:15:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 23:15:06] [INFO ] After 12ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 23:15:06] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-16 23:15:06] [INFO ] After 201ms 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 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 210/210 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 232 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 231 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 230 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 230 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 229 transition count 207
Free-agglomeration rule applied 69 times.
Iterating global reduction 0 with 69 rules applied. Total rules applied 75 place count 229 transition count 138
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 275 edges and 160 vertex of which 112 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 94 rules applied. Total rules applied 169 place count 112 transition count 114
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 193 place count 112 transition count 90
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 112 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 111 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 110 transition count 88
Reduce places removed 22 places and 0 transitions.
Graph (trivial) has 85 edges and 88 vertex of which 44 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 43 places
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 3 with 64 rules applied. Total rules applied 260 place count 45 transition count 47
Reduce places removed 41 places and 0 transitions.
Drop transitions removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 4 with 85 rules applied. Total rules applied 345 place count 4 transition count 3
Ensure Unique test removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 346 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 346 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 348 place count 2 transition count 2
Applied a total of 348 rules in 26 ms. Remains 2 /232 variables (removed 230) and now considering 2/210 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 2/232 places, 2/210 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Graph (complete) has 439 edges and 232 vertex of which 208 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 208 transition count 190
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 188 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 41 place count 188 transition count 189
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 187 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 186 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 186 transition count 188
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 2 with 48 rules applied. Total rules applied 93 place count 186 transition count 188
Applied a total of 93 rules in 43 ms. Remains 186 /232 variables (removed 46) and now considering 188/210 (removed 22) transitions.
Running SMT prover for 23 properties.
// Phase 1: matrix 188 rows 186 cols
[2023-03-16 23:15:07] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 23:15:07] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned sat
[2023-03-16 23:15:08] [INFO ] After 947ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-16 23:15:08] [INFO ] [Nat]Absence check using 24 positive place invariants in 35 ms returned sat
[2023-03-16 23:15:08] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-16 23:15:09] [INFO ] After 1025ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-16 23:15:09] [INFO ] After 1804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Unable to solve all queries for examination QuasiLiveness. Remains :23 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 23 properties from file /home/mcc/execution/QuasiLiveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 712237 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running AutoFlight (PT), instance 24b
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: 2230 places, 2228 transitions, 5186 arcs.
(potential((tk(P126)>=1)))
(potential((tk(P130)>=1)))
(potential((tk(P129)>=1)))
(potential((tk(P137)>=1)))
(potential((tk(P141)>=1)))
(potential((tk(P140)>=1)))
(potential((tk(P147)>=1)))
(potential((tk(P150)>=1)))
(potential((tk(P153)>=1)))
(potential((tk(P155)>=1)))
(potential((tk(P165)>=1)))
(potential((tk(P169)>=1)))
(potential((tk(P168)>=1)))
(potential((tk(P176)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P179)>=1)))
(potential((tk(P186)>=1)))
(potential((tk(P189)>=1)))
(potential((tk(P192)>=1)))
(potential((tk(P194)>=1)))
(potential((tk(P204)>=1)))
(potential((tk(P208)>=1)))
(potential((tk(P207)>=1)))
(potential((tk(P215)>=1)))
(potential((tk(P219)>=1)))
(potential((tk(P218)>=1)))
(potential((tk(P225)>=1)))
(potential((tk(P228)>=1)))
(potential((tk(P231)>=1)))
(potential((tk(P233)>=1)))
(potential((tk(P243)>=1)))
(potential((tk(P247)>=1)))
(potential((tk(P246)>=1)))
(potential((tk(P254)>=1)))
(potential((tk(P258)>=1)))
(potential((tk(P257)>=1)))
(potential((tk(P264)>=1)))
(potential((tk(P267)>=1)))
(potential((tk(P270)>=1)))
(potential((tk(P272)>=1)))
(potential((tk(P282)>=1)))
(potential((tk(P286)>=1)))
(potential((tk(P285)>=1)))
(potential((tk(P293)>=1)))
(potential((tk(P297)>=1)))
(potential((tk(P296)>=1)))
(potential((tk(P303)>=1)))
(potential((tk(P306)>=1)))
(potential((tk(P309)>=1)))
(potential((tk(P311)>=1)))
(potential((tk(P321)>=1)))
(potential((tk(P325)>=1)))
(potential((tk(P324)>=1)))
(potential((tk(P332)>=1)))
(potential((tk(P336)>=1)))
(potential((tk(P335)>=1)))
(potential((tk(P342)>=1)))
(potential((tk(P345)>=1)))
(potential((tk(P348)>=1)))
(potential((tk(P350)>=1)))
(potential((tk(P360)>=1)))
(potential((tk(P364)>=1)))
(potential((tk(P363)>=1)))
(potential((tk(P371)>=1)))
(potential((tk(P375)>=1)))
(potential((tk(P374)>=1)))
(potential((tk(P381)>=1)))
(potential((tk(P384)>=1)))
(potential((tk(P387)>=1)))
(potential((tk(P389)>=1)))
(potential((tk(P399)>=1)))
(potential((tk(P403)>=1)))
(potential((tk(P402)>=1)))
(potential((tk(P410)>=1)))
(potential((tk(P414)>=1)))
(potential((tk(P413)>=1)))
(potential((tk(P420)>=1)))
(potential((tk(P423)>=1)))
(potential((tk(P426)>=1)))
(potential((tk(P428)>=1)))
(potential((tk(P438)>=1)))
(potential((tk(P442)>=1)))
(potential((tk(P441)>=1)))
(potential((tk(P449)>=1)))
(potential((tk(P453)>=1)))
(potential((tk(P452)>=1)))
(potential((tk(P459)>=1)))
(potential((tk(P462)>=1)))
(potential((tk(P465)>=1)))
(potential((tk(P467)>=1)))
(potential((tk(P477)>=1)))
(potential((tk(P481)>=1)))
(potential((tk(P480)>=1)))
(potential((tk(P488)>=1)))
(potential((tk(P492)>=1)))
(potential((tk(P491)>=1)))
(potential((tk(P498)>=1)))
(potential((tk(P501)>=1)))
(potential((tk(P504)>=1)))
(potential((tk(P506)>=1)))
(potential((tk(P516)>=1)))
(potential((tk(P520)>=1)))
(potential((tk(P519)>=1)))
(potential((tk(P527)>=1)))
(potential((tk(P531)>=1)))
(potential((tk(P530)>=1)))
(potential((tk(P537)>=1)))
(potential((tk(P540)>=1)))
(potential((tk(P543)>=1)))
(potential((tk(P545)>=1)))
(potential((tk(P555)>=1)))
(potential((tk(P559)>=1)))
(potential((tk(P558)>=1)))
(potential((tk(P566)>=1)))
(potential((tk(P570)>=1)))
(potential((tk(P569)>=1)))
(potential((tk(P576)>=1)))
(potential((tk(P579)>=1)))
(potential((tk(P582)>=1)))
(potential((tk(P584)>=1)))
(potential((tk(P594)>=1)))
(potential((tk(P598)>=1)))
(potential((tk(P597)>=1)))
(potential((tk(P605)>=1)))
(potential((tk(P609)>=1)))
(potential((tk(P608)>=1)))
(potential((tk(P615)>=1)))
(potential((tk(P618)>=1)))
(potential((tk(P621)>=1)))
(potential((tk(P623)>=1)))
(potential((tk(P633)>=1)))
(potential((tk(P637)>=1)))
(potential((tk(P636)>=1)))
(potential((tk(P644)>=1)))
(potential((tk(P648)>=1)))
(potential((tk(P647)>=1)))
(potential((tk(P654)>=1)))
(potential((tk(P657)>=1)))
(potential((tk(P660)>=1)))
(potential((tk(P662)>=1)))
(potential((tk(P672)>=1)))
(potential((tk(P676)>=1)))
(potential((tk(P675)>=1)))
(potential((tk(P683)>=1)))
(potential((tk(P687)>=1)))
(potential((tk(P686)>=1)))
(potential((tk(P693)>=1)))
(potential((tk(P696)>=1)))
(potential((tk(P699)>=1)))
(potential((tk(P701)>=1)))
(potential((tk(P711)>=1)))
(potential((tk(P715)>=1)))
(potential((tk(P714)>=1)))
(potential((tk(P722)>=1)))
(potential((tk(P726)>=1)))
(potential((tk(P725)>=1)))
(potential((tk(P732)>=1)))
(potential((tk(P735)>=1)))
(potential((tk(P738)>=1)))
(potential((tk(P740)>=1)))
(potential((tk(P750)>=1)))
(potential((tk(P754)>=1)))
(potential((tk(P753)>=1)))
(potential((tk(P761)>=1)))
(potential((tk(P765)>=1)))
(potential((tk(P764)>=1)))
(potential((tk(P771)>=1)))
(potential((tk(P774)>=1)))
(potential((tk(P777)>=1)))
(potential((tk(P779)>=1)))
(potential((tk(P789)>=1)))
(potential((tk(P793)>=1)))
(potential((tk(P792)>=1)))
(potential((tk(P800)>=1)))
(potential((tk(P804)>=1)))
(potential((tk(P803)>=1)))
(potential((tk(P810)>=1)))
(potential((tk(P813)>=1)))
(potential((tk(P816)>=1)))
(potential((tk(P818)>=1)))
(potential((tk(P828)>=1)))
(potential((tk(P832)>=1)))
(potential((tk(P831)>=1)))
(potential((tk(P839)>=1)))
(potential((tk(P843)>=1)))
(potential((tk(P842)>=1)))
(potential((tk(P849)>=1)))
(potential((tk(P852)>=1)))
(potential((tk(P855)>=1)))
(potential((tk(P857)>=1)))
(potential((tk(P867)>=1)))
(potential((tk(P871)>=1)))
(potential((tk(P870)>=1)))
(potential((tk(P878)>=1)))
(potential((tk(P882)>=1)))
(potential((tk(P881)>=1)))
(potential((tk(P888)>=1)))
(potential((tk(P891)>=1)))
(potential((tk(P894)>=1)))
(potential((tk(P896)>=1)))
(potential((tk(P906)>=1)))
(potential((tk(P910)>=1)))
(potential((tk(P909)>=1)))
(potential((tk(P917)>=1)))
(potential((tk(P921)>=1)))
(potential((tk(P920)>=1)))
(potential((tk(P927)>=1)))
(potential((tk(P930)>=1)))
(potential((tk(P933)>=1)))
(potential((tk(P935)>=1)))
(potential((tk(P945)>=1)))
(potential((tk(P949)>=1)))
(potential((tk(P948)>=1)))
(potential((tk(P956)>=1)))
(potential((tk(P960)>=1)))
(potential((tk(P959)>=1)))
(potential((tk(P966)>=1)))
(potential((tk(P969)>=1)))
(potential((tk(P972)>=1)))
(potential((tk(P974)>=1)))
(potential((tk(P984)>=1)))
(potential((tk(P988)>=1)))
(potential((tk(P987)>=1)))
(potential((tk(P995)>=1)))
(potential((tk(P999)>=1)))
(potential((tk(P998)>=1)))
(potential((tk(P1005)>=1)))
(potential((tk(P1008)>=1)))
(potential((tk(P1011)>=1)))
(potential((tk(P1013)>=1)))
(potential((tk(P1023)>=1)))
(potential((tk(P1027)>=1)))
(potential((tk(P1026)>=1)))
(potential((tk(P1034)>=1)))
(potential((tk(P1038)>=1)))
(potential((tk(P1037)>=1)))
(potential((tk(P1044)>=1)))
(potential((tk(P1047)>=1)))
(potential((tk(P1050)>=1)))
(potential((tk(P1052)>=1)))
(potential((tk(P1063)>=1)))
(potential((tk(P1074)>=1)))
(potential((tk(P1080)>=1)))
(potential((tk(P1091)>=1)))
(potential((tk(P1097)>=1)))
(potential((tk(P1108)>=1)))
(potential((tk(P1114)>=1)))
(potential((tk(P1125)>=1)))
(potential((tk(P1131)>=1)))
(potential((tk(P1142)>=1)))
(potential((tk(P1148)>=1)))
(potential((tk(P1159)>=1)))
(potential((tk(P1165)>=1)))
(potential((tk(P1176)>=1)))
(potential((tk(P1182)>=1)))
(potential((tk(P1193)>=1)))
(potential((tk(P1199)>=1)))
(potential((tk(P1210)>=1)))
(potential((tk(P1216)>=1)))
(potential((tk(P1227)>=1)))
(potential((tk(P1233)>=1)))
(potential((tk(P1244)>=1)))
(potential((tk(P1250)>=1)))
(potential((tk(P1261)>=1)))
(potential((tk(P1267)>=1)))
(potential((tk(P1278)>=1)))
(potential((tk(P1284)>=1)))
(potential((tk(P1295)>=1)))
(potential((tk(P1301)>=1)))
(potential((tk(P1312)>=1)))
(potential((tk(P1318)>=1)))
(potential((tk(P1329)>=1)))
(potential((tk(P1335)>=1)))
(potential((tk(P1346)>=1)))
(potential((tk(P1352)>=1)))
(potential((tk(P1363)>=1)))
(potential((tk(P1369)>=1)))
(potential((tk(P1380)>=1)))
(potential((tk(P1386)>=1)))
(potential((tk(P1397)>=1)))
(potential((tk(P1403)>=1)))
(potential((tk(P1414)>=1)))
(potential((tk(P1420)>=1)))
(potential((tk(P1431)>=1)))
(potential((tk(P1437)>=1)))
(potential((tk(P1448)>=1)))
(potential((tk(P1454)>=1)))
(potential((tk(P1465)>=1)))
(potential((tk(P1)>=1)))
(potential((tk(P3)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P1467)>=1)))
(potential((tk(P2230)>=1)))
(potential((tk(P2228)>=1)))
(potential((tk(P1468)>=1)))
(potential((tk(P2210)>=1)))
(potential((tk(P2226)>=1)))
(potential((tk(P2225)>=1)))
(potential((tk(P2224)>=1)))
(potential((tk(P2223)>=1)))
(potential((tk(P2222)>=1)))
(potential((tk(P2221)>=1)))
(potential((tk(P2220)>=1)))
(potential((tk(P2216)>=1)))
(potential((tk(P2213)>=1)))
(potential((tk(P2211)>=1)))
(potential((tk(P1469)>=1)))
(potential((tk(P2193)>=1)))
(potential((tk(P2209)>=1)))
(potential((tk(P2208)>=1)))
(potential((tk(P2207)>=1)))
(potential((tk(P2206)>=1)))
(potential((tk(P2205)>=1)))
(potential((tk(P2204)>=1)))
(potential((tk(P2203)>=1)))
(potential((tk(P2199)>=1)))
(potential((tk(P2196)>=1)))
(potential((tk(P2194)>=1)))
(potential((tk(P1470)>=1)))
(potential((tk(P2176)>=1)))
(potential((tk(P2192)>=1)))
(potential((tk(P2191)>=1)))
(potential((tk(P2190)>=1)))
(potential((tk(P2189)>=1)))
(potential((tk(P2188)>=1)))
(potential((tk(P2187)>=1)))
(potential((tk(P2186)>=1)))
(potential((tk(P2182)>=1)))
(potential((tk(P2179)>=1)))
(potential((tk(P2177)>=1)))
(potential((tk(P1471)>=1)))
(potential((tk(P2159)>=1)))
(potential((tk(P2175)>=1)))
(potential((tk(P2174)>=1)))
(potential((tk(P2173)>=1)))
(potential((tk(P2172)>=1)))
(potential((tk(P2171)>=1)))
(potential((tk(P2170)>=1)))
(potential((tk(P2169)>=1)))
(potential((tk(P2165)>=1)))
(potential((tk(P2162)>=1)))
(potential((tk(P2160)>=1)))
(potential((tk(P1472)>=1)))
(potential((tk(P2142)>=1)))
(potential((tk(P2158)>=1)))
(potential((tk(P2157)>=1)))
(potential((tk(P2156)>=1)))
(potential((tk(P2155)>=1)))
(potential((tk(P2154)>=1)))
(potential((tk(P2153)>=1)))
(potential((tk(P2152)>=1)))
(potential((tk(P2148)>=1)))
(potential((tk(P2145)>=1)))
(potential((tk(P2143)>=1)))
(potential((tk(P1473)>=1)))
(potential((tk(P2125)>=1)))
(potential((tk(P2141)>=1)))
(potential((tk(P2140)>=1)))
(potential((tk(P2139)>=1)))
(potential((tk(P2138)>=1)))
(potential((tk(P2137)>=1)))
(potential((tk(P2136)>=1)))
(potential((tk(P2135)>=1)))
(potential((tk(P2131)>=1)))
(potential((tk(P2128)>=1)))
(potential((tk(P2126)>=1)))
(potential((tk(P1474)>=1)))
(potential((tk(P2108)>=1)))
(potential((tk(P2124)>=1)))
(potential((tk(P2123)>=1)))
(potential((tk(P2122)>=1)))
(potential((tk(P2121)>=1)))
(potential((tk(P2120)>=1)))
(potential((tk(P2119)>=1)))
(potential((tk(P2118)>=1)))
(potential((tk(P2114)>=1)))
(potential((tk(P2111)>=1)))
(potential((tk(P2109)>=1)))
(potential((tk(P1475)>=1)))
(potential((tk(P2091)>=1)))
(potential((tk(P2107)>=1)))
(potential((tk(P2106)>=1)))
(potential((tk(P2105)>=1)))
(potential((tk(P2104)>=1)))
(potential((tk(P2103)>=1)))
(potential((tk(P2102)>=1)))
(potential((tk(P2101)>=1)))
(potential((tk(P2097)>=1)))
(potential((tk(P2094)>=1)))
(potential((tk(P2092)>=1)))
(potential((tk(P1476)>=1)))
(potential((tk(P2074)>=1)))
(potential((tk(P2090)>=1)))
(potential((tk(P2089)>=1)))
(potential((tk(P2088)>=1)))
(potential((tk(P2087)>=1)))
(potential((tk(P2086)>=1)))
(potential((tk(P2085)>=1)))
(potential((tk(P2084)>=1)))
(potential((tk(P2080)>=1)))
(potential((tk(P2077)>=1)))
(potential((tk(P2075)>=1)))
(potential((tk(P1477)>=1)))
(potential((tk(P2057)>=1)))
(potential((tk(P2073)>=1)))
(potential((tk(P2072)>=1)))
(potential((tk(P2071)>=1)))
(potential((tk(P2070)>=1)))
(potential((tk(P2069)>=1)))
(potential((tk(P2068)>=1)))
(potential((tk(P2067)>=1)))
(potential((tk(P2063)>=1)))
(potential((tk(P2060)>=1)))
(potential((tk(P2058)>=1)))
(potential((tk(P1478)>=1)))
(potential((tk(P2040)>=1)))
(potential((tk(P2056)>=1)))
(potential((tk(P2055)>=1)))
(potential((tk(P2054)>=1)))
(potential((tk(P2053)>=1)))
(potential((tk(P2052)>=1)))
(potential((tk(P2051)>=1)))
(potential((tk(P2050)>=1)))
(potential((tk(P2046)>=1)))
(potential((tk(P2043)>=1)))
(potential((tk(P2041)>=1)))
(potential((tk(P1479)>=1)))
(potential((tk(P2023)>=1)))
(potential((tk(P2039)>=1)))
(potential((tk(P2038)>=1)))
(potential((tk(P2037)>=1)))
(potential((tk(P2036)>=1)))
(potential((tk(P2035)>=1)))
(potential((tk(P2034)>=1)))
(potential((tk(P2033)>=1)))
(potential((tk(P2029)>=1)))
(potential((tk(P2026)>=1)))
(potential((tk(P2024)>=1)))
(potential((tk(P1480)>=1)))
(potential((tk(P2006)>=1)))
(potential((tk(P2022)>=1)))
(potential((tk(P2021)>=1)))
(potential((tk(P2020)>=1)))
(potential((tk(P2019)>=1)))
(potential((tk(P2018)>=1)))
(potential((tk(P2017)>=1)))
(potential((tk(P2016)>=1)))
(potential((tk(P2012)>=1)))
(potential((tk(P2009)>=1)))
(potential((tk(P2007)>=1)))
(potential((tk(P1481)>=1)))
(potential((tk(P1989)>=1)))
(potential((tk(P2005)>=1)))
(potential((tk(P2004)>=1)))
(potential((tk(P2003)>=1)))
(potential((tk(P2002)>=1)))
(potential((tk(P2001)>=1)))
(potential((tk(P2000)>=1)))
(potential((tk(P1999)>=1)))
(potential((tk(P1995)>=1)))
(potential((tk(P1992)>=1)))
(potential((tk(P1990)>=1)))
(potential((tk(P1482)>=1)))
(potential((tk(P1972)>=1)))
(potential((tk(P1988)>=1)))
(potential((tk(P1987)>=1)))
(potential((tk(P1986)>=1)))
(potential((tk(P1985)>=1)))
(potential((tk(P1984)>=1)))
(potential((tk(P1983)>=1)))
(potential((tk(P1982)>=1)))
(potential((tk(P1978)>=1)))
(potential((tk(P1975)>=1)))
(potential((tk(P1973)>=1)))
(potential((tk(P1483)>=1)))
(potential((tk(P1955)>=1)))
(potential((tk(P1971)>=1)))
(potential((tk(P1970)>=1)))
(potential((tk(P1969)>=1)))
(potential((tk(P1968)>=1)))
(potential((tk(P1967)>=1)))
(potential((tk(P1966)>=1)))
(potential((tk(P1965)>=1)))
(potential((tk(P1961)>=1)))
(potential((tk(P1958)>=1)))
(potential((tk(P1956)>=1)))
(potential((tk(P1484)>=1)))
(potential((tk(P1938)>=1)))
(potential((tk(P1954)>=1)))
(potential((tk(P1953)>=1)))
(potential((tk(P1952)>=1)))
(potential((tk(P1951)>=1)))
(potential((tk(P1950)>=1)))
(potential((tk(P1949)>=1)))
(potential((tk(P1948)>=1)))
(potential((tk(P1944)>=1)))
(potential((tk(P1941)>=1)))
(potential((tk(P1939)>=1)))
(potential((tk(P1485)>=1)))
(potential((tk(P1921)>=1)))
(potential((tk(P1937)>=1)))
(potential((tk(P1936)>=1)))
(potential((tk(P1935)>=1)))
(potential((tk(P1934)>=1)))
(potential((tk(P1933)>=1)))
(potential((tk(P1932)>=1)))
(potential((tk(P1931)>=1)))
(potential((tk(P1927)>=1)))
(potential((tk(P1924)>=1)))
(potential((tk(P1922)>=1)))
(potential((tk(P1486)>=1)))
(potential((tk(P1904)>=1)))
(potential((tk(P1920)>=1)))
(potential((tk(P1919)>=1)))
(potential((tk(P1918)>=1)))
(potential((tk(P1917)>=1)))
(potential((tk(P1916)>=1)))
(potential((tk(P1915)>=1)))
(potential((tk(P1914)>=1)))
(potential((tk(P1910)>=1)))
(potential((tk(P1907)>=1)))
(potential((tk(P1905)>=1)))
(potential((tk(P1487)>=1)))
(potential((tk(P1887)>=1)))
(potential((tk(P1903)>=1)))
(potential((tk(P1902)>=1)))
(potential((tk(P1901)>=1)))
(potential((tk(P1900)>=1)))
(potential((tk(P1899)>=1)))
(potential((tk(P1898)>=1)))
(potential((tk(P1897)>=1)))
(potential((tk(P1893)>=1)))
(potential((tk(P1890)>=1)))
(potential((tk(P1888)>=1)))
(potential((tk(P1488)>=1)))
(potential((tk(P1870)>=1)))
(potential((tk(P1886)>=1)))
(potential((tk(P1885)>=1)))
(potential((tk(P1884)>=1)))
(potential((tk(P1883)>=1)))
(potential((tk(P1882)>=1)))
(potential((tk(P1881)>=1)))
(potential((tk(P1880)>=1)))
(potential((tk(P1876)>=1)))
(potential((tk(P1873)>=1)))
(potential((tk(P1871)>=1)))
(potential((tk(P1489)>=1)))
(potential((tk(P1853)>=1)))
(potential((tk(P1869)>=1)))
(potential((tk(P1868)>=1)))
(potential((tk(P1867)>=1)))
(potential((tk(P1866)>=1)))
(potential((tk(P1865)>=1)))
(potential((tk(P1864)>=1)))
(potential((tk(P1863)>=1)))
(potential((tk(P1859)>=1)))
(potential((tk(P1856)>=1)))
(potential((tk(P1854)>=1)))
(potential((tk(P1490)>=1)))
(potential((tk(P1836)>=1)))
(potential((tk(P1852)>=1)))
(potential((tk(P1851)>=1)))
(potential((tk(P1850)>=1)))
(potential((tk(P1849)>=1)))
(potential((tk(P1848)>=1)))
(potential((tk(P1847)>=1)))
(potential((tk(P1846)>=1)))
(potential((tk(P1842)>=1)))
(potential((tk(P1839)>=1)))
(potential((tk(P1837)>=1)))
(potential((tk(P1491)>=1)))
(potential((tk(P1819)>=1)))
(potential((tk(P1835)>=1)))
(potential((tk(P1834)>=1)))
(potential((tk(P1833)>=1)))
(potential((tk(P1832)>=1)))
(potential((tk(P1831)>=1)))
(potential((tk(P1830)>=1)))
(potential((tk(P1829)>=1)))
(potential((tk(P1825)>=1)))
(potential((tk(P1822)>=1)))
(potential((tk(P1820)>=1)))
(potential((tk(P1492)>=1)))
(potential((tk(P1693)>=1)))
(potential((tk(P1818)>=1)))
(potential((tk(P1817)>=1)))
(potential((tk(P1816)>=1)))
(potential((tk(P1815)>=1)))
(potential((tk(P1814)>=1)))
(potential((tk(P1813)>=1)))
(potential((tk(P1812)>=1)))
(potential((tk(P1811)>=1)))
(potential((tk(P1810)>=1)))
(potential((tk(P1809)>=1)))
(potential((tk(P1808)>=1)))
(potential((tk(P1807)>=1)))
(potential((tk(P1806)>=1)))
(potential((tk(P1805)>=1)))
(potential((tk(P1804)>=1)))
(potential((tk(P1803)>=1)))
(potential((tk(P1802)>=1)))
(potential((tk(P1801)>=1)))
(potential((tk(P1800)>=1)))
(potential((tk(P1799)>=1)))
(potential((tk(P1798)>=1)))
(potential((tk(P1797)>=1)))
(potential((tk(P1796)>=1)))
(potential((tk(P1795)>=1)))
(potential((tk(P1745)>=1)))
(potential((tk(P1696)>=1)))
(potential((tk(P1694)>=1)))
(potential((tk(P1493)>=1)))
(potential((tk(P1692)>=1)))
(potential((tk(P1691)>=1)))
(potential((tk(P1690)>=1)))
(potential((tk(P1689)>=1)))
(potential((tk(P1688)>=1)))
(potential((tk(P1687)>=1)))
(potential((tk(P1686)>=1)))
(potential((tk(P1685)>=1)))
(potential((tk(P1684)>=1)))
(potential((tk(P1683)>=1)))
(potential((tk(P1682)>=1)))
(potential((tk(P1681)>=1)))
(potential((tk(P1680)>=1)))
(potential((tk(P1679)>=1)))
(potential((tk(P1678)>=1)))
(potential((tk(P1677)>=1)))
(potential((tk(P1676)>=1)))
(potential((tk(P1675)>=1)))
(potential((tk(P1674)>=1)))
(potential((tk(P1673)>=1)))
(potential((tk(P1672)>=1)))
(potential((tk(P1671)>=1)))
(potential((tk(P1670)>=1)))
(potential((tk(P1669)>=1)))
(potential((tk(P1668)>=1)))
(potential((tk(P1667)>=1)))
(potential((tk(P1666)>=1)))
(potential((tk(P1665)>=1)))
(potential((tk(P1664)>=1)))
(potential((tk(P1663)>=1)))
(potential((tk(P1662)>=1)))
(potential((tk(P1661)>=1)))
(potential((tk(P1660)>=1)))
(potential((tk(P1659)>=1)))
(potential((tk(P1658)>=1)))
(potential((tk(P1657)>=1)))
(potential((tk(P1656)>=1)))
(potential((tk(P1655)>=1)))
(potential((tk(P1654)>=1)))
(potential((tk(P1653)>=1)))
(potential((tk(P1652)>=1)))
(potential((tk(P1651)>=1)))
(potential((tk(P1650)>=1)))
(potential((tk(P1649)>=1)))
(potential((tk(P1648)>=1)))
(potential((tk(P1647)>=1)))
(potential((tk(P1646)>=1)))
(potential((tk(P1645)>=1)))
(potential((tk(P1644)>=1)))
(potential((tk(P1643)>=1)))
(potential((tk(P1642)>=1)))
(potential((tk(P1641)>=1)))
(potential((tk(P1640)>=1)))
(potential((tk(P1639)>=1)))
(potential((tk(P1638)>=1)))
(potential((tk(P1637)>=1)))
(potential((tk(P1636)>=1)))
(potential((tk(P1635)>=1)))
(potential((tk(P1634)>=1)))
(potential((tk(P1633)>=1)))
(potential((tk(P1632)>=1)))
(potential((tk(P1631)>=1)))
(potential((tk(P1630)>=1)))
(potential((tk(P1629)>=1)))
(potential((tk(P1628)>=1)))
(potential((tk(P1627)>=1)))
(potential((tk(P1626)>=1)))
(potential((tk(P1625)>=1)))
(potential((tk(P1624)>=1)))
(potential((tk(P1623)>=1)))
(potential((tk(P1622)>=1)))
(potential((tk(P1621)>=1)))
(potential((tk(P1620)>=1)))
(potential((tk(P1619)>=1)))
(potential((tk(P1569)>=1)))
(potential((tk(P1496)>=1)))
(potential((tk(P1494)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P1463)>=1)))
(potential((tk(P1464)>=1)))
(potential((tk(P5)>=1)))
(potential((tk(P1450)>=1)))
(potential((tk(P1462)>=1)))
(potential((tk(P1461)>=1)))
(potential((tk(P1460)>=1)))
(potential((tk(P1459)>=1)))
(potential((tk(P1458)>=1)))
(potential((tk(P1457)>=1)))
(potential((tk(P1456)>=1)))
(potential((tk(P1460)>=1)))
(potential((tk(P1453)>=1)))
(potential((tk(P1452)>=1)))
(potential((tk(P1451)>=1)))
(potential((tk(P6)>=1)))
(potential((tk(P1446)>=1)))
(potential((tk(P1447)>=1)))
(potential((tk(P7)>=1)))
(potential((tk(P1433)>=1)))
(potential((tk(P1445)>=1)))
(potential((tk(P1444)>=1)))
(potential((tk(P1443)>=1)))
(potential((tk(P1442)>=1)))
(potential((tk(P1441)>=1)))
(potential((tk(P1440)>=1)))
(potential((tk(P1439)>=1)))
(potential((tk(P1443)>=1)))
(potential((tk(P1436)>=1)))
(potential((tk(P1435)>=1)))
(potential((tk(P1434)>=1)))
(potential((tk(P8)>=1)))
(potential((tk(P1429)>=1)))
(potential((tk(P1430)>=1)))
(potential((tk(P9)>=1)))
(potential((tk(P1416)>=1)))
(potential((tk(P1428)>=1)))
(potential((tk(P1427)>=1)))
(potential((tk(P1426)>=1)))
(potential((tk(P1425)>=1)))
(potential((tk(P1424)>=1)))
(potential((tk(P1423)>=1)))
(potential((tk(P1422)>=1)))
(potential((tk(P1426)>=1)))
(potential((tk(P1419)>=1)))
(potential((tk(P1418)>=1)))
(potential((tk(P1417)>=1)))
(potential((tk(P10)>=1)))
(potential((tk(P1412)>=1)))
(potential((tk(P1413)>=1)))
(potential((tk(P11)>=1)))
(potential((tk(P1399)>=1)))
(potential((tk(P1411)>=1)))
(potential((tk(P1410)>=1)))
(potential((tk(P1409)>=1)))
(potential((tk(P1408)>=1)))
(potential((tk(P1407)>=1)))
(potential((tk(P1406)>=1)))
(potential((tk(P1405)>=1)))
(potential((tk(P1409)>=1)))
(potential((tk(P1402)>=1)))
(potential((tk(P1401)>=1)))
(potential((tk(P1400)>=1)))
(potential((tk(P12)>=1)))
(potential((tk(P1395)>=1)))
(potential((tk(P1396)>=1)))
(potential((tk(P13)>=1)))
(potential((tk(P1382)>=1)))
(potential((tk(P1394)>=1)))
(potential((tk(P1393)>=1)))
(potential((tk(P1392)>=1)))
(potential((tk(P1391)>=1)))
(potential((tk(P1390)>=1)))
(potential((tk(P1389)>=1)))
(potential((tk(P1388)>=1)))
(potential((tk(P1392)>=1)))
(potential((tk(P1385)>=1)))
(potential((tk(P1384)>=1)))
(potential((tk(P1383)>=1)))
(potential((tk(P14)>=1)))
(potential((tk(P1378)>=1)))
(potential((tk(P1379)>=1)))
(potential((tk(P15)>=1)))
(potential((tk(P1365)>=1)))
(potential((tk(P1377)>=1)))
(potential((tk(P1376)>=1)))
(potential((tk(P1375)>=1)))
(potential((tk(P1374)>=1)))
(potential((tk(P1373)>=1)))
(potential((tk(P1372)>=1)))
(potential((tk(P1371)>=1)))
(potential((tk(P1375)>=1)))
(potential((tk(P1368)>=1)))
(potential((tk(P1367)>=1)))
(potential((tk(P1366)>=1)))
(potential((tk(P16)>=1)))
(potential((tk(P1361)>=1)))
(potential((tk(P1362)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P1348)>=1)))
(potential((tk(P1360)>=1)))
(potential((tk(P1359)>=1)))
(potential((tk(P1358)>=1)))
(potential((tk(P1357)>=1)))
(potential((tk(P1356)>=1)))
(potential((tk(P1355)>=1)))
(potential((tk(P1354)>=1)))
(potential((tk(P1358)>=1)))
(potential((tk(P1351)>=1)))
(potential((tk(P1350)>=1)))
(potential((tk(P1349)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P1344)>=1)))
(potential((tk(P1345)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P1331)>=1)))
(potential((tk(P1343)>=1)))
(potential((tk(P1342)>=1)))
(potential((tk(P1341)>=1)))
(potential((tk(P1340)>=1)))
(potential((tk(P1339)>=1)))
(potential((tk(P1338)>=1)))
(potential((tk(P1337)>=1)))
(potential((tk(P1341)>=1)))
(potential((tk(P1334)>=1)))
(potential((tk(P1333)>=1)))
(potential((tk(P1332)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P1327)>=1)))
(potential((tk(P1328)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P1314)>=1)))
(potential((tk(P1326)>=1)))
(potential((tk(P1325)>=1)))
(potential((tk(P1324)>=1)))
(potential((tk(P1323)>=1)))
(potential((tk(P1322)>=1)))
(potential((tk(P1321)>=1)))
(potential((tk(P1320)>=1)))
(potential((tk(P1324)>=1)))
(potential((tk(P1317)>=1)))
(potential((tk(P1316)>=1)))
(potential((tk(P1315)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P1310)>=1)))
(potential((tk(P1311)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P1297)>=1)))
(potential((tk(P1309)>=1)))
(potential((tk(P1308)>=1)))
(potential((tk(P1307)>=1)))
(potential((tk(P1306)>=1)))
(potential((tk(P1305)>=1)))
(potential((tk(P1304)>=1)))
(potential((tk(P1303)>=1)))
(potential((tk(P1307)>=1)))
(potential((tk(P1300)>=1)))
(potential((tk(P1299)>=1)))
(potential((tk(P1298)>=1)))
(potential((tk(P24)>=1)))
(potential((tk(P1293)>=1)))
(potential((tk(P1294)>=1)))
(potential((tk(P25)>=1)))
(potential((tk(P1280)>=1)))
(potential((tk(P1292)>=1)))
(potential((tk(P1291)>=1)))
(potential((tk(P1290)>=1)))
(potential((tk(P1289)>=1)))
(potential((tk(P1288)>=1)))
(potential((tk(P1287)>=1)))
(potential((tk(P1286)>=1)))
(potential((tk(P1290)>=1)))
(potential((tk(P1283)>=1)))
(potential((tk(P1282)>=1)))
(potential((tk(P1281)>=1)))
(potential((tk(P26)>=1)))
(potential((tk(P1276)>=1)))
(potential((tk(P1277)>=1)))
(potential((tk(P27)>=1)))
(potential((tk(P1263)>=1)))
(potential((tk(P1275)>=1)))
(potential((tk(P1274)>=1)))
(potential((tk(P1273)>=1)))
(potential((tk(P1272)>=1)))
(potential((tk(P1271)>=1)))
(potential((tk(P1270)>=1)))
(potential((tk(P1269)>=1)))
(potential((tk(P1273)>=1)))
(potential((tk(P1266)>=1)))
(potential((tk(P1265)>=1)))
(potential((tk(P1264)>=1)))
(potential((tk(P28)>=1)))
(potential((tk(P1259)>=1)))
(potential((tk(P1260)>=1)))
(potential((tk(P29)>=1)))
(potential((tk(P1246)>=1)))
(potential((tk(P1258)>=1)))
(potential((tk(P1257)>=1)))
(potential((tk(P1256)>=1)))
(potential((tk(P1255)>=1)))
(potential((tk(P1254)>=1)))
(potential((tk(P1253)>=1)))
(potential((tk(P1252)>=1)))
(potential((tk(P1256)>=1)))
(potential((tk(P1249)>=1)))
(potential((tk(P1248)>=1)))
(potential((tk(P1247)>=1)))
(potential((tk(P30)>=1)))
(potential((tk(P1242)>=1)))
(potential((tk(P1243)>=1)))
(potential((tk(P31)>=1)))
(potential((tk(P1229)>=1)))
(potential((tk(P1241)>=1)))
(potential((tk(P1240)>=1)))
(potential((tk(P1239)>=1)))
(potential((tk(P1238)>=1)))
(potential((tk(P1237)>=1)))
(potential((tk(P1236)>=1)))
(potential((tk(P1235)>=1)))
(potential((tk(P1239)>=1)))
(potential((tk(P1232)>=1)))
(potential((tk(P1231)>=1)))
(potential((tk(P1230)>=1)))
(potential((tk(P32)>=1)))
(potential((tk(P1225)>=1)))
(potential((tk(P1226)>=1)))
(potential((tk(P33)>=1)))
(potential((tk(P1212)>=1)))
(potential((tk(P1224)>=1)))
(potential((tk(P1223)>=1)))
(potential((tk(P1222)>=1)))
(potential((tk(P1221)>=1)))
(potential((tk(P1220)>=1)))
(potential((tk(P1219)>=1)))
(potential((tk(P1218)>=1)))
(potential((tk(P1222)>=1)))
(potential((tk(P1215)>=1)))
(potential((tk(P1214)>=1)))
(potential((tk(P1213)>=1)))
(potential((tk(P34)>=1)))
(potential((tk(P1208)>=1)))
(potential((tk(P1209)>=1)))
(potential((tk(P35)>=1)))
(potential((tk(P1195)>=1)))
(potential((tk(P1207)>=1)))
(potential((tk(P1206)>=1)))
(potential((tk(P1205)>=1)))
(potential((tk(P1204)>=1)))
(potential((tk(P1203)>=1)))
(potential((tk(P1202)>=1)))
(potential((tk(P1201)>=1)))
(potential((tk(P1205)>=1)))
(potential((tk(P1198)>=1)))
(potential((tk(P1197)>=1)))
(potential((tk(P1196)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P1191)>=1)))
(potential((tk(P1192)>=1)))
(potential((tk(P37)>=1)))
(potential((tk(P1178)>=1)))
(potential((tk(P1190)>=1)))
(potential((tk(P1189)>=1)))
(potential((tk(P1188)>=1)))
(potential((tk(P1187)>=1)))
(potential((tk(P1186)>=1)))
(potential((tk(P1185)>=1)))
(potential((tk(P1184)>=1)))
(potential((tk(P1188)>=1)))
(potential((tk(P1181)>=1)))
(potential((tk(P1180)>=1)))
(potential((tk(P1179)>=1)))
(potential((tk(P38)>=1)))
(potential((tk(P1174)>=1)))
(potential((tk(P1175)>=1)))
(potential((tk(P39)>=1)))
(potential((tk(P1161)>=1)))
(potential((tk(P1173)>=1)))
(potential((tk(P1172)>=1)))
(potential((tk(P1171)>=1)))
(potential((tk(P1170)>=1)))
(potential((tk(P1169)>=1)))
(potential((tk(P1168)>=1)))
(potential((tk(P1167)>=1)))
(potential((tk(P1171)>=1)))
(potential((tk(P1164)>=1)))
(potential((tk(P1163)>=1)))
(potential((tk(P1162)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P1157)>=1)))
(potential((tk(P1158)>=1)))
(potential((tk(P41)>=1)))
(potential((tk(P1144)>=1)))
(potential((tk(P1156)>=1)))
(potential((tk(P1155)>=1)))
(potential((tk(P1154)>=1)))
(potential((tk(P1153)>=1)))
(potential((tk(P1152)>=1)))
(potential((tk(P1151)>=1)))
(potential((tk(P1150)>=1)))
(potential((tk(P1154)>=1)))
(potential((tk(P1147)>=1)))
(potential((tk(P1146)>=1)))
(potential((tk(P1145)>=1)))
(potential((tk(P42)>=1)))
(potential((tk(P1140)>=1)))
(potential((tk(P1141)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P1127)>=1)))
(potential((tk(P1139)>=1)))
(potential((tk(P1138)>=1)))
(potential((tk(P1137)>=1)))
(potential((tk(P1136)>=1)))
(potential((tk(P1135)>=1)))
(potential((tk(P1134)>=1)))
(potential((tk(P1133)>=1)))
(potential((tk(P1137)>=1)))
(potential((tk(P1130)>=1)))
(potential((tk(P1129)>=1)))
(potential((tk(P1128)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P1123)>=1)))
(potential((tk(P1124)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P1110)>=1)))
(potential((tk(P1122)>=1)))
(potential((tk(P1121)>=1)))
(potential((tk(P1120)>=1)))
(potential((tk(P1119)>=1)))
(potential((tk(P1118)>=1)))
(potential((tk(P1117)>=1)))
(potential((tk(P1116)>=1)))
(potential((tk(P1120)>=1)))
(potential((tk(P1113)>=1)))
(potential((tk(P1112)>=1)))
(potential((tk(P1111)>=1)))
(potential((tk(P46)>=1)))
(potential((tk(P1106)>=1)))
(potential((tk(P1107)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P1093)>=1)))
(potential((tk(P1105)>=1)))
(potential((tk(P1104)>=1)))
(potential((tk(P1103)>=1)))
(potential((tk(P1102)>=1)))
(potential((tk(P1101)>=1)))
(potential((tk(P1100)>=1)))
(potential((tk(P1099)>=1)))
(potential((tk(P1103)>=1)))
(potential((tk(P1096)>=1)))
(potential((tk(P1095)>=1)))
(potential((tk(P1094)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P1089)>=1)))
(potential((tk(P1090)>=1)))
(potential((tk(P49)>=1)))
(potential((tk(P1076)>=1)))
(potential((tk(P1088)>=1)))
(potential((tk(P1087)>=1)))
(potential((tk(P1086)>=1)))
(potential((tk(P1085)>=1)))
(potential((tk(P1084)>=1)))
(potential((tk(P1083)>=1)))
(potential((tk(P1082)>=1)))
(potential((tk(P1086)>=1)))
(potential((tk(P1079)>=1)))
(potential((tk(P1078)>=1)))
(potential((tk(P1077)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P1072)>=1)))
(potential((tk(P1073)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P1059)>=1)))
(potential((tk(P1071)>=1)))
(potential((tk(P1070)>=1)))
(potential((tk(P1069)>=1)))
(potential((tk(P1068)>=1)))
(potential((tk(P1067)>=1)))
(potential((tk(P1066)>=1)))
(potential((tk(P1065)>=1)))
(potential((tk(P1069)>=1)))
(potential((tk(P1062)>=1)))
(potential((tk(P1061)>=1)))
(potential((tk(P1060)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P1042)>=1)))
(potential((tk(P1058)>=1)))
(potential((tk(P1057)>=1)))
(potential((tk(P1056)>=1)))
(potential((tk(P1055)>=1)))
(potential((tk(P1053)>=1)))
(potential((tk(P1054)>=1)))
(potential((tk(P1049)>=1)))
(potential((tk(P1048)>=1)))
(potential((tk(P1054)>=1)))
(potential((tk(P1046)>=1)))
(potential((tk(P1043)>=1)))
(potential((tk(P53)>=1)))
(potential((tk(P1031)>=1)))
(potential((tk(P1041)>=1)))
(potential((tk(P1040)>=1)))
(potential((tk(P1038)>=1)))
(potential((tk(P1039)>=1)))
(potential((tk(P1036)>=1)))
(potential((tk(P1039)>=1)))
(potential((tk(P1033)>=1)))
(potential((tk(P1032)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P1020)>=1)))
(potential((tk(P1030)>=1)))
(potential((tk(P1029)>=1)))
(potential((tk(P1027)>=1)))
(potential((tk(P1028)>=1)))
(potential((tk(P1025)>=1)))
(potential((tk(P1028)>=1)))
(potential((tk(P1022)>=1)))
(potential((tk(P1021)>=1)))
(potential((tk(P55)>=1)))
(potential((tk(P1003)>=1)))
(potential((tk(P1019)>=1)))
(potential((tk(P1018)>=1)))
(potential((tk(P1017)>=1)))
(potential((tk(P1016)>=1)))
(potential((tk(P1014)>=1)))
(potential((tk(P1015)>=1)))
(potential((tk(P1010)>=1)))
(potential((tk(P1009)>=1)))
(potential((tk(P1015)>=1)))
(potential((tk(P1007)>=1)))
(potential((tk(P1004)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P992)>=1)))
(potential((tk(P1002)>=1)))
(potential((tk(P1001)>=1)))
(potential((tk(P999)>=1)))
(potential((tk(P1000)>=1)))
(potential((tk(P997)>=1)))
(potential((tk(P1000)>=1)))
(potential((tk(P994)>=1)))
(potential((tk(P993)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P981)>=1)))
(potential((tk(P991)>=1)))
(potential((tk(P990)>=1)))
(potential((tk(P988)>=1)))
(potential((tk(P989)>=1)))
(potential((tk(P986)>=1)))
(potential((tk(P989)>=1)))
(potential((tk(P983)>=1)))
(potential((tk(P982)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P964)>=1)))
(potential((tk(P980)>=1)))
(potential((tk(P979)>=1)))
(potential((tk(P978)>=1)))
(potential((tk(P977)>=1)))
(potential((tk(P975)>=1)))
(potential((tk(P976)>=1)))
(potential((tk(P971)>=1)))
(potential((tk(P970)>=1)))
(potential((tk(P976)>=1)))
(potential((tk(P968)>=1)))
(potential((tk(P965)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P953)>=1)))
(potential((tk(P963)>=1)))
(potential((tk(P962)>=1)))
(potential((tk(P960)>=1)))
(potential((tk(P961)>=1)))
(potential((tk(P958)>=1)))
(potential((tk(P961)>=1)))
(potential((tk(P955)>=1)))
(potential((tk(P954)>=1)))
(potential((tk(P60)>=1)))
(potential((tk(P942)>=1)))
(potential((tk(P952)>=1)))
(potential((tk(P951)>=1)))
(potential((tk(P949)>=1)))
(potential((tk(P950)>=1)))
(potential((tk(P947)>=1)))
(potential((tk(P950)>=1)))
(potential((tk(P944)>=1)))
(potential((tk(P943)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P925)>=1)))
(potential((tk(P941)>=1)))
(potential((tk(P940)>=1)))
(potential((tk(P939)>=1)))
(potential((tk(P938)>=1)))
(potential((tk(P936)>=1)))
(potential((tk(P937)>=1)))
(potential((tk(P932)>=1)))
(potential((tk(P931)>=1)))
(potential((tk(P937)>=1)))
(potential((tk(P929)>=1)))
(potential((tk(P926)>=1)))
(potential((tk(P62)>=1)))
(potential((tk(P914)>=1)))
(potential((tk(P924)>=1)))
(potential((tk(P923)>=1)))
(potential((tk(P921)>=1)))
(potential((tk(P922)>=1)))
(potential((tk(P919)>=1)))
(potential((tk(P922)>=1)))
(potential((tk(P916)>=1)))
(potential((tk(P915)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P903)>=1)))
(potential((tk(P913)>=1)))
(potential((tk(P912)>=1)))
(potential((tk(P910)>=1)))
(potential((tk(P911)>=1)))
(potential((tk(P908)>=1)))
(potential((tk(P911)>=1)))
(potential((tk(P905)>=1)))
(potential((tk(P904)>=1)))
(potential((tk(P64)>=1)))
(potential((tk(P886)>=1)))
(potential((tk(P902)>=1)))
(potential((tk(P901)>=1)))
(potential((tk(P900)>=1)))
(potential((tk(P899)>=1)))
(potential((tk(P897)>=1)))
(potential((tk(P898)>=1)))
(potential((tk(P893)>=1)))
(potential((tk(P892)>=1)))
(potential((tk(P898)>=1)))
(potential((tk(P890)>=1)))
(potential((tk(P887)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P875)>=1)))
(potential((tk(P885)>=1)))
(potential((tk(P884)>=1)))
(potential((tk(P882)>=1)))
(potential((tk(P883)>=1)))
(potential((tk(P880)>=1)))
(potential((tk(P883)>=1)))
(potential((tk(P877)>=1)))
(potential((tk(P876)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P864)>=1)))
(potential((tk(P874)>=1)))
(potential((tk(P873)>=1)))
(potential((tk(P871)>=1)))
(potential((tk(P872)>=1)))
(potential((tk(P869)>=1)))
(potential((tk(P872)>=1)))
(potential((tk(P866)>=1)))
(potential((tk(P865)>=1)))
(potential((tk(P67)>=1)))
(potential((tk(P847)>=1)))
(potential((tk(P863)>=1)))
(potential((tk(P862)>=1)))
(potential((tk(P861)>=1)))
(potential((tk(P860)>=1)))
(potential((tk(P858)>=1)))
(potential((tk(P859)>=1)))
(potential((tk(P854)>=1)))
(potential((tk(P853)>=1)))
(potential((tk(P859)>=1)))
(potential((tk(P851)>=1)))
(potential((tk(P848)>=1)))
(potential((tk(P68)>=1)))
(potential((tk(P836)>=1)))
(potential((tk(P846)>=1)))
(potential((tk(P845)>=1)))
(potential((tk(P843)>=1)))
(potential((tk(P844)>=1)))
(potential((tk(P841)>=1)))
(potential((tk(P844)>=1)))
(potential((tk(P838)>=1)))
(potential((tk(P837)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P825)>=1)))
(potential((tk(P835)>=1)))
(potential((tk(P834)>=1)))
(potential((tk(P832)>=1)))
(potential((tk(P833)>=1)))
(potential((tk(P830)>=1)))
(potential((tk(P833)>=1)))
(potential((tk(P827)>=1)))
(potential((tk(P826)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P808)>=1)))
(potential((tk(P824)>=1)))
(potential((tk(P823)>=1)))
(potential((tk(P822)>=1)))
(potential((tk(P821)>=1)))
(potential((tk(P819)>=1)))
(potential((tk(P820)>=1)))
(potential((tk(P815)>=1)))
(potential((tk(P814)>=1)))
(potential((tk(P820)>=1)))
(potential((tk(P812)>=1)))
(potential((tk(P809)>=1)))
(potential((tk(P71)>=1)))
(potential((tk(P797)>=1)))
(potential((tk(P807)>=1)))
(potential((tk(P806)>=1)))
(potential((tk(P804)>=1)))
(potential((tk(P805)>=1)))
(potential((tk(P802)>=1)))
(potential((tk(P805)>=1)))
(potential((tk(P799)>=1)))
(potential((tk(P798)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P786)>=1)))
(potential((tk(P796)>=1)))
(potential((tk(P795)>=1)))
(potential((tk(P793)>=1)))
(potential((tk(P794)>=1)))
(potential((tk(P791)>=1)))
(potential((tk(P794)>=1)))
(potential((tk(P788)>=1)))
(potential((tk(P787)>=1)))
(potential((tk(P73)>=1)))
(potential((tk(P769)>=1)))
(potential((tk(P785)>=1)))
(potential((tk(P784)>=1)))
(potential((tk(P783)>=1)))
(potential((tk(P782)>=1)))
(potential((tk(P780)>=1)))
(potential((tk(P781)>=1)))
(potential((tk(P776)>=1)))
(potential((tk(P775)>=1)))
(potential((tk(P781)>=1)))
(potential((tk(P773)>=1)))
(potential((tk(P770)>=1)))
(potential((tk(P74)>=1)))
(potential((tk(P758)>=1)))
(potential((tk(P768)>=1)))
(potential((tk(P767)>=1)))
(potential((tk(P765)>=1)))
(potential((tk(P766)>=1)))
(potential((tk(P763)>=1)))
(potential((tk(P766)>=1)))
(potential((tk(P760)>=1)))
(potential((tk(P759)>=1)))
(potential((tk(P75)>=1)))
(potential((tk(P747)>=1)))
(potential((tk(P757)>=1)))
(potential((tk(P756)>=1)))
(potential((tk(P754)>=1)))
(potential((tk(P755)>=1)))
(potential((tk(P752)>=1)))
(potential((tk(P755)>=1)))
(potential((tk(P749)>=1)))
(potential((tk(P748)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P730)>=1)))
(potential((tk(P746)>=1)))
(potential((tk(P745)>=1)))
(potential((tk(P744)>=1)))
(potential((tk(P743)>=1)))
(potential((tk(P741)>=1)))
(potential((tk(P742)>=1)))
(potential((tk(P737)>=1)))
(potential((tk(P736)>=1)))
(potential((tk(P742)>=1)))
(potential((tk(P734)>=1)))
(potential((tk(P731)>=1)))
(potential((tk(P77)>=1)))
(potential((tk(P719)>=1)))
(potential((tk(P729)>=1)))
(potential((tk(P728)>=1)))
(potential((tk(P726)>=1)))
(potential((tk(P727)>=1)))
(potential((tk(P724)>=1)))
(potential((tk(P727)>=1)))
(potential((tk(P721)>=1)))
(potential((tk(P720)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P708)>=1)))
(potential((tk(P718)>=1)))
(potential((tk(P717)>=1)))
(potential((tk(P715)>=1)))
(potential((tk(P716)>=1)))
(potential((tk(P713)>=1)))
(potential((tk(P716)>=1)))
(potential((tk(P710)>=1)))
(potential((tk(P709)>=1)))
(potential((tk(P79)>=1)))
(potential((tk(P691)>=1)))
(potential((tk(P707)>=1)))
(potential((tk(P706)>=1)))
(potential((tk(P705)>=1)))
(potential((tk(P704)>=1)))
(potential((tk(P702)>=1)))
(potential((tk(P703)>=1)))
(potential((tk(P698)>=1)))
(potential((tk(P697)>=1)))
(potential((tk(P703)>=1)))
(potential((tk(P695)>=1)))
(potential((tk(P692)>=1)))
(potential((tk(P80)>=1)))
(potential((tk(P680)>=1)))
(potential((tk(P690)>=1)))
(potential((tk(P689)>=1)))
(potential((tk(P687)>=1)))
(potential((tk(P688)>=1)))
(potential((tk(P685)>=1)))
(potential((tk(P688)>=1)))
(potential((tk(P682)>=1)))
(potential((tk(P681)>=1)))
(potential((tk(P81)>=1)))
(potential((tk(P669)>=1)))
(potential((tk(P679)>=1)))
(potential((tk(P678)>=1)))
(potential((tk(P676)>=1)))
(potential((tk(P677)>=1)))
(potential((tk(P674)>=1)))
(potential((tk(P677)>=1)))
(potential((tk(P671)>=1)))
(potential((tk(P670)>=1)))
(potential((tk(P82)>=1)))
(potential((tk(P652)>=1)))
(potential((tk(P668)>=1)))
(potential((tk(P667)>=1)))
(potential((tk(P666)>=1)))
(potential((tk(P665)>=1)))
(potential((tk(P663)>=1)))
(potential((tk(P664)>=1)))
(potential((tk(P659)>=1)))
(potential((tk(P658)>=1)))
(potential((tk(P664)>=1)))
(potential((tk(P656)>=1)))
(potential((tk(P653)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P641)>=1)))
(potential((tk(P651)>=1)))
(potential((tk(P650)>=1)))
(potential((tk(P648)>=1)))
(potential((tk(P649)>=1)))
(potential((tk(P646)>=1)))
(potential((tk(P649)>=1)))
(potential((tk(P643)>=1)))
(potential((tk(P642)>=1)))
(potential((tk(P84)>=1)))
(potential((tk(P630)>=1)))
(potential((tk(P640)>=1)))
(potential((tk(P639)>=1)))
(potential((tk(P637)>=1)))
(potential((tk(P638)>=1)))
(potential((tk(P635)>=1)))
(potential((tk(P638)>=1)))
(potential((tk(P632)>=1)))
(potential((tk(P631)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P613)>=1)))
(potential((tk(P629)>=1)))
(potential((tk(P628)>=1)))
(potential((tk(P627)>=1)))
(potential((tk(P626)>=1)))
(potential((tk(P624)>=1)))
(potential((tk(P625)>=1)))
(potential((tk(P620)>=1)))
(potential((tk(P619)>=1)))
(potential((tk(P625)>=1)))
(potential((tk(P617)>=1)))
(potential((tk(P614)>=1)))
(potential((tk(P86)>=1)))
(potential((tk(P602)>=1)))
(potential((tk(P612)>=1)))
(potential((tk(P611)>=1)))
(potential((tk(P609)>=1)))
(potential((tk(P610)>=1)))
(potential((tk(P607)>=1)))
(potential((tk(P610)>=1)))
(potential((tk(P604)>=1)))
(potential((tk(P603)>=1)))
(potential((tk(P87)>=1)))
(potential((tk(P591)>=1)))
(potential((tk(P601)>=1)))
(potential((tk(P600)>=1)))
(potential((tk(P598)>=1)))
(potential((tk(P599)>=1)))
(potential((tk(P596)>=1)))
(potential((tk(P599)>=1)))
(potential((tk(P593)>=1)))
(potential((tk(P592)>=1)))
(potential((tk(P88)>=1)))
(potential((tk(P574)>=1)))
(potential((tk(P590)>=1)))
(potential((tk(P589)>=1)))
(potential((tk(P588)>=1)))
(potential((tk(P587)>=1)))
(potential((tk(P585)>=1)))
(potential((tk(P586)>=1)))
(potential((tk(P581)>=1)))
(potential((tk(P580)>=1)))
(potential((tk(P586)>=1)))
(potential((tk(P578)>=1)))
(potential((tk(P575)>=1)))
(potential((tk(P89)>=1)))
(potential((tk(P563)>=1)))
(potential((tk(P573)>=1)))
(potential((tk(P572)>=1)))
(potential((tk(P570)>=1)))
(potential((tk(P571)>=1)))
(potential((tk(P568)>=1)))
(potential((tk(P571)>=1)))
(potential((tk(P565)>=1)))
(potential((tk(P564)>=1)))
(potential((tk(P90)>=1)))
(potential((tk(P552)>=1)))
(potential((tk(P562)>=1)))
(potential((tk(P561)>=1)))
(potential((tk(P559)>=1)))
(potential((tk(P560)>=1)))
(potential((tk(P557)>=1)))
(potential((tk(P560)>=1)))
(potential((tk(P554)>=1)))
(potential((tk(P553)>=1)))
(potential((tk(P91)>=1)))
(potential((tk(P535)>=1)))
(potential((tk(P551)>=1)))
(potential((tk(P550)>=1)))
(potential((tk(P549)>=1)))
(potential((tk(P548)>=1)))
(potential((tk(P546)>=1)))
(potential((tk(P547)>=1)))
(potential((tk(P542)>=1)))
(potential((tk(P541)>=1)))
(potential((tk(P547)>=1)))
(potential((tk(P539)>=1)))
(potential((tk(P536)>=1)))
(potential((tk(P92)>=1)))
(potential((tk(P524)>=1)))
(potential((tk(P534)>=1)))
(potential((tk(P533)>=1)))
(potential((tk(P531)>=1)))
(potential((tk(P532)>=1)))
(potential((tk(P529)>=1)))
(potential((tk(P532)>=1)))
(potential((tk(P526)>=1)))
(potential((tk(P525)>=1)))
(potential((tk(P93)>=1)))
(potential((tk(P513)>=1)))
(potential((tk(P523)>=1)))
(potential((tk(P522)>=1)))
(potential((tk(P520)>=1)))
(potential((tk(P521)>=1)))
(potential((tk(P518)>=1)))
(potential((tk(P521)>=1)))
(potential((tk(P515)>=1)))
(potential((tk(P514)>=1)))
(potential((tk(P94)>=1)))
(potential((tk(P496)>=1)))
(potential((tk(P512)>=1)))
(potential((tk(P511)>=1)))
(potential((tk(P510)>=1)))
(potential((tk(P509)>=1)))
(potential((tk(P507)>=1)))
(potential((tk(P508)>=1)))
(potential((tk(P503)>=1)))
(potential((tk(P502)>=1)))
(potential((tk(P508)>=1)))
(potential((tk(P500)>=1)))
(potential((tk(P497)>=1)))
(potential((tk(P95)>=1)))
(potential((tk(P485)>=1)))
(potential((tk(P495)>=1)))
(potential((tk(P494)>=1)))
(potential((tk(P492)>=1)))
(potential((tk(P493)>=1)))
(potential((tk(P490)>=1)))
(potential((tk(P493)>=1)))
(potential((tk(P487)>=1)))
(potential((tk(P486)>=1)))
(potential((tk(P96)>=1)))
(potential((tk(P474)>=1)))
(potential((tk(P484)>=1)))
(potential((tk(P483)>=1)))
(potential((tk(P481)>=1)))
(potential((tk(P482)>=1)))
(potential((tk(P479)>=1)))
(potential((tk(P482)>=1)))
(potential((tk(P476)>=1)))
(potential((tk(P475)>=1)))
(potential((tk(P97)>=1)))
(potential((tk(P457)>=1)))
(potential((tk(P473)>=1)))
(potential((tk(P472)>=1)))
(potential((tk(P471)>=1)))
(potential((tk(P470)>=1)))
(potential((tk(P468)>=1)))
(potential((tk(P469)>=1)))
(potential((tk(P464)>=1)))
(potential((tk(P463)>=1)))
(potential((tk(P469)>=1)))
(potential((tk(P461)>=1)))
(potential((tk(P458)>=1)))
(potential((tk(P98)>=1)))
(potential((tk(P446)>=1)))
(potential((tk(P456)>=1)))
(potential((tk(P455)>=1)))
(potential((tk(P453)>=1)))
(potential((tk(P454)>=1)))
(potential((tk(P451)>=1)))
(potential((tk(P454)>=1)))
(potential((tk(P448)>=1)))
(potential((tk(P447)>=1)))
(potential((tk(P99)>=1)))
(potential((tk(P435)>=1)))
(potential((tk(P445)>=1)))
(potential((tk(P444)>=1)))
(potential((tk(P442)>=1)))
(potential((tk(P443)>=1)))
(potential((tk(P440)>=1)))
(potential((tk(P443)>=1)))
(potential((tk(P437)>=1)))
(potential((tk(P436)>=1)))
(potential((tk(P100)>=1)))
(potential((tk(P418)>=1)))
(potential((tk(P434)>=1)))
(potential((tk(P433)>=1)))
(potential((tk(P432)>=1)))
(potential((tk(P431)>=1)))
(potential((tk(P429)>=1)))
(potential((tk(P430)>=1)))
(potential((tk(P425)>=1)))
(potential((tk(P424)>=1)))
(potential((tk(P430)>=1)))
(potential((tk(P422)>=1)))
(potential((tk(P419)>=1)))
(potential((tk(P101)>=1)))
(potential((tk(P407)>=1)))
(potential((tk(P417)>=1)))
(potential((tk(P416)>=1)))
(potential((tk(P414)>=1)))
(potential((tk(P415)>=1)))
(potential((tk(P412)>=1)))
(potential((tk(P415)>=1)))
(potential((tk(P409)>=1)))
(potential((tk(P408)>=1)))
(potential((tk(P102)>=1)))
(potential((tk(P396)>=1)))
(potential((tk(P406)>=1)))
(potential((tk(P405)>=1)))
(potential((tk(P403)>=1)))
(potential((tk(P404)>=1)))
(potential((tk(P401)>=1)))
(potential((tk(P404)>=1)))
(potential((tk(P398)>=1)))
(potential((tk(P397)>=1)))
(potential((tk(P103)>=1)))
(potential((tk(P379)>=1)))
(potential((tk(P395)>=1)))
(potential((tk(P394)>=1)))
(potential((tk(P393)>=1)))
(potential((tk(P392)>=1)))
(potential((tk(P390)>=1)))
(potential((tk(P391)>=1)))
(potential((tk(P386)>=1)))
(potential((tk(P385)>=1)))
(potential((tk(P391)>=1)))
(potential((tk(P383)>=1)))
(potential((tk(P380)>=1)))
(potential((tk(P104)>=1)))
(potential((tk(P368)>=1)))
(potential((tk(P378)>=1)))
(potential((tk(P377)>=1)))
(potential((tk(P375)>=1)))
(potential((tk(P376)>=1)))
(potential((tk(P373)>=1)))
(potential((tk(P376)>=1)))
(potential((tk(P370)>=1)))
(potential((tk(P369)>=1)))
(potential((tk(P105)>=1)))
(potential((tk(P357)>=1)))
(potential((tk(P367)>=1)))
(potential((tk(P366)>=1)))
(potential((tk(P364)>=1)))
(potential((tk(P365)>=1)))
(potential((tk(P362)>=1)))
(potential((tk(P365)>=1)))
(potential((tk(P359)>=1)))
(potential((tk(P358)>=1)))
(potential((tk(P106)>=1)))
(potential((tk(P340)>=1)))
(potential((tk(P356)>=1)))
(potential((tk(P355)>=1)))
(potential((tk(P354)>=1)))
(potential((tk(P353)>=1)))
(potential((tk(P351)>=1)))
(potential((tk(P352)>=1)))
(potential((tk(P347)>=1)))
(potential((tk(P346)>=1)))
(potential((tk(P352)>=1)))
(potential((tk(P344)>=1)))
(potential((tk(P341)>=1)))
(potential((tk(P107)>=1)))
(potential((tk(P329)>=1)))
(potential((tk(P339)>=1)))
(potential((tk(P338)>=1)))
(potential((tk(P336)>=1)))
(potential((tk(P337)>=1)))
(potential((tk(P334)>=1)))
(potential((tk(P337)>=1)))
(potential((tk(P331)>=1)))
(potential((tk(P330)>=1)))
(potential((tk(P108)>=1)))
(potential((tk(P318)>=1)))
(potential((tk(P328)>=1)))
(potential((tk(P327)>=1)))
(potential((tk(P325)>=1)))
(potential((tk(P326)>=1)))
(potential((tk(P323)>=1)))
(potential((tk(P326)>=1)))
(potential((tk(P320)>=1)))
(potential((tk(P319)>=1)))
(potential((tk(P109)>=1)))
(potential((tk(P301)>=1)))
(potential((tk(P317)>=1)))
(potential((tk(P316)>=1)))
(potential((tk(P315)>=1)))
(potential((tk(P314)>=1)))
(potential((tk(P312)>=1)))
(potential((tk(P313)>=1)))
(potential((tk(P308)>=1)))
(potential((tk(P307)>=1)))
(potential((tk(P313)>=1)))
(potential((tk(P305)>=1)))
(potential((tk(P302)>=1)))
(potential((tk(P110)>=1)))
(potential((tk(P290)>=1)))
(potential((tk(P300)>=1)))
(potential((tk(P299)>=1)))
(potential((tk(P297)>=1)))
(potential((tk(P298)>=1)))
(potential((tk(P295)>=1)))
(potential((tk(P298)>=1)))
(potential((tk(P292)>=1)))
(potential((tk(P291)>=1)))
(potential((tk(P111)>=1)))
(potential((tk(P279)>=1)))
(potential((tk(P289)>=1)))
(potential((tk(P288)>=1)))
(potential((tk(P286)>=1)))
(potential((tk(P287)>=1)))
(potential((tk(P284)>=1)))
(potential((tk(P287)>=1)))
(potential((tk(P281)>=1)))
(potential((tk(P280)>=1)))
(potential((tk(P112)>=1)))
(potential((tk(P262)>=1)))
(potential((tk(P278)>=1)))
(potential((tk(P277)>=1)))
(potential((tk(P276)>=1)))
(potential((tk(P275)>=1)))
(potential((tk(P273)>=1)))
(potential((tk(P274)>=1)))
(potential((tk(P269)>=1)))
(potential((tk(P268)>=1)))
(potential((tk(P274)>=1)))
(potential((tk(P266)>=1)))
(potential((tk(P263)>=1)))
(potential((tk(P113)>=1)))
(potential((tk(P251)>=1)))
(potential((tk(P261)>=1)))
(potential((tk(P260)>=1)))
(potential((tk(P258)>=1)))
(potential((tk(P259)>=1)))
(potential((tk(P256)>=1)))
(potential((tk(P259)>=1)))
(potential((tk(P253)>=1)))
(potential((tk(P252)>=1)))
(potential((tk(P114)>=1)))
(potential((tk(P240)>=1)))
(potential((tk(P250)>=1)))
(potential((tk(P249)>=1)))
(potential((tk(P247)>=1)))
(potential((tk(P248)>=1)))
(potential((tk(P245)>=1)))
(potential((tk(P248)>=1)))
(potential((tk(P242)>=1)))
(potential((tk(P241)>=1)))
(potential((tk(P115)>=1)))
(potential((tk(P223)>=1)))
(potential((tk(P239)>=1)))
(potential((tk(P238)>=1)))
(potential((tk(P237)>=1)))
(potential((tk(P236)>=1)))
(potential((tk(P234)>=1)))
(potential((tk(P235)>=1)))
(potential((tk(P230)>=1)))
(potential((tk(P229)>=1)))
(potential((tk(P235)>=1)))
(potential((tk(P227)>=1)))
(potential((tk(P224)>=1)))
(potential((tk(P116)>=1)))
(potential((tk(P212)>=1)))
(potential((tk(P222)>=1)))
(potential((tk(P221)>=1)))
(potential((tk(P219)>=1)))
(potential((tk(P220)>=1)))
(potential((tk(P217)>=1)))
(potential((tk(P220)>=1)))
(potential((tk(P214)>=1)))
(potential((tk(P213)>=1)))
(potential((tk(P117)>=1)))
(potential((tk(P201)>=1)))
(potential((tk(P211)>=1)))
(potential((tk(P210)>=1)))
(potential((tk(P208)>=1)))
(potential((tk(P209)>=1)))
(potential((tk(P206)>=1)))
(potential((tk(P209)>=1)))
(potential((tk(P203)>=1)))
(potential((tk(P202)>=1)))
(potential((tk(P118)>=1)))
(potential((tk(P184)>=1)))
(potential((tk(P200)>=1)))
(potential((tk(P199)>=1)))
(potential((tk(P198)>=1)))
(potential((tk(P197)>=1)))
(potential((tk(P195)>=1)))
(potential((tk(P196)>=1)))
(potential((tk(P191)>=1)))
(potential((tk(P190)>=1)))
(potential((tk(P196)>=1)))
(potential((tk(P188)>=1)))
(potential((tk(P185)>=1)))
(potential((tk(P119)>=1)))
(potential((tk(P173)>=1)))
(potential((tk(P183)>=1)))
(potential((tk(P182)>=1)))
(potential((tk(P180)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P178)>=1)))
(potential((tk(P181)>=1)))
(potential((tk(P175)>=1)))
(potential((tk(P174)>=1)))
(potential((tk(P120)>=1)))
(potential((tk(P162)>=1)))
(potential((tk(P172)>=1)))
(potential((tk(P171)>=1)))
(potential((tk(P169)>=1)))
(potential((tk(P170)>=1)))
(potential((tk(P167)>=1)))
(potential((tk(P170)>=1)))
(potential((tk(P164)>=1)))
(potential((tk(P163)>=1)))
(potential((tk(P121)>=1)))
(potential((tk(P145)>=1)))
(potential((tk(P161)>=1)))
(potential((tk(P160)>=1)))
(potential((tk(P159)>=1)))
(potential((tk(P158)>=1)))
(potential((tk(P156)>=1)))
(potential((tk(P157)>=1)))
(potential((tk(P152)>=1)))
(potential((tk(P151)>=1)))
(potential((tk(P157)>=1)))
(potential((tk(P149)>=1)))
(potential((tk(P146)>=1)))
(potential((tk(P122)>=1)))
(potential((tk(P134)>=1)))
(potential((tk(P144)>=1)))
(potential((tk(P143)>=1)))
(potential((tk(P141)>=1)))
(potential((tk(P142)>=1)))
(potential((tk(P139)>=1)))
(potential((tk(P142)>=1)))
(potential((tk(P136)>=1)))
(potential((tk(P135)>=1)))
(potential((tk(P123)>=1)))
(potential((tk(P133)>=1)))
(potential((tk(P132)>=1)))
(potential((tk(P130)>=1)))
(potential((tk(P131)>=1)))
(potential((tk(P128)>=1)))
(potential((tk(P131)>=1)))
(potential((tk(P125)>=1)))
(potential((tk(P124)>=1)))
(potential((tk(P1449)>=1) & (tk(P2201)>=1)))
(potential((tk(P1438)>=1) & (tk(P2200)>=1)))
(potential((tk(P1000)>=1) & (tk(P2198)>=1)))
(potential((tk(P989)>=1) & (tk(P2197)>=1)))
(potential((tk(P1415)>=1) & (tk(P2167)>=1)))
(potential((tk(P1404)>=1) & (tk(P2166)>=1)))
(potential((tk(P922)>=1) & (tk(P2164)>=1)))
(potential((tk(P911)>=1) & (tk(P2163)>=1)))
(potential((tk(P1381)>=1) & (tk(P2133)>=1)))
(potential((tk(P1370)>=1) & (tk(P2132)>=1)))
(potential((tk(P844)>=1) & (tk(P2130)>=1)))
(potential((tk(P833)>=1) & (tk(P2129)>=1)))
(potential((tk(P1347)>=1) & (tk(P2099)>=1)))
(potential((tk(P1336)>=1) & (tk(P2098)>=1)))
(potential((tk(P766)>=1) & (tk(P2096)>=1)))
(potential((tk(P755)>=1) & (tk(P2095)>=1)))
(potential((tk(P1313)>=1) & (tk(P2065)>=1)))
(potential((tk(P1302)>=1) & (tk(P2064)>=1)))
(potential((tk(P688)>=1) & (tk(P2062)>=1)))
(potential((tk(P677)>=1) & (tk(P2061)>=1)))
(potential((tk(P1279)>=1) & (tk(P2031)>=1)))
(potential((tk(P1268)>=1) & (tk(P2030)>=1)))
(potential((tk(P610)>=1) & (tk(P2028)>=1)))
(potential((tk(P599)>=1) & (tk(P2027)>=1)))
(potential((tk(P1245)>=1) & (tk(P1997)>=1)))
(potential((tk(P1234)>=1) & (tk(P1996)>=1)))
(potential((tk(P532)>=1) & (tk(P1994)>=1)))
(potential((tk(P521)>=1) & (tk(P1993)>=1)))
(potential((tk(P1211)>=1) & (tk(P1963)>=1)))
(potential((tk(P1200)>=1) & (tk(P1962)>=1)))
(potential((tk(P454)>=1) & (tk(P1960)>=1)))
(potential((tk(P443)>=1) & (tk(P1959)>=1)))
(potential((tk(P1177)>=1) & (tk(P1929)>=1)))
(potential((tk(P1166)>=1) & (tk(P1928)>=1)))
(potential((tk(P376)>=1) & (tk(P1926)>=1)))
(potential((tk(P365)>=1) & (tk(P1925)>=1)))
(potential((tk(P1143)>=1) & (tk(P1895)>=1)))
(potential((tk(P1132)>=1) & (tk(P1894)>=1)))
(potential((tk(P298)>=1) & (tk(P1892)>=1)))
(potential((tk(P287)>=1) & (tk(P1891)>=1)))
(potential((tk(P1109)>=1) & (tk(P1861)>=1)))
(potential((tk(P1098)>=1) & (tk(P1860)>=1)))
(potential((tk(P220)>=1) & (tk(P1858)>=1)))
(potential((tk(P209)>=1) & (tk(P1857)>=1)))
(potential((tk(P1075)>=1) & (tk(P1827)>=1)))
(potential((tk(P1064)>=1) & (tk(P1826)>=1)))
(potential((tk(P142)>=1) & (tk(P1824)>=1)))
(potential((tk(P131)>=1) & (tk(P1823)>=1)))
(potential((tk(P157)>=1) & (tk(P1497)>=1)))
(potential((tk(P196)>=1) & (tk(P1498)>=1)))
(potential((tk(P235)>=1) & (tk(P1499)>=1)))
(potential((tk(P274)>=1) & (tk(P1500)>=1)))
(potential((tk(P313)>=1) & (tk(P1501)>=1)))
(potential((tk(P352)>=1) & (tk(P1502)>=1)))
(potential((tk(P391)>=1) & (tk(P1503)>=1)))
(potential((tk(P430)>=1) & (tk(P1504)>=1)))
(potential((tk(P469)>=1) & (tk(P1505)>=1)))
(potential((tk(P508)>=1) & (tk(P1506)>=1)))
(potential((tk(P547)>=1) & (tk(P1507)>=1)))
(potential((tk(P586)>=1) & (tk(P1508)>=1)))
(potential((tk(P625)>=1) & (tk(P1509)>=1)))
(potential((tk(P664)>=1) & (tk(P1510)>=1)))
(potential((tk(P703)>=1) & (tk(P1511)>=1)))
(potential((tk(P742)>=1) & (tk(P1512)>=1)))
(potential((tk(P781)>=1) & (tk(P1513)>=1)))
(potential((tk(P820)>=1) & (tk(P1514)>=1)))
(potential((tk(P859)>=1) & (tk(P1515)>=1)))
(potential((tk(P898)>=1) & (tk(P1516)>=1)))
(potential((tk(P937)>=1) & (tk(P1517)>=1)))
(potential((tk(P976)>=1) & (tk(P1518)>=1)))
(potential((tk(P1015)>=1) & (tk(P1519)>=1)))
(potential((tk(P1054)>=1) & (tk(P1520)>=1)))
(potential((tk(P154)>=1) & (tk(P1570)>=1)))
(potential((tk(P193)>=1) & (tk(P1571)>=1)))
(potential((tk(P232)>=1) & (tk(P1572)>=1)))
(potential((tk(P271)>=1) & (tk(P1573)>=1)))
(potential((tk(P310)>=1) & (tk(P1574)>=1)))
(potential((tk(P349)>=1) & (tk(P1575)>=1)))
(potential((tk(P388)>=1) & (tk(P1576)>=1)))
(potential((tk(P427)>=1) & (tk(P1577)>=1)))
(potential((tk(P466)>=1) & (tk(P1578)>=1)))
(potential((tk(P505)>=1) & (tk(P1579)>=1)))
(potential((tk(P544)>=1) & (tk(P1580)>=1)))
(potential((tk(P583)>=1) & (tk(P1581)>=1)))
(potential((tk(P622)>=1) & (tk(P1582)>=1)))
(potential((tk(P661)>=1) & (tk(P1583)>=1)))
(potential((tk(P700)>=1) & (tk(P1584)>=1)))
(potential((tk(P739)>=1) & (tk(P1585)>=1)))
(potential((tk(P778)>=1) & (tk(P1586)>=1)))
(potential((tk(P817)>=1) & (tk(P1587)>=1)))
(potential((tk(P856)>=1) & (tk(P1588)>=1)))
(potential((tk(P895)>=1) & (tk(P1589)>=1)))
(potential((tk(P934)>=1) & (tk(P1590)>=1)))
(potential((tk(P973)>=1) & (tk(P1591)>=1)))
(potential((tk(P1012)>=1) & (tk(P1592)>=1)))
(potential((tk(P1051)>=1) & (tk(P1593)>=1)))
(potential((tk(P127)>=1) & (tk(P1594)>=1)))
(potential((tk(P166)>=1) & (tk(P1595)>=1)))
(potential((tk(P205)>=1) & (tk(P1596)>=1)))
(potential((tk(P244)>=1) & (tk(P1597)>=1)))
(potential((tk(P283)>=1) & (tk(P1598)>=1)))
(potential((tk(P322)>=1) & (tk(P1599)>=1)))
(potential((tk(P361)>=1) & (tk(P1600)>=1)))
(potential((tk(P400)>=1) & (tk(P1601)>=1)))
(potential((tk(P439)>=1) & (tk(P1602)>=1)))
(potential((tk(P478)>=1) & (tk(P1603)>=1)))
(potential((tk(P517)>=1) & (tk(P1604)>=1)))
(potential((tk(P556)>=1) & (tk(P1605)>=1)))
(potential((tk(P595)>=1) & (tk(P1606)>=1)))
(potential((tk(P634)>=1) & (tk(P1607)>=1)))
(potential((tk(P673)>=1) & (tk(P1608)>=1)))
(potential((tk(P712)>=1) & (tk(P1609)>=1)))
(potential((tk(P751)>=1) & (tk(P1610)>=1)))
(potential((tk(P790)>=1) & (tk(P1611)>=1)))
(potential((tk(P829)>=1) & (tk(P1612)>=1)))
(potential((tk(P868)>=1) & (tk(P1613)>=1)))
(potential((tk(P907)>=1) & (tk(P1614)>=1)))
(potential((tk(P946)>=1) & (tk(P1615)>=1)))
(potential((tk(P985)>=1) & (tk(P1616)>=1)))
(potential((tk(P1024)>=1) & (tk(P1617)>=1)))
(potential((tk(P157)>=1) & (tk(P1697)>=1)))
(potential((tk(P196)>=1) & (tk(P1698)>=1)))
(potential((tk(P235)>=1) & (tk(P1699)>=1)))
(potential((tk(P274)>=1) & (tk(P1700)>=1)))
(potential((tk(P313)>=1) & (tk(P1701)>=1)))
(potential((tk(P352)>=1) & (tk(P1702)>=1)))
(potential((tk(P391)>=1) & (tk(P1703)>=1)))
(potential((tk(P430)>=1) & (tk(P1704)>=1)))
(potential((tk(P469)>=1) & (tk(P1705)>=1)))
(potential((tk(P508)>=1) & (tk(P1706)>=1)))
(potential((tk(P547)>=1) & (tk(P1707)>=1)))
(potential((tk(P586)>=1) & (tk(P1708)>=1)))
(potential((tk(P625)>=1) & (tk(P1709)>=1)))
(potential((tk(P664)>=1) & (tk(P1710)>=1)))
(potential((tk(P703)>=1) & (tk(P1711)>=1)))
(potential((tk(P742)>=1) & (tk(P1712)>=1)))
(potential((tk(P781)>=1) & (tk(P1713)>=1)))
(potential((tk(P820)>=1) & (tk(P1714)>=1)))
(potential((tk(P859)>=1) & (tk(P1715)>=1)))
(potential((tk(P898)>=1) & (tk(P1716)>=1)))
(potential((tk(P937)>=1) & (tk(P1717)>=1)))
(potential((tk(P976)>=1) & (tk(P1718)>=1)))
(potential((tk(P1015)>=1) & (tk(P1719)>=1)))
(potential((tk(P1054)>=1) & (tk(P1720)>=1)))
(potential((tk(P148)>=1) & (tk(P1746)>=1)))
(potential((tk(P187)>=1) & (tk(P1747)>=1)))
(potential((tk(P226)>=1) & (tk(P1748)>=1)))
(potential((tk(P265)>=1) & (tk(P1749)>=1)))
(potential((tk(P304)>=1) & (tk(P1750)>=1)))
(potential((tk(P343)>=1) & (tk(P1751)>=1)))
(potential((tk(P382)>=1) & (tk(P1752)>=1)))
(potential((tk(P421)>=1) & (tk(P1753)>=1)))
(potential((tk(P460)>=1) & (tk(P1754)>=1)))
(potential((tk(P499)>=1) & (tk(P1755)>=1)))
(potential((tk(P538)>=1) & (tk(P1756)>=1)))
(potential((tk(P577)>=1) & (tk(P1757)>=1)))
(potential((tk(P616)>=1) & (tk(P1758)>=1)))
(potential((tk(P655)>=1) & (tk(P1759)>=1)))
(potential((tk(P694)>=1) & (tk(P1760)>=1)))
(potential((tk(P733)>=1) & (tk(P1761)>=1)))
(potential((tk(P772)>=1) & (tk(P1762)>=1)))
(potential((tk(P811)>=1) & (tk(P1763)>=1)))
(potential((tk(P850)>=1) & (tk(P1764)>=1)))
(potential((tk(P889)>=1) & (tk(P1765)>=1)))
(potential((tk(P928)>=1) & (tk(P1766)>=1)))
(potential((tk(P967)>=1) & (tk(P1767)>=1)))
(potential((tk(P1006)>=1) & (tk(P1768)>=1)))
(potential((tk(P1045)>=1) & (tk(P1769)>=1)))
(potential((tk(P138)>=1) & (tk(P1770)>=1)))
(potential((tk(P177)>=1) & (tk(P1771)>=1)))
(potential((tk(P216)>=1) & (tk(P1772)>=1)))
(potential((tk(P255)>=1) & (tk(P1773)>=1)))
(potential((tk(P294)>=1) & (tk(P1774)>=1)))
(potential((tk(P333)>=1) & (tk(P1775)>=1)))
(potential((tk(P372)>=1) & (tk(P1776)>=1)))
(potential((tk(P411)>=1) & (tk(P1777)>=1)))
(potential((tk(P450)>=1) & (tk(P1778)>=1)))
(potential((tk(P489)>=1) & (tk(P1779)>=1)))
(potential((tk(P528)>=1) & (tk(P1780)>=1)))
(potential((tk(P567)>=1) & (tk(P1781)>=1)))
(potential((tk(P606)>=1) & (tk(P1782)>=1)))
(potential((tk(P645)>=1) & (tk(P1783)>=1)))
(potential((tk(P684)>=1) & (tk(P1784)>=1)))
(potential((tk(P723)>=1) & (tk(P1785)>=1)))
(potential((tk(P762)>=1) & (tk(P1786)>=1)))
(potential((tk(P801)>=1) & (tk(P1787)>=1)))
(potential((tk(P840)>=1) & (tk(P1788)>=1)))
(potential((tk(P879)>=1) & (tk(P1789)>=1)))
(potential((tk(P918)>=1) & (tk(P1790)>=1)))
(potential((tk(P957)>=1) & (tk(P1791)>=1)))
(potential((tk(P996)>=1) & (tk(P1792)>=1)))
(potential((tk(P1035)>=1) & (tk(P1793)>=1)))
(potential((tk(P170)>=1) & (tk(P1840)>=1)))
(potential((tk(P181)>=1) & (tk(P1841)>=1)))
(potential((tk(P1081)>=1) & (tk(P1843)>=1)))
(potential((tk(P1092)>=1) & (tk(P1844)>=1)))
(potential((tk(P248)>=1) & (tk(P1874)>=1)))
(potential((tk(P259)>=1) & (tk(P1875)>=1)))
(potential((tk(P1115)>=1) & (tk(P1877)>=1)))
(potential((tk(P1126)>=1) & (tk(P1878)>=1)))
(potential((tk(P326)>=1) & (tk(P1908)>=1)))
(potential((tk(P337)>=1) & (tk(P1909)>=1)))
(potential((tk(P1149)>=1) & (tk(P1911)>=1)))
(potential((tk(P1160)>=1) & (tk(P1912)>=1)))
(potential((tk(P404)>=1) & (tk(P1942)>=1)))
(potential((tk(P415)>=1) & (tk(P1943)>=1)))
(potential((tk(P1183)>=1) & (tk(P1945)>=1)))
(potential((tk(P1194)>=1) & (tk(P1946)>=1)))
(potential((tk(P482)>=1) & (tk(P1976)>=1)))
(potential((tk(P493)>=1) & (tk(P1977)>=1)))
(potential((tk(P1217)>=1) & (tk(P1979)>=1)))
(potential((tk(P1228)>=1) & (tk(P1980)>=1)))
(potential((tk(P560)>=1) & (tk(P2010)>=1)))
(potential((tk(P571)>=1) & (tk(P2011)>=1)))
(potential((tk(P1251)>=1) & (tk(P2013)>=1)))
(potential((tk(P1262)>=1) & (tk(P2014)>=1)))
(potential((tk(P638)>=1) & (tk(P2044)>=1)))
(potential((tk(P649)>=1) & (tk(P2045)>=1)))
(potential((tk(P1285)>=1) & (tk(P2047)>=1)))
(potential((tk(P1296)>=1) & (tk(P2048)>=1)))
(potential((tk(P716)>=1) & (tk(P2078)>=1)))
(potential((tk(P727)>=1) & (tk(P2079)>=1)))
(potential((tk(P1319)>=1) & (tk(P2081)>=1)))
(potential((tk(P1330)>=1) & (tk(P2082)>=1)))
(potential((tk(P794)>=1) & (tk(P2112)>=1)))
(potential((tk(P805)>=1) & (tk(P2113)>=1)))
(potential((tk(P1353)>=1) & (tk(P2115)>=1)))
(potential((tk(P1364)>=1) & (tk(P2116)>=1)))
(potential((tk(P872)>=1) & (tk(P2146)>=1)))
(potential((tk(P883)>=1) & (tk(P2147)>=1)))
(potential((tk(P1387)>=1) & (tk(P2149)>=1)))
(potential((tk(P1398)>=1) & (tk(P2150)>=1)))
(potential((tk(P950)>=1) & (tk(P2180)>=1)))
(potential((tk(P961)>=1) & (tk(P2181)>=1)))
(potential((tk(P1421)>=1) & (tk(P2183)>=1)))
(potential((tk(P1432)>=1) & (tk(P2184)>=1)))
(potential((tk(P1028)>=1) & (tk(P2214)>=1)))
(potential((tk(P1039)>=1) & (tk(P2215)>=1)))
(potential((tk(P1455)>=1) & (tk(P2217)>=1)))
(potential((tk(P1466)>=1) & (tk(P2218)>=1)))
(potential((tk(P1521)>=1)))
(potential((tk(P1522)>=1)))
(potential((tk(P1523)>=1)))
(potential((tk(P1524)>=1)))
(potential((tk(P1525)>=1)))
(potential((tk(P1526)>=1)))
(potential((tk(P1527)>=1)))
(potential((tk(P1528)>=1)))
(potential((tk(P1529)>=1)))
(potential((tk(P1530)>=1)))
(potential((tk(P1531)>=1)))
(potential((tk(P1532)>=1)))
(potential((tk(P1533)>=1)))
(potential((tk(P1534)>=1)))
(potential((tk(P1535)>=1)))
(potential((tk(P1536)>=1)))
(potential((tk(P1537)>=1)))
(potential((tk(P1538)>=1)))
(potential((tk(P1539)>=1)))
(potential((tk(P1540)>=1)))
(potential((tk(P1541)>=1)))
(potential((tk(P1542)>=1)))
(potential((tk(P1543)>=1)))
(potential((tk(P1544)>=1)))
(potential((tk(P1545)>=1)))
(potential((tk(P1546)>=1)))
(potential((tk(P1547)>=1)))
(potential((tk(P1548)>=1)))
(potential((tk(P1549)>=1)))
(potential((tk(P1550)>=1)))
(potential((tk(P1551)>=1)))
(potential((tk(P1552)>=1)))
(potential((tk(P1553)>=1)))
(potential((tk(P1554)>=1)))
(potential((tk(P1555)>=1)))
(potential((tk(P1556)>=1)))
(potential((tk(P1557)>=1)))
(potential((tk(P1558)>=1)))
(potential((tk(P1559)>=1)))
(potential((tk(P1560)>=1)))
(potential((tk(P1561)>=1)))
(potential((tk(P1562)>=1)))
(potential((tk(P1563)>=1)))
(potential((tk(P1564)>=1)))
(potential((tk(P1565)>=1)))
(potential((tk(P1566)>=1)))
(potential((tk(P1567)>=1)))
(potential((tk(P1568)>=1)))
(potential((tk(P1721)>=1)))
(potential((tk(P1722)>=1)))
(potential((tk(P1723)>=1)))
(potential((tk(P1724)>=1)))
(potential((tk(P1725)>=1)))
(potential((tk(P1726)>=1)))
(potential((tk(P1727)>=1)))
(potential((tk(P1728)>=1)))
(potential((tk(P1729)>=1)))
(potential((tk(P1730)>=1)))
(potential((tk(P1731)>=1)))
(potential((tk(P1732)>=1)))
(potential((tk(P1733)>=1)))
(potential((tk(P1734)>=1)))
(potential((tk(P1735)>=1)))
(potential((tk(P1736)>=1)))
(potential((tk(P1737)>=1)))
(potential((tk(P1738)>=1)))
(potential((tk(P1739)>=1)))
(potential((tk(P1740)>=1)))
(potential((tk(P1741)>=1)))
(potential((tk(P1742)>=1)))
(potential((tk(P1743)>=1)))
(potential((tk(P1744)>=1)))
(potential((tk(P2212)>=1) & (tk(P2229)>=1)))
(potential((tk(P2178)>=1) & (tk(P2229)>=1)))
(potential((tk(P2144)>=1) & (tk(P2229)>=1)))
(potential((tk(P2110)>=1) & (tk(P2229)>=1)))
(potential((tk(P2076)>=1) & (tk(P2229)>=1)))
(potential((tk(P2042)>=1) & (tk(P2229)>=1)))
(potential((tk(P2008)>=1) & (tk(P2229)>=1)))
(potential((tk(P1974)>=1) & (tk(P2229)>=1)))
(potential((tk(P1940)>=1) & (tk(P2229)>=1)))
(potential((tk(P1906)>=1) & (tk(P2229)>=1)))
(potential((tk(P1872)>=1) & (tk(P2229)>=1)))
(potential((tk(P1838)>=1) & (tk(P2229)>=1)))
(potential((tk(P1695)>=1) & (tk(P2229)>=1)))
(potential((tk(P1495)>=1) & (tk(P2229)>=1)))
(potential((tk(P1821)>=1) & (tk(P2229)>=1)))
(potential((tk(P1855)>=1) & (tk(P2229)>=1)))
(potential((tk(P1889)>=1) & (tk(P2229)>=1)))
(potential((tk(P1923)>=1) & (tk(P2229)>=1)))
(potential((tk(P1957)>=1) & (tk(P2229)>=1)))
(potential((tk(P1991)>=1) & (tk(P2229)>=1)))
(potential((tk(P2025)>=1) & (tk(P2229)>=1)))
(potential((tk(P2059)>=1) & (tk(P2229)>=1)))
(potential((tk(P2093)>=1) & (tk(P2229)>=1)))
(potential((tk(P2127)>=1) & (tk(P2229)>=1)))
(potential((tk(P2161)>=1) & (tk(P2229)>=1)))
(potential((tk(P2195)>=1) & (tk(P2229)>=1)))
(potential((tk(P2219)>=1) & (tk(P2227)>=1)))
(potential((tk(P2185)>=1) & (tk(P2227)>=1)))
(potential((tk(P2151)>=1) & (tk(P2227)>=1)))
(potential((tk(P2117)>=1) & (tk(P2227)>=1)))
(potential((tk(P2083)>=1) & (tk(P2227)>=1)))
(potential((tk(P2049)>=1) & (tk(P2227)>=1)))
(potential((tk(P2015)>=1) & (tk(P2227)>=1)))
(potential((tk(P1981)>=1) & (tk(P2227)>=1)))
(potential((tk(P1947)>=1) & (tk(P2227)>=1)))
(potential((tk(P1913)>=1) & (tk(P2227)>=1)))
(potential((tk(P1879)>=1) & (tk(P2227)>=1)))
(potential((tk(P1845)>=1) & (tk(P2227)>=1)))
(potential((tk(P1794)>=1) & (tk(P2227)>=1)))
(potential((tk(P1618)>=1) & (tk(P2227)>=1)))
(potential((tk(P1828)>=1) & (tk(P2227)>=1)))
(potential((tk(P1862)>=1) & (tk(P2227)>=1)))
(potential((tk(P1896)>=1) & (tk(P2227)>=1)))
(potential((tk(P1930)>=1) & (tk(P2227)>=1)))
(potential((tk(P1964)>=1) & (tk(P2227)>=1)))
(potential((tk(P1998)>=1) & (tk(P2227)>=1)))
(potential((tk(P2032)>=1) & (tk(P2227)>=1)))
(potential((tk(P2066)>=1) & (tk(P2227)>=1)))
(potential((tk(P2100)>=1) & (tk(P2227)>=1)))
(potential((tk(P2134)>=1) & (tk(P2227)>=1)))
(potential((tk(P2168)>=1) & (tk(P2227)>=1)))
(potential((tk(P2202)>=1) & (tk(P2227)>=1)))

BK_STOP 1679009311180

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 900 Killed ${SMART}/smart ${INPUT_SM}

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="AutoFlight-PT-24b"
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 AutoFlight-PT-24b, 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 r025-oct2-167813611800307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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