Execution Chart

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

Trace from the execution

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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1680811983979

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2023-04-06 20:13:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-04-06 20:13:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 20:13:05] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-04-06 20:13:05] [INFO ] Transformed 553 places.
[2023-04-06 20:13:05] [INFO ] Transformed 1960 transitions.
[2023-04-06 20:13:05] [INFO ] Found NUPN structural information;
[2023-04-06 20:13:05] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 308 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 553) seen :374
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=101 ) properties (out of 179) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 179) seen :0
Running SMT prover for 179 properties.
[2023-04-06 20:13:06] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2023-04-06 20:13:06] [INFO ] Computed 22 invariants in 20 ms
[2023-04-06 20:13:08] [INFO ] After 2117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:179
[2023-04-06 20:13:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-04-06 20:13:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2023-04-06 20:13:16] [INFO ] After 5184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :179
[2023-04-06 20:13:17] [INFO ] State equation strengthened by 472 read => feed constraints.
[2023-04-06 20:13:23] [INFO ] After 6946ms SMT Verify possible using 472 Read/Feed constraints in natural domain returned unsat :0 sat :179
[2023-04-06 20:13:24] [INFO ] Deduced a trap composed of 38 places in 271 ms of which 16 ms to minimize.
[2023-04-06 20:13:24] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-04-06 20:13:24] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 1 ms to minimize.
[2023-04-06 20:13:24] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2023-04-06 20:13:25] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 1 ms to minimize.
[2023-04-06 20:13:25] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-06 20:13:25] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 0 ms to minimize.
[2023-04-06 20:13:25] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-06 20:13:25] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 0 ms to minimize.
[2023-04-06 20:13:26] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 0 ms to minimize.
[2023-04-06 20:13:26] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 0 ms to minimize.
[2023-04-06 20:13:26] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:13:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2447 ms
[2023-04-06 20:13:26] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-04-06 20:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-04-06 20:13:27] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-06 20:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-04-06 20:13:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-06 20:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-06 20:13:28] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 0 ms to minimize.
[2023-04-06 20:13:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2023-04-06 20:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2023-04-06 20:13:28] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2023-04-06 20:13:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-04-06 20:13:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-04-06 20:13:30] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 0 ms to minimize.
[2023-04-06 20:13:30] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2023-04-06 20:13:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2023-04-06 20:13:30] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-04-06 20:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-04-06 20:13:31] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 1 ms to minimize.
[2023-04-06 20:13:31] [INFO ] Deduced a trap composed of 119 places in 221 ms of which 0 ms to minimize.
[2023-04-06 20:13:31] [INFO ] Deduced a trap composed of 111 places in 222 ms of which 1 ms to minimize.
[2023-04-06 20:13:31] [INFO ] Deduced a trap composed of 111 places in 207 ms of which 1 ms to minimize.
[2023-04-06 20:13:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1037 ms
[2023-04-06 20:13:32] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 1 ms to minimize.
[2023-04-06 20:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-04-06 20:13:32] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2023-04-06 20:13:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-04-06 20:13:32] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 0 ms to minimize.
[2023-04-06 20:13:32] [INFO ] Deduced a trap composed of 111 places in 171 ms of which 0 ms to minimize.
[2023-04-06 20:13:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2023-04-06 20:13:33] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 0 ms to minimize.
[2023-04-06 20:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-04-06 20:13:33] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:426)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 20:13:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-04-06 20:13:33] [INFO ] After 25114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:179
Fused 179 Parikh solutions to 138 different solutions.
Parikh walk visited 2 properties in 12641 ms.
Support contains 177 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 14 place count 546 transition count 1841
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 238 place count 434 transition count 1841
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 280 place count 392 transition count 1547
Iterating global reduction 2 with 42 rules applied. Total rules applied 322 place count 392 transition count 1547
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 3 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 384 place count 361 transition count 1516
Applied a total of 384 rules in 178 ms. Remains 361 /553 variables (removed 192) and now considering 1516/1960 (removed 444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 361/553 places, 1516/1960 transitions.
Interrupted random walk after 947315 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen 17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 160) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 160) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 159) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 159) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 158) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Running SMT prover for 157 properties.
[2023-04-06 20:14:20] [INFO ] Flow matrix only has 557 transitions (discarded 959 similar events)
// Phase 1: matrix 557 rows 361 cols
[2023-04-06 20:14:20] [INFO ] Computed 22 invariants in 7 ms
[2023-04-06 20:14:21] [INFO ] After 1099ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:157
[2023-04-06 20:14:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-04-06 20:14:22] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:14:26] [INFO ] After 2685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :157
[2023-04-06 20:14:26] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:14:29] [INFO ] After 3209ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :157
[2023-04-06 20:14:29] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 0 ms to minimize.
[2023-04-06 20:14:29] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 0 ms to minimize.
[2023-04-06 20:14:29] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-06 20:14:29] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 1 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 0 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 0 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 0 ms to minimize.
[2023-04-06 20:14:30] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1982 ms
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:14:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 171 ms
[2023-04-06 20:14:32] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2023-04-06 20:14:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-04-06 20:14:32] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 0 ms to minimize.
[2023-04-06 20:14:32] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2023-04-06 20:14:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-04-06 20:14:33] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 4 ms to minimize.
[2023-04-06 20:14:33] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2023-04-06 20:14:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-04-06 20:14:33] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-04-06 20:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-04-06 20:14:33] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2023-04-06 20:14:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-06 20:14:33] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2023-04-06 20:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-06 20:14:34] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 1 ms to minimize.
[2023-04-06 20:14:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2023-04-06 20:14:35] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 0 ms to minimize.
[2023-04-06 20:14:35] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2023-04-06 20:14:35] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:14:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 275 ms
[2023-04-06 20:14:35] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 3 ms to minimize.
[2023-04-06 20:14:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-04-06 20:14:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2023-04-06 20:14:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 3 ms to minimize.
[2023-04-06 20:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2023-04-06 20:14:36] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2023-04-06 20:14:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2023-04-06 20:14:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-04-06 20:14:37] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:14:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 20:14:37] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2023-04-06 20:14:37] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:14:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2023-04-06 20:14:38] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 0 ms to minimize.
[2023-04-06 20:14:38] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2023-04-06 20:14:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 349 ms
[2023-04-06 20:14:39] [INFO ] After 13175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :157
Attempting to minimize the solution found.
Minimization took 3602 ms.
[2023-04-06 20:14:42] [INFO ] After 21225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :157
Fused 157 Parikh solutions to 112 different solutions.
Parikh walk visited 0 properties in 2383 ms.
Support contains 157 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 1516/1516 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 350 transition count 1505
Applied a total of 22 rules in 67 ms. Remains 350 /361 variables (removed 11) and now considering 1505/1516 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 350/361 places, 1505/1516 transitions.
Interrupted random walk after 990018 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 157) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 157) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 156) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 156) seen :0
Probabilistic random walk after 10000000 steps, saw 2030554 distinct states, run finished after 68490 ms. (steps per millisecond=146 ) properties seen :154
Running SMT prover for 2 properties.
[2023-04-06 20:16:27] [INFO ] Flow matrix only has 546 transitions (discarded 959 similar events)
// Phase 1: matrix 546 rows 350 cols
[2023-04-06 20:16:27] [INFO ] Computed 22 invariants in 8 ms
[2023-04-06 20:16:27] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:16:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:16:27] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 20:16:27] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:16:27] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:16:27] [INFO ] After 72ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:16:27] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 0 ms to minimize.
[2023-04-06 20:16:27] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2023-04-06 20:16:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-04-06 20:16:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-04-06 20:16:28] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2023-04-06 20:16:28] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 392 ms
[2023-04-06 20:16:28] [INFO ] After 512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 20:16:28] [INFO ] After 772ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 60 ms.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1505/1505 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 350 transition count 1463
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 308 transition count 1463
Applied a total of 84 rules in 50 ms. Remains 308 /350 variables (removed 42) and now considering 1463/1505 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 308/350 places, 1463/1505 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7513 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 5049392 steps, run timeout after 27001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 5049392 steps, saw 1117180 distinct states, run finished after 27004 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 20:17:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 20:17:05] [INFO ] Computed 22 invariants in 2 ms
[2023-04-06 20:17:05] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 20:17:05] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:17:05] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:05] [INFO ] After 59ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-04-06 20:17:05] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2023-04-06 20:17:05] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-06 20:17:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2023-04-06 20:17:05] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-06 20:17:05] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 62 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 44 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 34 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 20:17:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:05] [INFO ] Invariant cache hit.
[2023-04-06 20:17:06] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-04-06 20:17:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:06] [INFO ] Invariant cache hit.
[2023-04-06 20:17:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:07] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
[2023-04-06 20:17:07] [INFO ] Redundant transitions in 94 ms returned []
[2023-04-06 20:17:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:07] [INFO ] Invariant cache hit.
[2023-04-06 20:17:07] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1907 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 991 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 20:17:08] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:08] [INFO ] Invariant cache hit.
[2023-04-06 20:17:08] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:17:08] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:17:08] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-04-06 20:17:08] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:08] [INFO ] After 28ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-04-06 20:17:08] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-04-06 20:17:09] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2023-04-06 20:17:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 209 ms
[2023-04-06 20:17:09] [INFO ] After 295ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:09] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:17:09] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:17:09] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:09] [INFO ] After 31ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:09] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-04-06 20:17:09] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8940 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 6005160 steps, run timeout after 33001 ms. (steps per millisecond=181 ) properties seen :{}
Probabilistic random walk after 6005160 steps, saw 1299732 distinct states, run finished after 33002 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 2 properties.
[2023-04-06 20:17:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:54] [INFO ] Invariant cache hit.
[2023-04-06 20:17:54] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:17:54] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:17:54] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:54] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:54] [INFO ] After 60ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:54] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 20:17:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 20:17:54] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-04-06 20:17:54] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 20:17:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:54] [INFO ] Invariant cache hit.
[2023-04-06 20:17:54] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-04-06 20:17:54] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:54] [INFO ] Invariant cache hit.
[2023-04-06 20:17:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:55] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-04-06 20:17:55] [INFO ] Redundant transitions in 72 ms returned []
[2023-04-06 20:17:55] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:55] [INFO ] Invariant cache hit.
[2023-04-06 20:17:56] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1810 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 926 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 20:17:57] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:17:57] [INFO ] Invariant cache hit.
[2023-04-06 20:17:57] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:17:57] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:17:57] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-04-06 20:17:57] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:17:57] [INFO ] After 31ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :2
[2023-04-06 20:17:57] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-06 20:17:57] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2023-04-06 20:17:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 220 ms
[2023-04-06 20:17:57] [INFO ] After 305ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:57] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:17:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 20:17:57] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 20:17:57] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:58] [INFO ] After 39ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:17:58] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-06 20:17:58] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 752440 steps, run timeout after 3001 ms. (steps per millisecond=250 ) properties seen :{}
Probabilistic random walk after 752440 steps, saw 240537 distinct states, run finished after 3001 ms. (steps per millisecond=250 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:18:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:01] [INFO ] Invariant cache hit.
[2023-04-06 20:18:01] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:18:01] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:18:01] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:01] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:01] [INFO ] After 45ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:01] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-04-06 20:18:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 20:18:01] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 20:18:01] [INFO ] After 347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 48 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 745104 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 745104 steps, saw 238339 distinct states, run finished after 3001 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:18:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:04] [INFO ] Invariant cache hit.
[2023-04-06 20:18:04] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:04] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-04-06 20:18:04] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2023-04-06 20:18:04] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:04] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:04] [INFO ] After 41ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:04] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 0 ms to minimize.
[2023-04-06 20:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-06 20:18:05] [INFO ] After 154ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-04-06 20:18:05] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 33 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 20:18:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:05] [INFO ] Invariant cache hit.
[2023-04-06 20:18:05] [INFO ] Implicit Places using invariants in 260 ms returned []
[2023-04-06 20:18:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:05] [INFO ] Invariant cache hit.
[2023-04-06 20:18:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:06] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2023-04-06 20:18:06] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-06 20:18:06] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:06] [INFO ] Invariant cache hit.
[2023-04-06 20:18:06] [INFO ] Dead Transitions using invariants and state equation in 421 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1784 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 32 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 20:18:06] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 20:18:06] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-04-06 20:18:06] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 20:18:06] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:06] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:18:06] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 709760 steps, run timeout after 3001 ms. (steps per millisecond=236 ) properties seen :{}
Probabilistic random walk after 709760 steps, saw 230773 distinct states, run finished after 3001 ms. (steps per millisecond=236 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:18:10] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2023-04-06 20:18:10] [INFO ] Computed 22 invariants in 8 ms
[2023-04-06 20:18:10] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-04-06 20:18:10] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:18:10] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:10] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:10] [INFO ] After 42ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:10] [INFO ] After 73ms 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-04-06 20:18:10] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/308 places, 1463/1463 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 769112 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 769112 steps, saw 245909 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-06 20:18:13] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:13] [INFO ] Invariant cache hit.
[2023-04-06 20:18:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-04-06 20:18:13] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2023-04-06 20:18:13] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:13] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:13] [INFO ] After 42ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:13] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-04-06 20:18:13] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 46 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 41 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2023-04-06 20:18:13] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:13] [INFO ] Invariant cache hit.
[2023-04-06 20:18:14] [INFO ] Implicit Places using invariants in 270 ms returned []
[2023-04-06 20:18:14] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:14] [INFO ] Invariant cache hit.
[2023-04-06 20:18:14] [INFO ] State equation strengthened by 220 read => feed constraints.
[2023-04-06 20:18:15] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-04-06 20:18:15] [INFO ] Redundant transitions in 23 ms returned []
[2023-04-06 20:18:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2023-04-06 20:18:15] [INFO ] Invariant cache hit.
[2023-04-06 20:18:15] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1767 ms. Remains : 308/308 places, 1463/1463 transitions.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 24 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2023-04-06 20:18:15] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 20:18:15] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-06 20:18:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 20:18:15] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 20:18:15] [INFO ] After 3ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-06 20:18:15] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-06 20:18:15] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 1347 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 368 place count 100 transition count 177
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 382 place count 93 transition count 177
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 389 place count 93 transition count 170
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 396 place count 93 transition count 163
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 480 place count 51 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 487 place count 51 transition count 121
Applied a total of 487 rules in 28 ms. Remains 51 /308 variables (removed 257) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 121 rows 51 cols
[2023-04-06 20:18:15] [INFO ] Computed 15 invariants in 1 ms
[2023-04-06 20:18:15] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-06 20:18:15] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2023-04-06 20:18:15] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-06 20:18:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-04-06 20:18:15] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-06 20:18:15] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-06 20:18:15] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Unable to solve all queries for examination StableMarking. Remains :2 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 2 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 310359 ms.
starting LoLA
BK_INPUT EisenbergMcGuire-PT-07
BK_EXAMINATION: StableMarking
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution
GlobalProperty: StableMarking

FORMULA StableMarking FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1680812427632
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14001180 kB
After kill :
MemTotal: 16393216 kB
MemFree: 14000352 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/model.pnml
lola: STATE EQUATION TRIES PLACE p12_3_1
lola: LAUNCH SYMM
sara: try reading problem file stateEquationProblem-ConstantPlace-57.sara.
sara: place or transition ordering is non-deterministic

lola: STATE EQUATION TRIES PLACE p12_4_6
sara: try reading problem file stateEquationProblem-ConstantPlace-104.sara.
lola: reporting
lola: not produced: 301
lola: state equation: 1
lola: find path: 94
lola: goal oriented search: 157
sara: place or transition ordering is non-deterministic
lola: reporting
lola: not produced: 288
lola: state equation: 1
lola: find path: 107
lola: goal oriented search: 157
lola: reporting
lola: not produced: 104
lola: state equation: 1
lola: find path: 116
lola: goal oriented search: 332
lola: reporting
lola: not produced: 98
lola: state equation: 1
lola: find path: 122
lola: goal oriented search: 332
lola: reporting
lola: not produced: 98
lola: state equation: 1
lola: find path: 122
lola: goal oriented search: 332
lola: reporting
lola: not produced: 65
lola: state equation: 1
lola: find path: 139
lola: goal oriented search: 348
lola: reporting
lola: not produced: 56
lola: state equation: 1
lola: find path: 148
lola: goal oriented search: 348
lola: reporting
lola: not produced: 56
lola: state equation: 1
lola: find path: 148
lola: goal oriented search: 348
lola: reporting
lola: not produced: 43
lola: state equation: 1
lola: find path: 149
lola: goal oriented search: 360
lola: reporting
lola: not produced: 43
lola: state equation: 1
lola: find path: 149
lola: goal oriented search: 360
lola: reporting
lola: not produced: 38
lola: state equation: 1
lola: find path: 154
lola: goal oriented search: 360
lola: reporting
lola: not produced: 32
lola: state equation: 1
lola: find path: 160
lola: goal oriented search: 360
lola: reporting
lola: not produced: 14
lola: state equation: 1
lola: find path: 160
lola: goal oriented search: 378
lola: reporting
lola: not produced: 10
lola: state equation: 1
lola: find path: 163
lola: goal oriented search: 379
lola: reporting
lola: not produced: 10
lola: state equation: 1
lola: find path: 163
lola: goal oriented search: 379
lola: reporting
lola: not produced: 8
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 379
lola: reporting
lola: not produced: 7
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 380
lola: reporting
lola: not produced: 4
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 383
lola: reporting
lola: not produced: 4
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 383
lola: reporting
lola: not produced: 3
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 384
lola: reporting
lola: not produced: 3
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 384
lola: reporting
lola: not produced: 2
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 385
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 386
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 386
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 386
lola: reporting
lola: not produced: 1
lola: state equation: 1
lola: find path: 165
lola: goal oriented search: 386
lola: The net does not have constant places
sara: warning, failure of lp_solve (at job 3389)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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