fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407000459
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-1000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8856.628 1521551.00 1541152.00 3861.10 1002 1000 1002 1003 1001 1001 1003 1003 1000 1002 1002 1003 1000 1000 1001 1003 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407000459.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407000459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 151K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 24 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 24 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 5.7M May 5 16:51 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-1000-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-1000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620849434126

Running Version 0
[2021-05-12 19:57:15] [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]
[2021-05-12 19:57:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 19:57:16] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2021-05-12 19:57:16] [INFO ] Transformed 5001 places.
[2021-05-12 19:57:16] [INFO ] Transformed 8001 transitions.
[2021-05-12 19:57:16] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 454 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 8001 rows 5000 cols
[2021-05-12 19:57:16] [INFO ] Computed 1000 place invariants in 64 ms
Incomplete random walk after 10516 steps, including 2 resets, run finished after 506 ms. (steps per millisecond=20 ) properties (out of 16) seen :4003
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 16) seen :4003
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=21 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :4003
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=22 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=24 ) properties (out of 16) seen :4003
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 16) seen :4003
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 16) seen :4005
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 16) seen :4005
// Phase 1: matrix 8001 rows 5000 cols
[2021-05-12 19:57:23] [INFO ] Computed 1000 place invariants in 22 ms
[2021-05-12 19:57:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 262 ms returned sat
[2021-05-12 19:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:28] [INFO ] [Real]Absence check using state equation in 3243 ms returned sat
[2021-05-12 19:57:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:57:29] [INFO ] [Nat]Absence check using 1000 positive place invariants in 246 ms returned sat
[2021-05-12 19:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:33] [INFO ] [Nat]Absence check using state equation in 4309 ms returned unknown
[2021-05-12 19:57:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:57:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:37] [INFO ] [Real]Absence check using state equation in 3285 ms returned sat
[2021-05-12 19:57:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:57:38] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2021-05-12 19:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:42] [INFO ] [Nat]Absence check using state equation in 4334 ms returned unknown
[2021-05-12 19:57:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:46] [INFO ] [Real]Absence check using state equation in 3181 ms returned sat
[2021-05-12 19:57:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:57:47] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
[2021-05-12 19:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:51] [INFO ] [Nat]Absence check using state equation in 4335 ms returned unknown
[2021-05-12 19:57:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 237 ms returned sat
[2021-05-12 19:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:57:55] [INFO ] [Real]Absence check using state equation in 3191 ms returned sat
[2021-05-12 19:57:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:57:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
[2021-05-12 19:57:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:00] [INFO ] [Nat]Absence check using state equation in 4320 ms returned unknown
[2021-05-12 19:58:01] [INFO ] [Real]Absence check using 1000 positive place invariants in 238 ms returned sat
[2021-05-12 19:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:04] [INFO ] [Real]Absence check using state equation in 3211 ms returned sat
[2021-05-12 19:58:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:05] [INFO ] [Nat]Absence check using 1000 positive place invariants in 247 ms returned sat
[2021-05-12 19:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:10] [INFO ] [Nat]Absence check using state equation in 4325 ms returned unknown
[2021-05-12 19:58:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 238 ms returned sat
[2021-05-12 19:58:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:14] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2021-05-12 19:58:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:14] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
[2021-05-12 19:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:19] [INFO ] [Nat]Absence check using state equation in 4345 ms returned unknown
[2021-05-12 19:58:20] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:23] [INFO ] [Real]Absence check using state equation in 3231 ms returned sat
[2021-05-12 19:58:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:24] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:28] [INFO ] [Nat]Absence check using state equation in 4338 ms returned unknown
[2021-05-12 19:58:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:32] [INFO ] [Real]Absence check using state equation in 3284 ms returned sat
[2021-05-12 19:58:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:33] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:37] [INFO ] [Nat]Absence check using state equation in 4341 ms returned unknown
[2021-05-12 19:58:38] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2021-05-12 19:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:41] [INFO ] [Real]Absence check using state equation in 3230 ms returned sat
[2021-05-12 19:58:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:42] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:47] [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 8
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-12 19:58:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:58:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:50] [INFO ] [Real]Absence check using state equation in 3180 ms returned sat
[2021-05-12 19:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:58:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:58:56] [INFO ] [Nat]Absence check using state equation in 4324 ms returned unknown
[2021-05-12 19:58:56] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2021-05-12 19:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:00] [INFO ] [Real]Absence check using state equation in 3214 ms returned sat
[2021-05-12 19:59:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:01] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
[2021-05-12 19:59:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:05] [INFO ] [Nat]Absence check using state equation in 4332 ms returned unknown
[2021-05-12 19:59:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:09] [INFO ] [Real]Absence check using state equation in 3199 ms returned sat
[2021-05-12 19:59:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:10] [INFO ] [Nat]Absence check using 1000 positive place invariants in 243 ms returned sat
[2021-05-12 19:59:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:14] [INFO ] [Nat]Absence check using state equation in 4333 ms returned unknown
[2021-05-12 19:59:15] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:59:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:18] [INFO ] [Real]Absence check using state equation in 3228 ms returned sat
[2021-05-12 19:59:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:19] [INFO ] [Nat]Absence check using 1000 positive place invariants in 242 ms returned sat
[2021-05-12 19:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:23] [INFO ] [Nat]Absence check using state equation in 4337 ms returned unknown
[2021-05-12 19:59:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 238 ms returned sat
[2021-05-12 19:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:27] [INFO ] [Real]Absence check using state equation in 3281 ms returned sat
[2021-05-12 19:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:28] [INFO ] [Nat]Absence check using 1000 positive place invariants in 244 ms returned sat
[2021-05-12 19:59:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:32] [INFO ] [Nat]Absence check using state equation in 4334 ms returned unknown
[2021-05-12 19:59:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:59:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:36] [INFO ] [Real]Absence check using state equation in 3160 ms returned sat
[2021-05-12 19:59:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:37] [INFO ] [Nat]Absence check using 1000 positive place invariants in 240 ms returned sat
[2021-05-12 19:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:42] [INFO ] [Nat]Absence check using state equation in 4340 ms returned unknown
[2021-05-12 19:59:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 238 ms returned sat
[2021-05-12 19:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:45] [INFO ] [Real]Absence check using state equation in 3186 ms returned sat
[2021-05-12 19:59:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 19:59:46] [INFO ] [Nat]Absence check using 1000 positive place invariants in 239 ms returned sat
[2021-05-12 19:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 19:59:51] [INFO ] [Nat]Absence check using state equation in 4338 ms returned unknown
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[2, 1000, 2, 2, 3, 3, 2, 2, 1000, 2, 2, 2, 1000, 1000, 3, 2]
Support contains 16 out of 5000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 80 are kept as prefixes of interest. Removing 4920 places using SCC suffix rule.13 ms
Discarding 4920 places :
Also discarding 7872 output transitions
Drop transitions removed 7872 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 54 ms. Remains 80 /5000 variables (removed 4920) and now considering 128/8001 (removed 7873) transitions.
// Phase 1: matrix 128 rows 80 cols
[2021-05-12 19:59:51] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-12 19:59:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/5000 places, 128/8001 transitions.
// Phase 1: matrix 128 rows 80 cols
[2021-05-12 19:59:51] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000218 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 16) seen :15837
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 16) seen :5005
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1159 ms. (steps per millisecond=862 ) properties (out of 16) seen :4333
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1152 ms. (steps per millisecond=868 ) properties (out of 16) seen :4934
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=881 ) properties (out of 16) seen :5309
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 16) seen :5286
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 :5296
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 16) seen :5324
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 16) seen :5315
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 :4336
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 16) seen :4970
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 :4976
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 16) seen :5331
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 :4351
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 :4371
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 16) seen :5293
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=907 ) properties (out of 16) seen :5354
// Phase 1: matrix 128 rows 80 cols
[2021-05-12 20:00:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-12 20:00:10] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 20:00:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:10] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:10] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-12 20:00:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 5 ms to minimize.
[2021-05-12 20:00:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-12 20:00:10] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 20:00:10] [INFO ] Added : 52 causal constraints over 11 iterations in 146 ms. Result :sat
Minimization took 115 ms.
[2021-05-12 20:00:10] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-12 20:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-12 20:00:11] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 20:00:11] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 20:00:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2021-05-12 20:00:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 20:00:11] [INFO ] Added : 46 causal constraints over 10 iterations in 124 ms. Result :sat
Minimization took 65 ms.
[2021-05-12 20:00:11] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-12 20:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-12 20:00:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 20:00:11] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 20:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-12 20:00:11] [INFO ] Added : 51 causal constraints over 12 iterations in 152 ms. Result :sat
Minimization took 87 ms.
[2021-05-12 20:00:11] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:11] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-12 20:00:11] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 20:00:12] [INFO ] Added : 59 causal constraints over 13 iterations in 159 ms. Result :sat
Minimization took 47 ms.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:12] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-12 20:00:12] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2021-05-12 20:00:12] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 20:00:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2021-05-12 20:00:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-12 20:00:12] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 20:00:12] [INFO ] Added : 42 causal constraints over 10 iterations in 135 ms. Result :sat
Minimization took 35 ms.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:12] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-12 20:00:12] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 20:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-12 20:00:12] [INFO ] Added : 46 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 63 ms.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:13] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:00:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 45 ms
[2021-05-12 20:00:13] [INFO ] Added : 54 causal constraints over 12 iterations in 173 ms. Result :sat
Minimization took 72 ms.
[2021-05-12 20:00:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:13] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:13] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-12 20:00:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:13] [INFO ] Added : 50 causal constraints over 11 iterations in 125 ms. Result :sat
Minimization took 61 ms.
[2021-05-12 20:00:13] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:13] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 20:00:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:13] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:13] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:00:13] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-12 20:00:13] [INFO ] Added : 52 causal constraints over 11 iterations in 165 ms. Result :sat
Minimization took 47 ms.
[2021-05-12 20:00:13] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-12 20:00:14] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 20:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:14] [INFO ] Added : 60 causal constraints over 13 iterations in 195 ms. Result :sat
Minimization took 95 ms.
[2021-05-12 20:00:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-12 20:00:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-12 20:00:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 20:00:14] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:14] [INFO ] Added : 36 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 92 ms.
[2021-05-12 20:00:14] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:00:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:14] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2021-05-12 20:00:14] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:15] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2021-05-12 20:00:15] [INFO ] Added : 56 causal constraints over 12 iterations in 233 ms. Result :sat
Minimization took 63 ms.
[2021-05-12 20:00:15] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:15] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-12 20:00:15] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:00:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:15] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-12 20:00:15] [INFO ] Added : 55 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 49 ms.
[2021-05-12 20:00:15] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:15] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2021-05-12 20:00:15] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 20:00:15] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 34 ms
[2021-05-12 20:00:16] [INFO ] Added : 49 causal constraints over 10 iterations in 198 ms. Result :sat
Minimization took 45 ms.
[2021-05-12 20:00:16] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:16] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 20:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:16] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2021-05-12 20:00:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:16] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:16] [INFO ] Added : 60 causal constraints over 13 iterations in 188 ms. Result :sat
Minimization took 51 ms.
[2021-05-12 20:00:16] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:16] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:16] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-12 20:00:16] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:00:16] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:16] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 29 ms
[2021-05-12 20:00:16] [INFO ] Added : 49 causal constraints over 11 iterations in 157 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[937, 1000, 960, 1001, 1001, 1001, 1000, 1000, 1000, 990, 953, 1001, 1000, 1000, 1001, 1000]
Incomplete Parikh walk after 76800 steps, including 101 resets, run finished after 267 ms. (steps per millisecond=287 ) properties (out of 16) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 112500 steps, including 100 resets, run finished after 308 ms. (steps per millisecond=365 ) properties (out of 16) seen :5041 could not realise parikh vector
Incomplete Parikh walk after 13300 steps, including 139 resets, run finished after 52 ms. (steps per millisecond=255 ) properties (out of 16) seen :4039 could not realise parikh vector
Incomplete Parikh walk after 13500 steps, including 126 resets, run finished after 56 ms. (steps per millisecond=241 ) properties (out of 16) seen :4043 could not realise parikh vector
Incomplete Parikh walk after 183600 steps, including 99 resets, run finished after 495 ms. (steps per millisecond=370 ) properties (out of 16) seen :5054 could not realise parikh vector
FORMULA JoinFreeModules-PT-1000-UpperBounds-11 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 180300 steps, including 99 resets, run finished after 486 ms. (steps per millisecond=370 ) properties (out of 15) seen :6029 could not realise parikh vector
Incomplete Parikh walk after 238900 steps, including 101 resets, run finished after 692 ms. (steps per millisecond=345 ) properties (out of 15) seen :5037 could not realise parikh vector
Incomplete Parikh walk after 8900 steps, including 134 resets, run finished after 31 ms. (steps per millisecond=287 ) properties (out of 15) seen :4024 could not realise parikh vector
Incomplete Parikh walk after 80100 steps, including 102 resets, run finished after 219 ms. (steps per millisecond=365 ) properties (out of 15) seen :5029 could not realise parikh vector
Incomplete Parikh walk after 314900 steps, including 99 resets, run finished after 830 ms. (steps per millisecond=379 ) properties (out of 15) seen :5031 could not realise parikh vector
Incomplete Parikh walk after 125500 steps, including 99 resets, run finished after 303 ms. (steps per millisecond=414 ) properties (out of 15) seen :5035 could not realise parikh vector
Incomplete Parikh walk after 110800 steps, including 100 resets, run finished after 277 ms. (steps per millisecond=400 ) properties (out of 15) seen :5023 could not realise parikh vector
Incomplete Parikh walk after 73600 steps, including 101 resets, run finished after 205 ms. (steps per millisecond=359 ) properties (out of 15) seen :5035 could not realise parikh vector
Incomplete Parikh walk after 439000 steps, including 100 resets, run finished after 1130 ms. (steps per millisecond=388 ) properties (out of 15) seen :5031 could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 126 resets, run finished after 37 ms. (steps per millisecond=283 ) properties (out of 15) seen :4031 could not realise parikh vector
Incomplete Parikh walk after 111800 steps, including 100 resets, run finished after 294 ms. (steps per millisecond=380 ) properties (out of 15) seen :5026 could not realise parikh vector
Support contains 15 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 75 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 75 /80 variables (removed 5) and now considering 120/128 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 75/80 places, 120/128 transitions.
// Phase 1: matrix 120 rows 75 cols
[2021-05-12 20:00:22] [INFO ] Computed 15 place invariants in 0 ms
Incomplete random walk after 1000056 steps, including 2 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 15) seen :14731
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1061 ms. (steps per millisecond=942 ) properties (out of 15) seen :5011
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 15) seen :4363
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1068 ms. (steps per millisecond=936 ) properties (out of 15) seen :5047
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 15) seen :5336
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties (out of 15) seen :5287
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1028 ms. (steps per millisecond=972 ) properties (out of 15) seen :5297
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 15) seen :5359
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 15) seen :5374
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 15) seen :4370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 15) seen :5053
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 15) seen :5002
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 15) seen :4341
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 15) seen :4345
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1027 ms. (steps per millisecond=973 ) properties (out of 15) seen :5301
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 15) seen :5301
// Phase 1: matrix 120 rows 75 cols
[2021-05-12 20:00:39] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:00:39] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:39] [INFO ] Added : 22 causal constraints over 7 iterations in 101 ms. Result :sat
Minimization took 42 ms.
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 1 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 34 ms
[2021-05-12 20:00:39] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:39] [INFO ] Added : 44 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 39 ms.
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:39] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 36 ms
[2021-05-12 20:00:39] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:00:40] [INFO ] Added : 37 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 32 ms.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 20:00:40] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:00:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:40] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:00:40] [INFO ] Added : 34 causal constraints over 7 iterations in 111 ms. Result :sat
Minimization took 32 ms.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2021-05-12 20:00:40] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:00:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:40] [INFO ] Added : 47 causal constraints over 10 iterations in 155 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:40] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 20:00:40] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:40] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 23 ms
[2021-05-12 20:00:40] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:40] [INFO ] Added : 36 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 28 ms.
[2021-05-12 20:00:40] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-12 20:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-12 20:00:41] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:41] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 23 ms
[2021-05-12 20:00:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:41] [INFO ] Added : 45 causal constraints over 11 iterations in 133 ms. Result :sat
Minimization took 40 ms.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-12 20:00:41] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:00:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:41] [INFO ] Added : 28 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-12 20:00:41] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:00:41] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:00:41] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 20:00:41] [INFO ] Added : 38 causal constraints over 9 iterations in 138 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:00:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:00:42] [INFO ] Added : 34 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 48 ms.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 22 ms
[2021-05-12 20:00:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-12 20:00:42] [INFO ] Added : 45 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 40 ms.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:00:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:00:42] [INFO ] Added : 33 causal constraints over 8 iterations in 114 ms. Result :sat
Minimization took 26 ms.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:42] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:00:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 21 ms
[2021-05-12 20:00:42] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:43] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:00:43] [INFO ] Added : 31 causal constraints over 7 iterations in 106 ms. Result :sat
Minimization took 36 ms.
[2021-05-12 20:00:43] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:43] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 20:00:43] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:00:43] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:00:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 23 ms
[2021-05-12 20:00:43] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:43] [INFO ] Added : 33 causal constraints over 9 iterations in 109 ms. Result :sat
Minimization took 22 ms.
[2021-05-12 20:00:43] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2021-05-12 20:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:43] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:00:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:00:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2021-05-12 20:00:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:00:43] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-12 20:00:43] [INFO ] Computed and/alt/rep : 90/225/90 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:00:43] [INFO ] Added : 46 causal constraints over 11 iterations in 115 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[999, 1000, 1001, 1001, 1001, 1001, 1001, 1001, 1000, 996, 1001, 1000, 1000, 1001, 1002]
Incomplete Parikh walk after 77400 steps, including 104 resets, run finished after 203 ms. (steps per millisecond=381 ) properties (out of 15) seen :5036 could not realise parikh vector
Incomplete Parikh walk after 107700 steps, including 100 resets, run finished after 244 ms. (steps per millisecond=441 ) properties (out of 15) seen :5025 could not realise parikh vector
Incomplete Parikh walk after 9100 steps, including 150 resets, run finished after 30 ms. (steps per millisecond=303 ) properties (out of 15) seen :4029 could not realise parikh vector
Incomplete Parikh walk after 13700 steps, including 122 resets, run finished after 42 ms. (steps per millisecond=326 ) properties (out of 15) seen :4025 could not realise parikh vector
Incomplete Parikh walk after 291200 steps, including 100 resets, run finished after 748 ms. (steps per millisecond=389 ) properties (out of 15) seen :5025 could not realise parikh vector
Incomplete Parikh walk after 220700 steps, including 101 resets, run finished after 510 ms. (steps per millisecond=432 ) properties (out of 15) seen :5020 could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 117 resets, run finished after 27 ms. (steps per millisecond=288 ) properties (out of 15) seen :4035 could not realise parikh vector
Incomplete Parikh walk after 69100 steps, including 101 resets, run finished after 162 ms. (steps per millisecond=426 ) properties (out of 15) seen :5012 could not realise parikh vector
Incomplete Parikh walk after 75800 steps, including 101 resets, run finished after 196 ms. (steps per millisecond=386 ) properties (out of 15) seen :5033 could not realise parikh vector
FORMULA JoinFreeModules-PT-1000-UpperBounds-06 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 107100 steps, including 100 resets, run finished after 256 ms. (steps per millisecond=418 ) properties (out of 14) seen :5025 could not realise parikh vector
Incomplete Parikh walk after 109500 steps, including 99 resets, run finished after 261 ms. (steps per millisecond=419 ) properties (out of 14) seen :5019 could not realise parikh vector
Incomplete Parikh walk after 71500 steps, including 103 resets, run finished after 171 ms. (steps per millisecond=418 ) properties (out of 14) seen :5020 could not realise parikh vector
Incomplete Parikh walk after 342900 steps, including 102 resets, run finished after 839 ms. (steps per millisecond=408 ) properties (out of 14) seen :5029 could not realise parikh vector
Incomplete Parikh walk after 15400 steps, including 125 resets, run finished after 50 ms. (steps per millisecond=308 ) properties (out of 14) seen :4035 could not realise parikh vector
Incomplete Parikh walk after 220500 steps, including 99 resets, run finished after 532 ms. (steps per millisecond=414 ) properties (out of 14) seen :5007 could not realise parikh vector
Support contains 14 out of 75 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 75/75 places, 120/120 transitions.
Graph (complete) has 180 edges and 75 vertex of which 70 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 4 ms. Remains 70 /75 variables (removed 5) and now considering 112/120 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 70/75 places, 112/120 transitions.
// Phase 1: matrix 112 rows 70 cols
[2021-05-12 20:00:47] [INFO ] Computed 14 place invariants in 1 ms
Incomplete random walk after 1000062 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 14) seen :13749
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 14) seen :5039
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 14) seen :4395
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 14) seen :5039
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 984 ms. (steps per millisecond=1016 ) properties (out of 14) seen :5270
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 14) seen :5239
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 14) seen :5271
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 14) seen :5335
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 14) seen :4385
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 14) seen :5031
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 14) seen :5031
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties (out of 14) seen :4327
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 14) seen :4372
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 14) seen :5266
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 14) seen :5318
// Phase 1: matrix 112 rows 70 cols
[2021-05-12 20:01:02] [INFO ] Computed 14 place invariants in 0 ms
[2021-05-12 20:01:02] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:02] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-12 20:01:02] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:01:02] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:02] [INFO ] Added : 26 causal constraints over 6 iterations in 97 ms. Result :sat
Minimization took 36 ms.
[2021-05-12 20:01:02] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:02] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:02] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-12 20:01:03] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:03] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:03] [INFO ] Added : 39 causal constraints over 9 iterations in 143 ms. Result :sat
Minimization took 28 ms.
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2021-05-12 20:01:03] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 10 ms
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-12 20:01:03] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:03] [INFO ] Added : 40 causal constraints over 9 iterations in 71 ms. Result :sat
Minimization took 44 ms.
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:03] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-12 20:01:03] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:01:03] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:03] [INFO ] Added : 56 causal constraints over 12 iterations in 189 ms. Result :sat
Minimization took 38 ms.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-12 20:01:04] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:04] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-12 20:01:04] [INFO ] Added : 45 causal constraints over 10 iterations in 191 ms. Result :sat
Minimization took 53 ms.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-12 20:01:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-12 20:01:04] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:04] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:01:04] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 27 ms
[2021-05-12 20:01:04] [INFO ] Added : 36 causal constraints over 9 iterations in 104 ms. Result :sat
Minimization took 41 ms.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:04] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-12 20:01:04] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:04] [INFO ] Added : 36 causal constraints over 8 iterations in 93 ms. Result :sat
Minimization took 43 ms.
[2021-05-12 20:01:04] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2021-05-12 20:01:05] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:05] [INFO ] Added : 45 causal constraints over 10 iterations in 92 ms. Result :sat
Minimization took 44 ms.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2021-05-12 20:01:05] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:05] [INFO ] Added : 23 causal constraints over 6 iterations in 79 ms. Result :sat
Minimization took 33 ms.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-12 20:01:05] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 20:01:05] [INFO ] Added : 41 causal constraints over 11 iterations in 77 ms. Result :sat
Minimization took 59 ms.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:05] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:06] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-12 20:01:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:06] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-12 20:01:06] [INFO ] Added : 35 causal constraints over 7 iterations in 202 ms. Result :sat
Minimization took 43 ms.
[2021-05-12 20:01:06] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:06] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-12 20:01:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:06] [INFO ] Added : 34 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 39 ms.
[2021-05-12 20:01:06] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:06] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:06] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2021-05-12 20:01:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:06] [INFO ] Added : 42 causal constraints over 9 iterations in 71 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1002, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[999, 1000, 1002, 1001, 1001, 1001, 1002, 1000, 999, 1001, 1000, 1000, 1001, 1002]
FORMULA JoinFreeModules-PT-1000-UpperBounds-02 1002 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 72200 steps, including 102 resets, run finished after 177 ms. (steps per millisecond=407 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 208500 steps, including 99 resets, run finished after 470 ms. (steps per millisecond=443 ) properties (out of 13) seen :5025 could not realise parikh vector
Incomplete Parikh walk after 16700 steps, including 118 resets, run finished after 46 ms. (steps per millisecond=363 ) properties (out of 13) seen :4030 could not realise parikh vector
Incomplete Parikh walk after 7400 steps, including 132 resets, run finished after 23 ms. (steps per millisecond=321 ) properties (out of 13) seen :4033 could not realise parikh vector
Incomplete Parikh walk after 217800 steps, including 100 resets, run finished after 491 ms. (steps per millisecond=443 ) properties (out of 13) seen :5011 could not realise parikh vector
Incomplete Parikh walk after 340800 steps, including 102 resets, run finished after 787 ms. (steps per millisecond=433 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 7200 steps, including 124 resets, run finished after 22 ms. (steps per millisecond=327 ) properties (out of 13) seen :4026 could not realise parikh vector
Incomplete Parikh walk after 369300 steps, including 101 resets, run finished after 820 ms. (steps per millisecond=450 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 176300 steps, including 100 resets, run finished after 437 ms. (steps per millisecond=403 ) properties (out of 13) seen :6029 could not realise parikh vector
Incomplete Parikh walk after 113000 steps, including 99 resets, run finished after 271 ms. (steps per millisecond=416 ) properties (out of 13) seen :5045 could not realise parikh vector
Incomplete Parikh walk after 72500 steps, including 101 resets, run finished after 171 ms. (steps per millisecond=423 ) properties (out of 13) seen :5025 could not realise parikh vector
Incomplete Parikh walk after 15000 steps, including 117 resets, run finished after 45 ms. (steps per millisecond=333 ) properties (out of 13) seen :4026 could not realise parikh vector
Incomplete Parikh walk after 226000 steps, including 101 resets, run finished after 535 ms. (steps per millisecond=422 ) properties (out of 13) seen :5012 could not realise parikh vector
Support contains 13 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 65 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 65 /70 variables (removed 5) and now considering 104/112 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/70 places, 104/112 transitions.
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:11] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000287 steps, including 2 resets, run finished after 747 ms. (steps per millisecond=1339 ) properties (out of 13) seen :12926
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 13) seen :5088
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties (out of 13) seen :4373
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 13) seen :5318
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 13) seen :5278
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 13) seen :5290
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 13) seen :5371
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 13) seen :4353
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 974 ms. (steps per millisecond=1026 ) properties (out of 13) seen :5125
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 13) seen :5060
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 13) seen :4381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 13) seen :4445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 13) seen :5263
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties (out of 13) seen :5348
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:24] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:24] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-12 20:01:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:24] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:24] [INFO ] Added : 29 causal constraints over 7 iterations in 92 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:24] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 20:01:24] [INFO ] Deduced a trap composed of 4 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:24] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 2 ms to minimize.
[2021-05-12 20:01:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 22 ms
[2021-05-12 20:01:24] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:24] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:24] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 27 ms
[2021-05-12 20:01:24] [INFO ] Added : 47 causal constraints over 11 iterations in 190 ms. Result :sat
Minimization took 35 ms.
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-12 20:01:25] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:25] [INFO ] Added : 34 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 36 ms.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-12 20:01:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:25] [INFO ] Added : 21 causal constraints over 5 iterations in 80 ms. Result :sat
Minimization took 25 ms.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-12 20:01:25] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 20:01:25] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 21 ms
[2021-05-12 20:01:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:25] [INFO ] Added : 40 causal constraints over 9 iterations in 149 ms. Result :sat
Minimization took 34 ms.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:25] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 20:01:25] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:25] [INFO ] Added : 24 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 28 ms.
[2021-05-12 20:01:25] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 20 ms
[2021-05-12 20:01:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:01:26] [INFO ] Added : 40 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 32 ms.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-12 20:01:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:01:26] [INFO ] Added : 34 causal constraints over 7 iterations in 107 ms. Result :sat
Minimization took 36 ms.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 20:01:26] [INFO ] Added : 42 causal constraints over 10 iterations in 118 ms. Result :sat
Minimization took 33 ms.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 20:01:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:26] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 20:01:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:26] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:01:27] [INFO ] Added : 36 causal constraints over 8 iterations in 135 ms. Result :sat
Minimization took 37 ms.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2021-05-12 20:01:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:27] [INFO ] Added : 39 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 38 ms.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 19 ms
[2021-05-12 20:01:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:27] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 20:01:27] [INFO ] Added : 46 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 17 ms.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:27] [INFO ] [Nat]Absence check using state equation in 213 ms returned sat
[2021-05-12 20:01:27] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:28] [INFO ] Added : 35 causal constraints over 9 iterations in 72 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003, 1003] Max seen :[1000, 1000, 1001, 1001, 1001, 1002, 1000, 1001, 1001, 1000, 1000, 1001, 1002]
Incomplete Parikh walk after 72900 steps, including 102 resets, run finished after 174 ms. (steps per millisecond=418 ) properties (out of 13) seen :5032 could not realise parikh vector
Incomplete Parikh walk after 116100 steps, including 100 resets, run finished after 249 ms. (steps per millisecond=466 ) properties (out of 13) seen :5027 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 140 resets, run finished after 32 ms. (steps per millisecond=325 ) properties (out of 13) seen :4029 could not realise parikh vector
Incomplete Parikh walk after 108100 steps, including 99 resets, run finished after 244 ms. (steps per millisecond=443 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 219000 steps, including 100 resets, run finished after 526 ms. (steps per millisecond=416 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 224000 steps, including 99 resets, run finished after 509 ms. (steps per millisecond=440 ) properties (out of 13) seen :5029 could not realise parikh vector
Incomplete Parikh walk after 8600 steps, including 144 resets, run finished after 27 ms. (steps per millisecond=318 ) properties (out of 13) seen :4034 could not realise parikh vector
Incomplete Parikh walk after 75600 steps, including 100 resets, run finished after 166 ms. (steps per millisecond=455 ) properties (out of 13) seen :5021 could not realise parikh vector
Incomplete Parikh walk after 113000 steps, including 101 resets, run finished after 244 ms. (steps per millisecond=463 ) properties (out of 13) seen :5028 could not realise parikh vector
Incomplete Parikh walk after 104300 steps, including 98 resets, run finished after 218 ms. (steps per millisecond=478 ) properties (out of 13) seen :5011 could not realise parikh vector
Incomplete Parikh walk after 70500 steps, including 103 resets, run finished after 156 ms. (steps per millisecond=451 ) properties (out of 13) seen :5013 could not realise parikh vector
Incomplete Parikh walk after 8400 steps, including 132 resets, run finished after 27 ms. (steps per millisecond=311 ) properties (out of 13) seen :4032 could not realise parikh vector
Incomplete Parikh walk after 218600 steps, including 100 resets, run finished after 487 ms. (steps per millisecond=448 ) properties (out of 13) seen :5012 could not realise parikh vector
Support contains 13 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 104/104 transitions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 104/104 (removed 0) transitions.
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:31] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:31] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:31] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-12 20:01:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:31] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 104/104 transitions.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-00
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:31] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10076 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1679 ) properties (out of 1) seen :1
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 :112
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:31] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:31] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:31] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:31] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-12 20:01:31] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:31] [INFO ] Added : 33 causal constraints over 8 iterations in 57 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[112]
Incomplete Parikh walk after 736000 steps, including 99 resets, run finished after 1609 ms. (steps per millisecond=457 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:33] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:33] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:33] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000213 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9092 ) properties (out of 1) seen :994
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 1) seen :999
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:33] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:33] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:33] [INFO ] Added : 6 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 332400 steps, including 102 resets, run finished after 413 ms. (steps per millisecond=804 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:34] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:34] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:34] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-00 in 2940 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-01
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:34] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10143 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1690 ) 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 :1000
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:34] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 20:01:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:34] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 20:01:34] [INFO ] Deduced a trap composed of 4 places in 7 ms of which 0 ms to minimize.
[2021-05-12 20:01:34] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 20:01:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-12 20:01:34] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:34] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:34] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-12 20:01:34] [INFO ] Added : 47 causal constraints over 11 iterations in 189 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 8400 steps, including 131 resets, run finished after 25 ms. (steps per millisecond=336 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:34] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:34] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000085 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9175 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:35] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:35] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:35] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 20:01:35] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 20:01:35] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:35] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:35] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-12 20:01:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:35] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:35] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-01 in 952 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-03
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:35] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10284 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1469 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :186
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:35] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:35] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:35] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 20:01:35] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:35] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:35] [INFO ] Added : 42 causal constraints over 11 iterations in 129 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Incomplete Parikh walk after 374000 steps, including 101 resets, run finished after 820 ms. (steps per millisecond=456 ) properties (out of 1) seen :1003 could not realise parikh vector
FORMULA JoinFreeModules-PT-1000-UpperBounds-03 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-03 in 1219 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:36] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10015 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :121
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:36] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:36] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-12 20:01:36] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:36] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:36] [INFO ] Added : 18 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[121]
Incomplete Parikh walk after 206300 steps, including 98 resets, run finished after 373 ms. (steps per millisecond=553 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:37] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000430 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8853 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:37] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 20:01:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:37] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:37] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:37] [INFO ] Added : 6 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 101100 steps, including 98 resets, run finished after 122 ms. (steps per millisecond=828 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:37] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:37] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:37] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-04 in 1604 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-05
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:37] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10013 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1430 ) 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 :121
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:37] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:37] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:38] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-12 20:01:38] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:38] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:38] [INFO ] Added : 42 causal constraints over 9 iterations in 147 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[121]
Incomplete Parikh walk after 147700 steps, including 98 resets, run finished after 398 ms. (steps per millisecond=371 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:38] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:38] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000327 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8852 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:39] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 20:01:39] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 101100 steps, including 98 resets, run finished after 122 ms. (steps per millisecond=828 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:39] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:39] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:39] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-05 in 1608 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-07
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:39] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10682 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1526 ) properties (out of 1) seen :500
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 :186
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:39] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:39] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:39] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-12 20:01:39] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 20:01:39] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:39] [INFO ] Added : 42 causal constraints over 11 iterations in 160 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Incomplete Parikh walk after 73600 steps, including 103 resets, run finished after 163 ms. (steps per millisecond=451 ) properties (out of 1) seen :1003 could not realise parikh vector
FORMULA JoinFreeModules-PT-1000-UpperBounds-07 1003 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-07 in 489 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:39] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10271 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1467 ) 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 :1000
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:40] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2021-05-12 20:01:40] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 20:01:40] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-12 20:01:40] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:40] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:40] [INFO ] Added : 40 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 8600 steps, including 143 resets, run finished after 26 ms. (steps per millisecond=330 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000080 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8929 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5 ms
[2021-05-12 20:01:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:40] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 3 ms. (steps per millisecond=400 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:40] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-08 in 894 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-09
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:40] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10717 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1786 ) 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 :112
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:40] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:40] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 20:01:40] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:41] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:41] [INFO ] Added : 42 causal constraints over 11 iterations in 131 ms. Result :sat
Minimization took 186 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[112]
Incomplete Parikh walk after 227500 steps, including 101 resets, run finished after 535 ms. (steps per millisecond=425 ) properties (out of 1) seen :996 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:41] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:41] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000047 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9091 ) properties (out of 1) seen :986
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 416 ms. (steps per millisecond=2403 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:42] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:42] [INFO ] Added : 6 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 333400 steps, including 101 resets, run finished after 423 ms. (steps per millisecond=788 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:42] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:42] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:42] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:42] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:42] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000102 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8929 ) properties (out of 1) seen :991
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=2409 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:43] [INFO ] Added : 6 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 332400 steps, including 102 resets, run finished after 422 ms. (steps per millisecond=787 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:43] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:43] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-12 20:01:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:43] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-09 in 2983 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:43] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10767 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1538 ) 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 :112
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:43] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:43] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:43] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 20:01:43] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 20:01:43] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:44] [INFO ] Added : 42 causal constraints over 11 iterations in 128 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[112]
Incomplete Parikh walk after 226300 steps, including 100 resets, run finished after 529 ms. (steps per millisecond=427 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:44] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:44] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:44] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000049 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :995
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:45] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 20:01:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:45] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 20:01:45] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 20:01:45] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 332400 steps, including 102 resets, run finished after 421 ms. (steps per millisecond=789 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:45] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:45] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:45] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:45] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-10 in 1940 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-12
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:45] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10117 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1686 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1000
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:45] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:45] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:45] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 20:01:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:45] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 20:01:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2021-05-12 20:01:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-12 20:01:45] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:46] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 20:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 20:01:46] [INFO ] Added : 36 causal constraints over 8 iterations in 138 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 108100 steps, including 99 resets, run finished after 224 ms. (steps per millisecond=482 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:46] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9090 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:46] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5 ms
[2021-05-12 20:01:46] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:46] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:46] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:46] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-12 20:01:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:46] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:46] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-12 in 1112 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-13
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:46] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10515 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1502 ) 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 :1000
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:46] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:46] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:46] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:47] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 20:01:47] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:47] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2021-05-12 20:01:47] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:47] [INFO ] Added : 39 causal constraints over 8 iterations in 90 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 10400 steps, including 141 resets, run finished after 30 ms. (steps per millisecond=346 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.1 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:47] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :1000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 1) seen :1000
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 20:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:47] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:47] [INFO ] Deduced a trap composed of 3 places in 4 ms of which 0 ms to minimize.
[2021-05-12 20:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 20:01:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 20:01:47] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1000]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 20:01:47] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:47] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-12 20:01:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:47] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-13 in 884 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-14
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:47] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 10141 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1448 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :121
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:47] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-12 20:01:47] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:47] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:47] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-12 20:01:47] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 20:01:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:47] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 20:01:48] [INFO ] Added : 45 causal constraints over 10 iterations in 112 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[121]
Incomplete Parikh walk after 150000 steps, including 98 resets, run finished after 409 ms. (steps per millisecond=366 ) properties (out of 1) seen :1000 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:48] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:48] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000307 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8852 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:49] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 20:01:49] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 101100 steps, including 98 resets, run finished after 121 ms. (steps per millisecond=835 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:49] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:49] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:49] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000137 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8929 ) properties (out of 1) seen :1001
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 1) seen :1001
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:49] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 20:01:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 20:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:49] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 20:01:49] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 20:01:49] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[1001]
Incomplete Parikh walk after 101100 steps, including 98 resets, run finished after 120 ms. (steps per millisecond=842 ) properties (out of 1) seen :1001 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, 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, 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
[2021-05-12 20:01:50] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:50] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:50] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:50] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-12 20:01:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:50] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:50] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-14 in 2345 ms.
Starting property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:50] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 10017 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 1) seen :500
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :186
// Phase 1: matrix 104 rows 65 cols
[2021-05-12 20:01:50] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-12 20:01:50] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:50] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 20:01:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 20:01:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2021-05-12 20:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 20:01:50] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-12 20:01:50] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 20:01:50] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 20:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 20:01:50] [INFO ] Added : 29 causal constraints over 7 iterations in 99 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : [1003] Max seen :[500]
Incomplete Parikh walk after 1292800 steps, including 102 resets, run finished after 2726 ms. (steps per millisecond=474 ) properties (out of 1) seen :997 could not realise parikh vector
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 5 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 96 output transitions
Drop transitions removed 96 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /65 variables (removed 60) and now considering 8/104 (removed 96) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 20:01:53] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/65 places, 8/104 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 20:01:53] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000173 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=8930 ) properties (out of 1) seen :1003
FORMULA JoinFreeModules-PT-1000-UpperBounds-15 1003 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-1000-UpperBounds-15 in 3166 ms.
[2021-05-12 20:01:53] [INFO ] Flatten gal took : 31 ms
[2021-05-12 20:01:53] [INFO ] Applying decomposition
[2021-05-12 20:01:53] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5943150664575664056.txt, -o, /tmp/graph5943150664575664056.bin, -w, /tmp/graph5943150664575664056.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5943150664575664056.bin, -l, -1, -v, -w, /tmp/graph5943150664575664056.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 20:01:53] [INFO ] Decomposing Gal with order
[2021-05-12 20:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 20:01:53] [INFO ] Flatten gal took : 7 ms
[2021-05-12 20:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 20:01:53] [INFO ] Time to serialize gal into /tmp/UpperBounds11992027236034303760.gal : 3 ms
[2021-05-12 20:01:53] [INFO ] Time to serialize properties into /tmp/UpperBounds12223315709135386761.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11992027236034303760.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12223315709135386761.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11992027236034303760.gal -t CGAL -reachable-file /tmp/UpperBounds12223315709135386761.prop --nowitness
Loading property file /tmp/UpperBounds12223315709135386761.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.51742e+138,1217.63,7454848,15,7019,43,7.89631e+06,55,0,65,9.39558e+06,0
Total reachable state count : 1.517415354667586716497277144290710959349e+138

Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-00 :0 <= u3.p824 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-00 1002 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-00,0,1218.23,7454848,1,0,80,7.89631e+06,133,14,1080,9.39558e+06,158
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-01 :0 <= u1.p683 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-01 1000 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-01,0,1225.32,7454848,1,0,95,7.89631e+06,155,14,2088,9.39558e+06,185
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-04 :0 <= u0.p187 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-04 1001 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-04,0,1240.37,7454848,1,0,109,7.89631e+06,172,14,3100,9.39558e+06,211
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-05 :0 <= u8.p2992 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-05 1001 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-05,0,1240.37,7454848,1,0,115,7.89631e+06,200,14,3100,9.39558e+06,232
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-08 :0 <= u2.p768 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-08 1000 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-08,0,1240.37,7454848,1,0,127,7.89631e+06,217,14,3100,9.39558e+06,255
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-09 :0 <= u9.p3289 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-09 1002 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-09,0,1240.37,7454848,1,0,132,7.89631e+06,242,14,3100,9.39558e+06,266
Min sum of variable value : 0
Maximum sum along a path : 1002
Bounds property JoinFreeModules-PT-1000-UpperBounds-10 :0 <= u6.p2589 <= 1002
FORMULA JoinFreeModules-PT-1000-UpperBounds-10 1002 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-10,0,1240.37,7454848,1,0,140,7.89631e+06,263,14,3100,9.39558e+06,281
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-12 :0 <= u10.p3903 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-12 1000 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-12,0,1240.37,7454848,1,0,144,7.89631e+06,289,14,3100,9.39558e+06,290
Min sum of variable value : 0
Maximum sum along a path : 1000
Bounds property JoinFreeModules-PT-1000-UpperBounds-13 :0 <= u12.p4923 <= 1000
FORMULA JoinFreeModules-PT-1000-UpperBounds-13 1000 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-13,0,1240.37,7454848,1,0,146,7.89631e+06,316,14,3100,9.39558e+06,297
Min sum of variable value : 0
Maximum sum along a path : 1001
Bounds property JoinFreeModules-PT-1000-UpperBounds-14 :0 <= u11.p4462 <= 1001
FORMULA JoinFreeModules-PT-1000-UpperBounds-14 1001 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-1000-UpperBounds-14,0,1240.37,7454848,1,0,149,7.89631e+06,342,14,3100,9.39558e+06,302
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620850955677

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-1000, 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 r121-tall-162075407000459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-1000.tgz
mv JoinFreeModules-PT-1000 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;