About the Execution of 2022-gold for JoinFreeModules-PT-2000
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.r255-tall-167856440300028.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 gold2022
Input is JoinFreeModules-PT-2000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300028
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.2M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-2000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678748134524
Running Version 202205111006
[2023-03-13 22:55:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 22:55:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:55:36] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2023-03-13 22:55:36] [INFO ] Transformed 10001 places.
[2023-03-13 22:55:36] [INFO ] Transformed 16001 transitions.
[2023-03-13 22:55:36] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 613 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-13 22:55:36] [INFO ] Computed 2000 place invariants in 118 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=8 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 984 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 984 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 969 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 978 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1049 ms. (steps per millisecond=9 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 977 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 924 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=11 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 930 ms. (steps per millisecond=10 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 16) seen :4013
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 923 ms. (steps per millisecond=10 ) properties (out of 16) seen :4012
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=11 ) properties (out of 16) seen :4013
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-13 22:55:52] [INFO ] Computed 2000 place invariants in 47 ms
[2023-03-13 22:55:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 725 ms returned sat
[2023-03-13 22:55:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:57] [INFO ] [Real]Absence check using state equation in 3341 ms returned unknown
[2023-03-13 22:55:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 718 ms returned sat
[2023-03-13 22:55:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:56:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 738 ms returned sat
[2023-03-13 22:56:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:07] [INFO ] [Real]Absence check using state equation in 3356 ms returned unknown
[2023-03-13 22:56:09] [INFO ] [Real]Absence check using 2000 positive place invariants in 746 ms returned sat
[2023-03-13 22:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:12] [INFO ] [Real]Absence check using state equation in 3316 ms returned unknown
[2023-03-13 22:56:14] [INFO ] [Real]Absence check using 2000 positive place invariants in 740 ms returned sat
[2023-03-13 22:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:17] [INFO ] [Real]Absence check using state equation in 3318 ms returned unknown
[2023-03-13 22:56:19] [INFO ] [Real]Absence check using 2000 positive place invariants in 722 ms returned sat
[2023-03-13 22:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:56:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 717 ms returned sat
[2023-03-13 22:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:27] [INFO ] [Real]Absence check using state equation in 3447 ms returned unknown
[2023-03-13 22:56:29] [INFO ] [Real]Absence check using 2000 positive place invariants in 705 ms returned sat
[2023-03-13 22:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:32] [INFO ] [Real]Absence check using state equation in 3455 ms returned unknown
[2023-03-13 22:56:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 716 ms returned sat
[2023-03-13 22:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:37] [INFO ] [Real]Absence check using state equation in 3448 ms returned unknown
[2023-03-13 22:56:39] [INFO ] [Real]Absence check using 2000 positive place invariants in 733 ms returned sat
[2023-03-13 22:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:42] [INFO ] [Real]Absence check using state equation in 3426 ms returned unknown
[2023-03-13 22:56:44] [INFO ] [Real]Absence check using 2000 positive place invariants in 724 ms returned sat
[2023-03-13 22:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:47] [INFO ] [Real]Absence check using state equation in 3454 ms returned unknown
[2023-03-13 22:56:49] [INFO ] [Real]Absence check using 2000 positive place invariants in 726 ms returned sat
[2023-03-13 22:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:52] [INFO ] [Real]Absence check using state equation in 3439 ms returned unknown
[2023-03-13 22:56:54] [INFO ] [Real]Absence check using 2000 positive place invariants in 721 ms returned sat
[2023-03-13 22:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:56:58] [INFO ] [Real]Absence check using state equation in 3464 ms returned unknown
[2023-03-13 22:56:59] [INFO ] [Real]Absence check using 2000 positive place invariants in 704 ms returned sat
[2023-03-13 22:56:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:03] [INFO ] [Real]Absence check using state equation in 3485 ms returned unknown
[2023-03-13 22:57:04] [INFO ] [Real]Absence check using 2000 positive place invariants in 719 ms returned sat
[2023-03-13 22:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:08] [INFO ] [Real]Absence check using state equation in 3472 ms returned unknown
[2023-03-13 22:57:09] [INFO ] [Real]Absence check using 2000 positive place invariants in 734 ms returned sat
[2023-03-13 22:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:13] [INFO ] [Real]Absence check using state equation in 3443 ms returned unknown
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2, 2, 1, 2, 2, 2000, 1, 2, 1, 1, 1, 2, 2, 1, 2000, 1]
Support contains 16 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 80 are kept as prefixes of interest. Removing 9920 places using SCC suffix rule.36 ms
Discarding 9920 places :
Also discarding 15872 output transitions
Drop transitions removed 15872 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 127 ms. Remains 80 /10000 variables (removed 9920) and now considering 128/16001 (removed 15873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:13] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:57:13] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/10000 places, 128/16001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:13] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1000588 steps, including 2 resets, run finished after 898 ms. (steps per millisecond=1114 ) properties (out of 16) seen :29530
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties (out of 16) seen :4394
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 16) seen :6250
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 16) seen :5452
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 16) seen :4382
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1143 ms. (steps per millisecond=874 ) properties (out of 16) seen :4405
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 16) seen :4317
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 16) seen :6273
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1226 ms. (steps per millisecond=815 ) properties (out of 16) seen :4404
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1125 ms. (steps per millisecond=888 ) properties (out of 16) seen :5456
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 16) seen :5445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties (out of 16) seen :5443
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 16) seen :4394
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 16) seen :6265
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 16) seen :5471
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 16) seen :4333
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 16) seen :5445
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:32] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:57:32] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:32] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:35] [INFO ] [Nat]Absence check using state equation in 2731 ms returned sat
[2023-03-13 22:57:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:57:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2023-03-13 22:57:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-13 22:57:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2023-03-13 22:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-13 22:57:35] [INFO ] Added : 38 causal constraints over 9 iterations in 333 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:57:35] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-13 22:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:35] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:57:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-13 22:57:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:57:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:57:35] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2023-03-13 22:57:35] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:57:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2023-03-13 22:57:35] [INFO ] Added : 39 causal constraints over 10 iterations in 245 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:57:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:36] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-13 22:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:36] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:57:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:57:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:57:36] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-03-13 22:57:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-13 22:57:36] [INFO ] Added : 40 causal constraints over 9 iterations in 263 ms. Result :sat
Minimization took 68 ms.
[2023-03-13 22:57:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:36] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:57:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:57:36] [INFO ] Added : 49 causal constraints over 13 iterations in 153 ms. Result :sat
Minimization took 54 ms.
[2023-03-13 22:57:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:57:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:57:37] [INFO ] Added : 35 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:57:37] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 20 ms returned sat
[2023-03-13 22:57:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:57:37] [INFO ] Added : 39 causal constraints over 10 iterations in 127 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:57:37] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:57:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:37] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:57:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:57:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-13 22:57:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-13 22:57:37] [INFO ] Added : 48 causal constraints over 12 iterations in 170 ms. Result :sat
Minimization took 47 ms.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:38] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 64 ms returned sat
[2023-03-13 22:57:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:57:38] [INFO ] Added : 44 causal constraints over 9 iterations in 150 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:38] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:57:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:57:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:57:38] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-13 22:57:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-13 22:57:38] [INFO ] Added : 43 causal constraints over 9 iterations in 181 ms. Result :sat
Minimization took 131 ms.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-13 22:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:39] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:57:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:57:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:57:39] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-13 22:57:39] [INFO ] Added : 54 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 155 ms.
[2023-03-13 22:57:39] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:39] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:39] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2023-03-13 22:57:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:57:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:57:39] [INFO ] Added : 42 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 68 ms.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:57:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:57:40] [INFO ] Added : 33 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 60 ms.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 54 ms returned sat
[2023-03-13 22:57:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:57:40] [INFO ] Added : 46 causal constraints over 10 iterations in 103 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:40] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-13 22:57:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 23 ms returned sat
[2023-03-13 22:57:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:57:41] [INFO ] Added : 53 causal constraints over 11 iterations in 126 ms. Result :sat
Minimization took 56 ms.
[2023-03-13 22:57:41] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:41] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:41] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:57:41] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:57:41] [INFO ] Added : 42 causal constraints over 9 iterations in 93 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:57:41] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:57:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:57:41] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-13 22:57:41] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:57:41] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:57:41] [INFO ] Added : 45 causal constraints over 11 iterations in 162 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[1926, 2001, 1876, 1760, 1876, 2000, 2000, 1956, 1773, 1782, 1979, 1501, 2001, 1847, 2000, 1253]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 6 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:53] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:57:53] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:53] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:57:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:57:53] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-13 22:57:53] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:53] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:57:53] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:57:53] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000162 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 16) seen :29968
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 16) seen :4450
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 16) seen :6255
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 16) seen :5460
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1149 ms. (steps per millisecond=870 ) properties (out of 16) seen :4390
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 16) seen :4396
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 16) seen :4323
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 16) seen :6264
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 16) seen :4385
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 16) seen :5444
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 16) seen :5455
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1113 ms. (steps per millisecond=898 ) properties (out of 16) seen :5439
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 16) seen :4402
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1043 ms. (steps per millisecond=958 ) properties (out of 16) seen :6253
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 16) seen :5502
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 16) seen :4328
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 16) seen :5466
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:12] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:58:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:12] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-13 22:58:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:58:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:58:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:58:12] [INFO ] Added : 44 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:58:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:58:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:12] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:58:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:58:13] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:58:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2023-03-13 22:58:13] [INFO ] Added : 39 causal constraints over 10 iterations in 185 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:58:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:13] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-13 22:58:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 22:58:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:13] [INFO ] Added : 51 causal constraints over 11 iterations in 157 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:58:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:13] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:58:13] [INFO ] Added : 30 causal constraints over 7 iterations in 84 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:14] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:58:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:58:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 4 ms to minimize.
[2023-03-13 22:58:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2023-03-13 22:58:14] [INFO ] Added : 54 causal constraints over 12 iterations in 290 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:58:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:14] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:14] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:58:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:14] [INFO ] Added : 39 causal constraints over 10 iterations in 107 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:58:14] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:14] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-13 22:58:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:58:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:15] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-13 22:58:15] [INFO ] Added : 48 causal constraints over 12 iterations in 169 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:15] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:58:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:15] [INFO ] Added : 30 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:15] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:58:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:58:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-13 22:58:15] [INFO ] Added : 48 causal constraints over 12 iterations in 202 ms. Result :sat
Minimization took 50 ms.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:16] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 102 ms returned sat
[2023-03-13 22:58:16] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-13 22:58:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-13 22:58:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:16] [INFO ] Added : 53 causal constraints over 12 iterations in 151 ms. Result :sat
Minimization took 38 ms.
[2023-03-13 22:58:16] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:16] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:58:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:58:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:58:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:58:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 97 ms
[2023-03-13 22:58:16] [INFO ] Added : 48 causal constraints over 11 iterations in 233 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:58:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:16] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:58:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:17] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:58:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:58:17] [INFO ] Added : 37 causal constraints over 8 iterations in 160 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:17] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 54 ms returned sat
[2023-03-13 22:58:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:58:17] [INFO ] Added : 46 causal constraints over 10 iterations in 104 ms. Result :sat
Minimization took 42 ms.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:17] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:58:17] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-13 22:58:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:58:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 22:58:17] [INFO ] Added : 40 causal constraints over 9 iterations in 137 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:17] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:58:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:18] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:58:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 30 ms returned sat
[2023-03-13 22:58:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:18] [INFO ] Added : 42 causal constraints over 9 iterations in 86 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:58:18] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:58:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:18] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2023-03-13 22:58:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:58:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-13 22:58:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:58:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:58:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-13 22:58:18] [INFO ] Added : 38 causal constraints over 9 iterations in 160 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 1998, 2002, 2002, 2000, 2000, 2002, 1999, 2001, 2001, 2002, 2001, 2001, 2000, 1999]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:30] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:58:30] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:30] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:58:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:58:30] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-13 22:58:30] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:30] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:58:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:30] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 1001355 steps, including 2 resets, run finished after 847 ms. (steps per millisecond=1182 ) properties (out of 16) seen :30027
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1145 ms. (steps per millisecond=873 ) properties (out of 16) seen :4395
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1094 ms. (steps per millisecond=914 ) properties (out of 16) seen :6266
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 16) seen :5448
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties (out of 16) seen :4429
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 16) seen :4382
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 16) seen :4328
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 16) seen :6304
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties (out of 16) seen :4409
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 16) seen :5436
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 16) seen :5479
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1107 ms. (steps per millisecond=903 ) properties (out of 16) seen :5429
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1171 ms. (steps per millisecond=853 ) properties (out of 16) seen :4431
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=943 ) properties (out of 16) seen :6252
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 16) seen :5502
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 16) seen :4370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 16) seen :5483
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:58:49] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:58:49] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:49] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:49] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 22:58:49] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:58:49] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:49] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:58:49] [INFO ] Added : 44 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:50] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:58:50] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:58:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2023-03-13 22:58:50] [INFO ] Added : 39 causal constraints over 10 iterations in 185 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:50] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:58:50] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:58:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-13 22:58:50] [INFO ] Added : 49 causal constraints over 10 iterations in 233 ms. Result :sat
Minimization took 53 ms.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:50] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:58:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:51] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:58:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:58:51] [INFO ] Added : 30 causal constraints over 7 iterations in 96 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:58:51] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:51] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:51] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:58:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-13 22:58:51] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:58:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2023-03-13 22:58:51] [INFO ] Added : 54 causal constraints over 12 iterations in 290 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:58:51] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:58:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:51] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 22:58:51] [INFO ] [Nat]Added 16 Read/Feed constraints in 22 ms returned sat
[2023-03-13 22:58:51] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-13 22:58:51] [INFO ] Added : 39 causal constraints over 10 iterations in 113 ms. Result :sat
Minimization took 47 ms.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:58:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:58:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-13 22:58:52] [INFO ] Added : 48 causal constraints over 12 iterations in 171 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:58:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:52] [INFO ] Added : 30 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:58:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:52] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-13 22:58:52] [INFO ] [Nat]Added 16 Read/Feed constraints in 13 ms returned sat
[2023-03-13 22:58:52] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:58:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-13 22:58:53] [INFO ] Added : 48 causal constraints over 12 iterations in 222 ms. Result :sat
Minimization took 58 ms.
[2023-03-13 22:58:53] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:53] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:53] [INFO ] Added : 34 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:58:53] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:58:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:53] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:53] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 22:58:53] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:58:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:58:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 97 ms
[2023-03-13 22:58:53] [INFO ] Added : 48 causal constraints over 11 iterations in 247 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:58:53] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:58:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:58:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:58:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-13 22:58:54] [INFO ] Added : 37 causal constraints over 8 iterations in 197 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:58:54] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:58:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 54 ms returned sat
[2023-03-13 22:58:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-13 22:58:54] [INFO ] Added : 46 causal constraints over 10 iterations in 124 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:58:54] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:58:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:54] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-13 22:58:54] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:58:54] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:58:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 22:58:55] [INFO ] Added : 40 causal constraints over 9 iterations in 133 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:58:55] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:55] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:58:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:58:55] [INFO ] Added : 42 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:58:55] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:58:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:58:55] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:58:55] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-13 22:58:55] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:58:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 22:58:55] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-13 22:58:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:58:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-13 22:58:55] [INFO ] Added : 38 causal constraints over 9 iterations in 166 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003, 2003] Max seen :[2002, 2001, 2001, 2002, 2002, 2000, 2000, 2002, 1999, 2002, 2001, 2002, 2001, 2001, 2000, 1999]
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 128/128 (removed 0) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:06] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:06] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:06] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-13 22:59:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:06] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:06] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/80 places, 128/128 transitions.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-00
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:06] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10344 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1149 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:06] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:06] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:07] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:59:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-13 22:59:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:59:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-13 22:59:07] [INFO ] Added : 50 causal constraints over 10 iterations in 195 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[4]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:08] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000352 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=9349 ) properties (out of 1) seen :1971
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:08] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:08] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2023-03-13 22:59:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-00 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-00 in 1628 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:08] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :100
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:08] [INFO ] Computed 16 place invariants in 5 ms
[2023-03-13 22:59:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:08] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:59:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:08] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:59:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:59:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-13 22:59:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:59:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
[2023-03-13 22:59:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 104 ms
[2023-03-13 22:59:08] [INFO ] Added : 52 causal constraints over 11 iterations in 236 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[100]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:09] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:09] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000107 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=10205 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=4545 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:09] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:09] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:59:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:59:09] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:09] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:10] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:59:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000051 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10309 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=5128 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:10] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:59:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:10] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-13 22:59:10] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-13 22:59:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-01 in 2063 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:10] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:10] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:10] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:10] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:59:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:10] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:10] [INFO ] Added : 48 causal constraints over 10 iterations in 119 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1000]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000430 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10313 ) properties (out of 1) seen :1974
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:12] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:59:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-13 22:59:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:59:12] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:12] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:12] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:59:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-02 in 1998 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-03
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:12] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 11010 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=917 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :4
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:12] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:12] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:59:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:12] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:59:12] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:12] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:59:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-13 22:59:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:59:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 68 ms
[2023-03-13 22:59:12] [INFO ] Added : 49 causal constraints over 11 iterations in 209 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[4]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:13] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000862 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10647 ) properties (out of 1) seen :1982
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:59:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-03 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-03 in 1673 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:14] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10259 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=932 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :3
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:14] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:14] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-13 22:59:14] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:14] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:14] [INFO ] Added : 46 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[3]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:15] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:15] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000023 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10638 ) properties (out of 1) seen :1961
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:15] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:59:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:15] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:15] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2023-03-13 22:59:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-04 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-04 in 1524 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:15] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 11008 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=846 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2000
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:15] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:15] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:59:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:15] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:59:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:59:16] [INFO ] Added : 39 causal constraints over 10 iterations in 112 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000111 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10417 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:16] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:16] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:16] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 22:59:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-05 in 795 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:16] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :154
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:16] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:16] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-13 22:59:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:16] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:59:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2023-03-13 22:59:16] [INFO ] Added : 54 causal constraints over 11 iterations in 178 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[154]
FORMULA JoinFreeModules-PT-2000-UpperBounds-06 2003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-06 in 1817 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:18] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :3
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:18] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:18] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:59:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:18] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:18] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-13 22:59:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:18] [INFO ] [Nat]Added 16 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:59:18] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:18] [INFO ] Added : 36 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[3]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:19] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:19] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000364 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10530 ) properties (out of 1) seen :1978
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:59:19] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-13 22:59:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-07 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-07 in 1629 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:19] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:20] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:20] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:20] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-13 22:59:20] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:20] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:20] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-13 22:59:20] [INFO ] Added : 51 causal constraints over 11 iterations in 168 ms. Result :sat
Minimization took 304 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[93]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:21] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000421 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=9349 ) properties (out of 1) seen :1975
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=7575 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:21] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:59:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-03-13 22:59:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:21] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:59:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000311 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10529 ) properties (out of 1) seen :1964
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:59:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-13 22:59:22] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:22] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-13 22:59:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-08 in 2705 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:22] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:22] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:22] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-13 22:59:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:22] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:22] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:59:23] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:59:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-13 22:59:23] [INFO ] Added : 51 causal constraints over 11 iterations in 179 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[93]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:24] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000241 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10311 ) properties (out of 1) seen :1999
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:24] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:24] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:59:24] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:24] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:24] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:59:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:24] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:24] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000399 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10530 ) properties (out of 1) seen :1973
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-13 22:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-13 22:59:25] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:59:25] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:25] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:25] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:59:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:25] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-09 in 2770 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:25] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:25] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:59:25] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:25] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:25] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:59:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:25] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:25] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-13 22:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-13 22:59:25] [INFO ] Added : 51 causal constraints over 11 iterations in 172 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[93]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:26] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000457 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10531 ) properties (out of 1) seen :1979
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:26] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:26] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:59:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2023-03-13 22:59:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2023-03-13 22:59:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:26] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:27] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:27] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:59:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:27] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000459 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10531 ) properties (out of 1) seen :1982
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:27] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:59:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2023-03-13 22:59:27] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:59:27] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:27] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-13 22:59:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:27] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:27] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-10 in 2488 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:27] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 11260 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1251 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :11
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:27] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-13 22:59:28] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:28] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-13 22:59:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:28] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:28] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:28] [INFO ] Added : 33 causal constraints over 7 iterations in 89 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[11]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:29] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:29] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:29] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000112 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10310 ) properties (out of 1) seen :1938
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :2002
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:29] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-13 22:59:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:29] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:59:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
Current structural bounds on expressions (after SMT) : [2002] Max seen :[2002]
FORMULA JoinFreeModules-PT-2000-UpperBounds-11 2002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-11 in 1600 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:29] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 11009 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :100
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:29] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:29] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:29] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:59:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:29] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-13 22:59:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:29] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:29] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:59:29] [INFO ] Added : 39 causal constraints over 9 iterations in 123 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[100]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:31] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000103 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10527 ) properties (out of 1) seen :2001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=6756 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:31] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:31] [INFO ] Added : 6 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:31] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-13 22:59:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:31] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:31] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-12 in 1938 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:31] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:31] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:31] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:31] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:59:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:31] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2023-03-13 22:59:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:31] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:31] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:59:31] [INFO ] Added : 43 causal constraints over 9 iterations in 165 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1000]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 3 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:32] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:33] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000265 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=10312 ) properties (out of 1) seen :1969
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7299 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:33] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:59:33] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 4 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:33] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-13 22:59:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-13 22:59:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000355 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=10873 ) properties (out of 1) seen :1990
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7246 ) properties (out of 1) seen :2001
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:33] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:33] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 22:59:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:59:33] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-13 22:59:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-13 22:59:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:59:33] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:34] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:59:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-13 in 2743 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:34] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 10544 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1171 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :2000
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:34] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:34] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:34] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-13 22:59:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:34] [INFO ] [Nat]Added 16 Read/Feed constraints in 21 ms returned sat
[2023-03-13 22:59:34] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-13 22:59:34] [INFO ] Added : 42 causal constraints over 9 iterations in 90 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.0 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000094 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10639 ) properties (out of 1) seen :2000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:59:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:34] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2000]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:59:34] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:34] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:35] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 22:59:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:35] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-14 in 789 ms.
Starting property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:35] [INFO ] Computed 16 place invariants in 0 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :93
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:59:35] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:59:35] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-13 22:59:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:59:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:59:35] [INFO ] Added : 41 causal constraints over 9 iterations in 133 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[93]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 5 are kept as prefixes of interest. Removing 75 places using SCC suffix rule.1 ms
Discarding 75 places :
Also discarding 120 output transitions
Drop transitions removed 120 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /80 variables (removed 75) and now considering 8/128 (removed 120) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/80 places, 8/128 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000332 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=10529 ) properties (out of 1) seen :1977
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :1999
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:59:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:59:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:36] [INFO ] Added : 4 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[1999]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 22:59:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000217 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8697 ) properties (out of 1) seen :1995
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :2000
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:36] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:59:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:59:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:59:36] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:59:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:59:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-13 22:59:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-13 22:59:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:59:36] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [2003] Max seen :[2001]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:37] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:59:37] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:59:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:59:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:59:37] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-2000-UpperBounds-15 in 2243 ms.
[2023-03-13 22:59:37] [INFO ] Flatten gal took : 44 ms
[2023-03-13 22:59:37] [INFO ] Applying decomposition
[2023-03-13 22:59:37] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13074956323219626964.txt' '-o' '/tmp/graph13074956323219626964.bin' '-w' '/tmp/graph13074956323219626964.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13074956323219626964.bin' '-l' '-1' '-v' '-w' '/tmp/graph13074956323219626964.weights' '-q' '0' '-e' '0.001'
[2023-03-13 22:59:37] [INFO ] Decomposing Gal with order
[2023-03-13 22:59:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 22:59:37] [INFO ] Flatten gal took : 7 ms
[2023-03-13 22:59:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-13 22:59:37] [INFO ] Time to serialize gal into /tmp/UpperBounds3300404058206252240.gal : 4 ms
[2023-03-13 22:59:37] [INFO ] Time to serialize properties into /tmp/UpperBounds14418308279897574181.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3300404058206252240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14418308279897574181.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds14418308279897574181.prop.
Detected timeout of ITS tools.
[2023-03-13 23:20:57] [INFO ] Flatten gal took : 8 ms
[2023-03-13 23:20:57] [INFO ] Time to serialize gal into /tmp/UpperBounds7459785304646872213.gal : 2 ms
[2023-03-13 23:20:57] [INFO ] Time to serialize properties into /tmp/UpperBounds8898814921345847805.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7459785304646872213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8898814921345847805.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds8898814921345847805.prop.
Detected timeout of ITS tools.
[2023-03-13 23:42:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 23:42:18] [INFO ] Input system was already deterministic with 128 transitions.
[2023-03-13 23:42:18] [INFO ] Transformed 80 places.
[2023-03-13 23:42:18] [INFO ] Transformed 128 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-13 23:42:18] [INFO ] Time to serialize gal into /tmp/UpperBounds10147330425795070713.gal : 1 ms
[2023-03-13 23:42:18] [INFO ] Time to serialize properties into /tmp/UpperBounds1570224498411545705.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10147330425795070713.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1570224498411545705.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1570224498411545705.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="JoinFreeModules-PT-2000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 gold2022"
echo " Input is JoinFreeModules-PT-2000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r255-tall-167856440300028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-2000.tgz
mv JoinFreeModules-PT-2000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;