fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821400837
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S32C07

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16216.592 3600000.00 3520605.00 162080.40 1 ? 1 1 0 1 1 ? 1 0 1 1 1 1 ? 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 14K Apr 29 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 29 16:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 16:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 26M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652882268947

Running Version 202205111006
[2022-05-18 13:57:50] [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]
[2022-05-18 13:57:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 13:57:51] [INFO ] Load time of PNML (sax parser for PT used): 1259 ms
[2022-05-18 13:57:51] [INFO ] Transformed 25134 places.
[2022-05-18 13:57:51] [INFO ] Transformed 38317 transitions.
[2022-05-18 13:57:51] [INFO ] Parsed PT model containing 25134 places and 38317 transitions in 1512 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Normalized transition count is 37261 out of 38317 initially.
// Phase 1: matrix 37261 rows 25134 cols
[2022-05-18 13:57:57] [INFO ] Computed 1683 place invariants in 5281 ms
Incomplete random walk after 10000 steps, including 139 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :1
[2022-05-18 13:57:59] [INFO ] Flow matrix only has 37261 transitions (discarded 1056 similar events)
// Phase 1: matrix 37261 rows 25134 cols
[2022-05-18 13:58:04] [INFO ] Computed 1683 place invariants in 4660 ms
[2022-05-18 13:58:09] [INFO ] [Real]Absence check using 84 positive place invariants in 1004 ms returned unknown
[2022-05-18 13:58:13] [INFO ] [Real]Absence check using 84 positive place invariants in 1220 ms returned sat
[2022-05-18 13:58:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:14] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 550 ms returned unknown
[2022-05-18 13:58:18] [INFO ] [Real]Absence check using 84 positive place invariants in 1126 ms returned sat
[2022-05-18 13:58:19] [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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2349)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 13:58:23] [INFO ] [Real]Absence check using 84 positive place invariants in 1192 ms returned sat
[2022-05-18 13:58:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:24] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 554 ms returned unknown
[2022-05-18 13:58:28] [INFO ] [Real]Absence check using 84 positive place invariants in 1202 ms returned sat
[2022-05-18 13:58:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:29] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 589 ms returned unknown
[2022-05-18 13:58:33] [INFO ] [Real]Absence check using 84 positive place invariants in 1157 ms returned sat
[2022-05-18 13:58:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:34] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 640 ms returned unknown
[2022-05-18 13:58:38] [INFO ] [Real]Absence check using 84 positive place invariants in 1122 ms returned sat
[2022-05-18 13:58:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:39] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 886 ms returned unknown
[2022-05-18 13:58:43] [INFO ] [Real]Absence check using 84 positive place invariants in 1170 ms returned sat
[2022-05-18 13:58:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:44] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 666 ms returned unknown
[2022-05-18 13:58:48] [INFO ] [Real]Absence check using 84 positive place invariants in 1180 ms returned sat
[2022-05-18 13:58:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:49] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 700 ms returned unknown
[2022-05-18 13:58:53] [INFO ] [Real]Absence check using 84 positive place invariants in 1133 ms returned sat
[2022-05-18 13:58:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:54] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 705 ms returned unknown
[2022-05-18 13:58:58] [INFO ] [Real]Absence check using 84 positive place invariants in 1143 ms returned sat
[2022-05-18 13:58:59] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:58:59] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 673 ms returned unknown
[2022-05-18 13:59:03] [INFO ] [Real]Absence check using 84 positive place invariants in 1175 ms returned sat
[2022-05-18 13:59:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:59:04] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 633 ms returned unknown
[2022-05-18 13:59:08] [INFO ] [Real]Absence check using 84 positive place invariants in 1110 ms returned sat
[2022-05-18 13:59:09] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 755 ms returned unknown
[2022-05-18 13:59:13] [INFO ] [Real]Absence check using 84 positive place invariants in 1137 ms returned sat
[2022-05-18 13:59:14] [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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.assertInvariants(DeadlockTester.java:2349)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:888)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-18 13:59:18] [INFO ] [Real]Absence check using 84 positive place invariants in 1191 ms returned sat
[2022-05-18 13:59:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:59:19] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 552 ms returned unknown
[2022-05-18 13:59:23] [INFO ] [Real]Absence check using 84 positive place invariants in 1138 ms returned sat
[2022-05-18 13:59:24] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 13:59:24] [INFO ] [Real]Absence check using 84 positive and 1599 generalized place invariants in 801 ms returned unknown
Current structural bounds on expressions (after SMT) : [99, 1, 33, 99, 1, 33, 99, 1, 33, 1, 99, 33, 33, 99, 1, 33] Max seen :[1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1]
Support contains 16 out of 25134 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 25134/25134 places, 38317/38317 transitions.
Graph (complete) has 85919 edges and 25134 vertex of which 25084 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.70 ms
Discarding 50 places :
Also discarding 0 output transitions
Drop transitions removed 7385 transitions
Trivial Post-agglo rules discarded 7385 transitions
Performed 7385 trivial Post agglomeration. Transition count delta: 7385
Iterating post reduction 0 with 7385 rules applied. Total rules applied 7386 place count 25084 transition count 30932
Reduce places removed 7385 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 7390 rules applied. Total rules applied 14776 place count 17699 transition count 30927
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 14781 place count 17694 transition count 30927
Performed 462 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 462 Pre rules applied. Total rules applied 14781 place count 17694 transition count 30465
Deduced a syphon composed of 462 places in 42 ms
Reduce places removed 462 places and 0 transitions.
Iterating global reduction 3 with 924 rules applied. Total rules applied 15705 place count 17232 transition count 30465
Discarding 6923 places :
Symmetric choice reduction at 3 with 6923 rule applications. Total rules 22628 place count 10309 transition count 23542
Iterating global reduction 3 with 6923 rules applied. Total rules applied 29551 place count 10309 transition count 23542
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 29551 place count 10309 transition count 23533
Deduced a syphon composed of 9 places in 30 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 29569 place count 10300 transition count 23533
Discarding 982 places :
Symmetric choice reduction at 3 with 982 rule applications. Total rules 30551 place count 9318 transition count 16659
Iterating global reduction 3 with 982 rules applied. Total rules applied 31533 place count 9318 transition count 16659
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 30 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 31599 place count 9285 transition count 16626
Free-agglomeration rule (complex) applied 578 times.
Iterating global reduction 3 with 578 rules applied. Total rules applied 32177 place count 9285 transition count 21670
Reduce places removed 578 places and 0 transitions.
Iterating post reduction 3 with 578 rules applied. Total rules applied 32755 place count 8707 transition count 21670
Partial Free-agglomeration rule applied 165 times.
Drop transitions removed 165 transitions
Iterating global reduction 4 with 165 rules applied. Total rules applied 32920 place count 8707 transition count 21670
Applied a total of 32920 rules in 18042 ms. Remains 8707 /25134 variables (removed 16427) and now considering 21670/38317 (removed 16647) transitions.
Finished structural reductions, in 1 iterations. Remains : 8707/25134 places, 21670/38317 transitions.
Normalized transition count is 20106 out of 21670 initially.
// Phase 1: matrix 20106 rows 8707 cols
[2022-05-18 13:59:43] [INFO ] Computed 1633 place invariants in 1042 ms
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Interrupted random walk after 383329 steps, including 8791 resets, run timeout after 30001 ms. (steps per millisecond=12 ) properties seen 5
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 592171 steps, including 1296 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 3
Interrupted Best-First random walk after 557169 steps, including 1220 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen 0
Interrupted Best-First random walk after 569323 steps, including 1246 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen 3
Interrupted Best-First random walk after 563917 steps, including 1234 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 3
Interrupted Best-First random walk after 573929 steps, including 1256 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 2
Interrupted Best-First random walk after 574308 steps, including 1257 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen 3
Interrupted Best-First random walk after 561738 steps, including 1230 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 3
Interrupted Best-First random walk after 566504 steps, including 1240 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen 3
Interrupted Best-First random walk after 564692 steps, including 1236 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 2
Interrupted Best-First random walk after 561453 steps, including 1229 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen 1
Interrupted Best-First random walk after 554442 steps, including 1214 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen 4
[2022-05-18 14:01:08] [INFO ] Flow matrix only has 20106 transitions (discarded 1564 similar events)
// Phase 1: matrix 20106 rows 8707 cols
[2022-05-18 14:01:09] [INFO ] Computed 1633 place invariants in 992 ms
[2022-05-18 14:01:10] [INFO ] [Real]Absence check using 65 positive place invariants in 237 ms returned sat
[2022-05-18 14:01:11] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 292 ms returned unsat
[2022-05-18 14:01:12] [INFO ] [Real]Absence check using 65 positive place invariants in 196 ms returned sat
[2022-05-18 14:01:12] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 565 ms returned sat
[2022-05-18 14:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:01:30] [INFO ] [Real]Absence check using state equation in 17706 ms returned sat
[2022-05-18 14:01:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:01:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 196 ms returned sat
[2022-05-18 14:01:32] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 618 ms returned sat
[2022-05-18 14:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:01:49] [INFO ] [Nat]Absence check using state equation in 16778 ms returned sat
[2022-05-18 14:01:49] [INFO ] State equation strengthened by 12052 read => feed constraints.
[2022-05-18 14:01:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:01:56] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6648 ms returned unknown
[2022-05-18 14:01:57] [INFO ] [Real]Absence check using 65 positive place invariants in 209 ms returned sat
[2022-05-18 14:01:58] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 599 ms returned sat
[2022-05-18 14:01:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:02:12] [INFO ] [Real]Absence check using state equation in 14459 ms returned sat
[2022-05-18 14:02:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:02:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 193 ms returned sat
[2022-05-18 14:02:14] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 558 ms returned sat
[2022-05-18 14:02:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:02:29] [INFO ] [Nat]Absence check using state equation in 14623 ms returned sat
[2022-05-18 14:02:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:02:36] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6708 ms returned unknown
[2022-05-18 14:02:37] [INFO ] [Real]Absence check using 65 positive place invariants in 205 ms returned sat
[2022-05-18 14:02:37] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 557 ms returned sat
[2022-05-18 14:02:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:02:52] [INFO ] [Real]Absence check using state equation in 14231 ms returned sat
[2022-05-18 14:02:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:02:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 236 ms returned sat
[2022-05-18 14:02:54] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 588 ms returned sat
[2022-05-18 14:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:03:08] [INFO ] [Nat]Absence check using state equation in 14853 ms returned sat
[2022-05-18 14:03:12] [INFO ] [Nat]Added 12052 Read/Feed constraints in 3279 ms returned unsat
[2022-05-18 14:03:13] [INFO ] [Real]Absence check using 65 positive place invariants in 187 ms returned sat
[2022-05-18 14:03:13] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 555 ms returned sat
[2022-05-18 14:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:03:32] [INFO ] [Real]Absence check using state equation in 18520 ms returned sat
[2022-05-18 14:03:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:03:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 182 ms returned sat
[2022-05-18 14:03:34] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 555 ms returned sat
[2022-05-18 14:03:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:03:46] [INFO ] [Nat]Absence check using state equation in 12632 ms returned sat
[2022-05-18 14:03:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:03:53] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6613 ms returned unknown
[2022-05-18 14:03:54] [INFO ] [Real]Absence check using 65 positive place invariants in 185 ms returned sat
[2022-05-18 14:03:54] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 354 ms returned unsat
[2022-05-18 14:03:55] [INFO ] [Real]Absence check using 65 positive place invariants in 194 ms returned sat
[2022-05-18 14:03:56] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 541 ms returned sat
[2022-05-18 14:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:04:09] [INFO ] [Real]Absence check using state equation in 13483 ms returned sat
[2022-05-18 14:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:04:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 213 ms returned sat
[2022-05-18 14:04:11] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 562 ms returned sat
[2022-05-18 14:04:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:04:28] [INFO ] [Nat]Absence check using state equation in 16998 ms returned sat
[2022-05-18 14:04:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:04:35] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6680 ms returned unknown
[2022-05-18 14:04:36] [INFO ] [Real]Absence check using 65 positive place invariants in 206 ms returned sat
[2022-05-18 14:04:37] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 599 ms returned sat
[2022-05-18 14:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:04:51] [INFO ] [Real]Absence check using state equation in 14534 ms returned sat
[2022-05-18 14:04:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:04:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 203 ms returned sat
[2022-05-18 14:04:53] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 573 ms returned sat
[2022-05-18 14:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:05:10] [INFO ] [Nat]Absence check using state equation in 16406 ms returned sat
[2022-05-18 14:05:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:05:16] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6649 ms returned unknown
[2022-05-18 14:05:17] [INFO ] [Real]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 14:05:17] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 31 ms returned unsat
[2022-05-18 14:05:18] [INFO ] [Real]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 14:05:18] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 254 ms returned unsat
[2022-05-18 14:05:19] [INFO ] [Real]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 14:05:20] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 607 ms returned sat
[2022-05-18 14:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:05:35] [INFO ] [Real]Absence check using state equation in 14522 ms returned sat
[2022-05-18 14:05:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:05:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 206 ms returned sat
[2022-05-18 14:05:37] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 551 ms returned sat
[2022-05-18 14:05:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:05:53] [INFO ] [Nat]Absence check using state equation in 16449 ms returned sat
[2022-05-18 14:05:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:06:00] [INFO ] [Nat]Added 12052 Read/Feed constraints in 6652 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 8707 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8707/8707 places, 21670/21670 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8707 transition count 21669
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8706 transition count 21669
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 8706 transition count 21929
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 22 place count 8696 transition count 21929
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 8691 transition count 21924
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 8691 transition count 21924
Applied a total of 32 rules in 5225 ms. Remains 8691 /8707 variables (removed 16) and now considering 21924/21670 (removed -254) transitions.
Finished structural reductions, in 1 iterations. Remains : 8691/8707 places, 21924/21670 transitions.
Normalized transition count is 20358 out of 21924 initially.
// Phase 1: matrix 20358 rows 8691 cols
[2022-05-18 14:06:06] [INFO ] Computed 1633 place invariants in 937 ms
Interrupted random walk after 411189 steps, including 9504 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 1
Interrupted Best-First random walk after 596218 steps, including 1306 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 595586 steps, including 1305 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Interrupted Best-First random walk after 604554 steps, including 1324 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 0
Interrupted Best-First random walk after 601957 steps, including 1319 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 0
Interrupted Best-First random walk after 601991 steps, including 1319 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 0
Interrupted Best-First random walk after 598075 steps, including 1310 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
[2022-05-18 14:07:06] [INFO ] Flow matrix only has 20358 transitions (discarded 1566 similar events)
// Phase 1: matrix 20358 rows 8691 cols
[2022-05-18 14:07:07] [INFO ] Computed 1633 place invariants in 957 ms
[2022-05-18 14:07:08] [INFO ] [Real]Absence check using 65 positive place invariants in 206 ms returned sat
[2022-05-18 14:07:08] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 527 ms returned sat
[2022-05-18 14:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:07:26] [INFO ] [Real]Absence check using state equation in 17562 ms returned sat
[2022-05-18 14:07:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:07:27] [INFO ] [Nat]Absence check using 65 positive place invariants in 210 ms returned sat
[2022-05-18 14:07:28] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 557 ms returned sat
[2022-05-18 14:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:07:47] [INFO ] [Nat]Absence check using state equation in 19261 ms returned sat
[2022-05-18 14:07:47] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:07:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:07:54] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6860 ms returned unknown
[2022-05-18 14:07:55] [INFO ] [Real]Absence check using 65 positive place invariants in 202 ms returned sat
[2022-05-18 14:07:55] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 179 ms returned unsat
[2022-05-18 14:07:56] [INFO ] [Real]Absence check using 65 positive place invariants in 198 ms returned sat
[2022-05-18 14:07:57] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 557 ms returned sat
[2022-05-18 14:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:08:15] [INFO ] [Real]Absence check using state equation in 17756 ms returned sat
[2022-05-18 14:08:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:08:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 192 ms returned sat
[2022-05-18 14:08:17] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 587 ms returned sat
[2022-05-18 14:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:08:36] [INFO ] [Nat]Absence check using state equation in 19272 ms returned sat
[2022-05-18 14:08:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:08:42] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6026 ms returned sat
[2022-05-18 14:08:45] [INFO ] Computed and/alt/rep : 10925/15887/10925 causal constraints (skipped 9400 transitions) in 1875 ms.
[2022-05-18 14:08:49] [INFO ] Added : 8 causal constraints over 2 iterations in 6276 ms. Result :sat
[2022-05-18 14:08:51] [INFO ] [Real]Absence check using 65 positive place invariants in 216 ms returned sat
[2022-05-18 14:08:52] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 577 ms returned sat
[2022-05-18 14:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:09:10] [INFO ] [Real]Absence check using state equation in 18009 ms returned sat
[2022-05-18 14:09:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:09:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 205 ms returned sat
[2022-05-18 14:09:12] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 617 ms returned sat
[2022-05-18 14:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:09:30] [INFO ] [Nat]Absence check using state equation in 18587 ms returned sat
[2022-05-18 14:09:34] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:09:37] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6662 ms returned unknown
[2022-05-18 14:09:38] [INFO ] [Real]Absence check using 65 positive place invariants in 195 ms returned sat
[2022-05-18 14:09:38] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 573 ms returned sat
[2022-05-18 14:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:09:54] [INFO ] [Real]Absence check using state equation in 16031 ms returned sat
[2022-05-18 14:09:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:09:56] [INFO ] [Nat]Absence check using 65 positive place invariants in 202 ms returned sat
[2022-05-18 14:09:56] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 562 ms returned sat
[2022-05-18 14:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:10:13] [INFO ] [Nat]Absence check using state equation in 16252 ms returned sat
[2022-05-18 14:10:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:10:18] [INFO ] [Nat]Added 12322 Read/Feed constraints in 5233 ms returned unsat
[2022-05-18 14:10:19] [INFO ] [Real]Absence check using 65 positive place invariants in 200 ms returned sat
[2022-05-18 14:10:19] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 522 ms returned sat
[2022-05-18 14:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:10:32] [INFO ] [Real]Absence check using state equation in 12988 ms returned sat
[2022-05-18 14:10:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:10:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 201 ms returned sat
[2022-05-18 14:10:34] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 521 ms returned sat
[2022-05-18 14:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:10:51] [INFO ] [Nat]Absence check using state equation in 17103 ms returned sat
[2022-05-18 14:10:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:10:58] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6665 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 0, 1] Max seen :[0, 1, 0, 0, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 8691 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8691/8691 places, 21924/21924 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8691 transition count 21924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 8690 transition count 21923
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 8690 transition count 21923
Applied a total of 3 rules in 3782 ms. Remains 8690 /8691 variables (removed 1) and now considering 21923/21924 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 8690/8691 places, 21923/21924 transitions.
Normalized transition count is 20357 out of 21923 initially.
// Phase 1: matrix 20357 rows 8690 cols
[2022-05-18 14:11:03] [INFO ] Computed 1633 place invariants in 981 ms
Interrupted random walk after 408327 steps, including 9439 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 1
FORMULA MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 609251 steps, including 1335 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 609113 steps, including 1334 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 606118 steps, including 1328 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
[2022-05-18 14:11:48] [INFO ] Flow matrix only has 20357 transitions (discarded 1566 similar events)
// Phase 1: matrix 20357 rows 8690 cols
[2022-05-18 14:11:49] [INFO ] Computed 1633 place invariants in 967 ms
[2022-05-18 14:11:50] [INFO ] [Real]Absence check using 65 positive place invariants in 216 ms returned sat
[2022-05-18 14:11:51] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 522 ms returned sat
[2022-05-18 14:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:12:06] [INFO ] [Real]Absence check using state equation in 15472 ms returned sat
[2022-05-18 14:12:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:12:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 203 ms returned sat
[2022-05-18 14:12:08] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 514 ms returned sat
[2022-05-18 14:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:12:24] [INFO ] [Nat]Absence check using state equation in 15635 ms returned sat
[2022-05-18 14:12:24] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:12:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:12:31] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6813 ms returned unknown
[2022-05-18 14:12:32] [INFO ] [Real]Absence check using 65 positive place invariants in 220 ms returned sat
[2022-05-18 14:12:32] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 531 ms returned sat
[2022-05-18 14:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:12:49] [INFO ] [Real]Absence check using state equation in 17104 ms returned sat
[2022-05-18 14:12:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:12:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 218 ms returned sat
[2022-05-18 14:12:51] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 516 ms returned sat
[2022-05-18 14:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:13:09] [INFO ] [Nat]Absence check using state equation in 17117 ms returned sat
[2022-05-18 14:13:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:13:15] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6675 ms returned unknown
[2022-05-18 14:13:16] [INFO ] [Real]Absence check using 65 positive place invariants in 222 ms returned sat
[2022-05-18 14:13:17] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 540 ms returned sat
[2022-05-18 14:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:13:34] [INFO ] [Real]Absence check using state equation in 17589 ms returned sat
[2022-05-18 14:13:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:13:36] [INFO ] [Nat]Absence check using 65 positive place invariants in 229 ms returned sat
[2022-05-18 14:13:36] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 536 ms returned sat
[2022-05-18 14:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:13:54] [INFO ] [Nat]Absence check using state equation in 17769 ms returned sat
[2022-05-18 14:13:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:14:01] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6673 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 8690 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8690/8690 places, 21923/21923 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8690 transition count 21922
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8689 transition count 21922
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 8689 transition count 21921
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 8688 transition count 21921
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 5 place count 8687 transition count 21920
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 8687 transition count 21920
Applied a total of 6 rules in 3793 ms. Remains 8687 /8690 variables (removed 3) and now considering 21920/21923 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8690 places, 21920/21923 transitions.
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:14:06] [INFO ] Computed 1633 place invariants in 939 ms
Interrupted random walk after 407770 steps, including 9426 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 603710 steps, including 1323 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 0
Interrupted Best-First random walk after 605405 steps, including 1326 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
Interrupted Best-First random walk after 605767 steps, including 1327 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen 0
[2022-05-18 14:14:51] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:14:52] [INFO ] Computed 1633 place invariants in 964 ms
[2022-05-18 14:14:53] [INFO ] [Real]Absence check using 65 positive place invariants in 225 ms returned sat
[2022-05-18 14:14:53] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 547 ms returned sat
[2022-05-18 14:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:15:08] [INFO ] [Real]Absence check using state equation in 15261 ms returned sat
[2022-05-18 14:15:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:15:10] [INFO ] [Nat]Absence check using 65 positive place invariants in 224 ms returned sat
[2022-05-18 14:15:10] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 563 ms returned sat
[2022-05-18 14:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:15:29] [INFO ] [Nat]Absence check using state equation in 18711 ms returned sat
[2022-05-18 14:15:29] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:15:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:15:36] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6794 ms returned unknown
[2022-05-18 14:15:37] [INFO ] [Real]Absence check using 65 positive place invariants in 231 ms returned sat
[2022-05-18 14:15:38] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 545 ms returned sat
[2022-05-18 14:15:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:15:55] [INFO ] [Real]Absence check using state equation in 17543 ms returned sat
[2022-05-18 14:15:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:15:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 224 ms returned sat
[2022-05-18 14:15:57] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 514 ms returned sat
[2022-05-18 14:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:16:18] [INFO ] [Nat]Absence check using state equation in 21361 ms returned sat
[2022-05-18 14:16:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:16:25] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6698 ms returned unknown
[2022-05-18 14:16:26] [INFO ] [Real]Absence check using 65 positive place invariants in 231 ms returned sat
[2022-05-18 14:16:27] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 517 ms returned sat
[2022-05-18 14:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:16:43] [INFO ] [Real]Absence check using state equation in 16169 ms returned sat
[2022-05-18 14:16:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:16:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 226 ms returned sat
[2022-05-18 14:16:45] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 569 ms returned sat
[2022-05-18 14:16:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:17:03] [INFO ] [Nat]Absence check using state equation in 18026 ms returned sat
[2022-05-18 14:17:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:17:10] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6762 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1259 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1390 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
[2022-05-18 14:17:12] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:17:13] [INFO ] Computed 1633 place invariants in 993 ms
[2022-05-18 14:17:14] [INFO ] Implicit Places using invariants in 1801 ms returned []
Implicit Place search using SMT only with invariants took 1810 ms to find 0 implicit places.
[2022-05-18 14:17:14] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:17:15] [INFO ] Computed 1633 place invariants in 990 ms
[2022-05-18 14:17:16] [INFO ] Dead Transitions using invariants and state equation in 1817 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-01
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:17:17] [INFO ] Computed 1633 place invariants in 993 ms
Incomplete random walk after 10000 steps, including 231 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
[2022-05-18 14:17:18] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:17:19] [INFO ] Computed 1633 place invariants in 940 ms
[2022-05-18 14:17:20] [INFO ] [Real]Absence check using 65 positive place invariants in 220 ms returned sat
[2022-05-18 14:17:20] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 620 ms returned sat
[2022-05-18 14:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:17:24] [INFO ] [Real]Absence check using state equation in 3392 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1400 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:17:26] [INFO ] Computed 1633 place invariants in 1050 ms
Interrupted random walk after 403315 steps, including 9323 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 599686 steps, including 1314 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
[2022-05-18 14:18:01] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:18:02] [INFO ] Computed 1633 place invariants in 1008 ms
[2022-05-18 14:18:03] [INFO ] [Real]Absence check using 65 positive place invariants in 219 ms returned sat
[2022-05-18 14:18:04] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 576 ms returned sat
[2022-05-18 14:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:18:19] [INFO ] [Real]Absence check using state equation in 15318 ms returned sat
[2022-05-18 14:18:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:18:21] [INFO ] [Nat]Absence check using 65 positive place invariants in 229 ms returned sat
[2022-05-18 14:18:21] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 563 ms returned sat
[2022-05-18 14:18:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:18:46] [INFO ] [Nat]Absence check using state equation in 24192 ms returned sat
[2022-05-18 14:18:46] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:18:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:18:52] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6760 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1326 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1335 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
[2022-05-18 14:18:55] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:18:56] [INFO ] Computed 1633 place invariants in 955 ms
[2022-05-18 14:18:57] [INFO ] Implicit Places using invariants in 1735 ms returned []
Implicit Place search using SMT only with invariants took 1751 ms to find 0 implicit places.
[2022-05-18 14:18:57] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:18:58] [INFO ] Computed 1633 place invariants in 949 ms
[2022-05-18 14:18:59] [INFO ] Dead Transitions using invariants and state equation in 1737 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-01 in 102662 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-07
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:19:00] [INFO ] Computed 1633 place invariants in 983 ms
Incomplete random walk after 10000 steps, including 231 resets, run finished after 760 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
[2022-05-18 14:19:01] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:19:01] [INFO ] Computed 1633 place invariants in 942 ms
[2022-05-18 14:19:03] [INFO ] [Real]Absence check using 65 positive place invariants in 225 ms returned sat
[2022-05-18 14:19:03] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 563 ms returned sat
[2022-05-18 14:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:19:07] [INFO ] [Real]Absence check using state equation in 3399 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1394 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:19:09] [INFO ] Computed 1633 place invariants in 986 ms
Interrupted random walk after 403445 steps, including 9326 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 584167 steps, including 1280 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen 0
[2022-05-18 14:19:44] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:19:45] [INFO ] Computed 1633 place invariants in 943 ms
[2022-05-18 14:19:46] [INFO ] [Real]Absence check using 65 positive place invariants in 224 ms returned sat
[2022-05-18 14:19:46] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 548 ms returned sat
[2022-05-18 14:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:20:04] [INFO ] [Real]Absence check using state equation in 17126 ms returned sat
[2022-05-18 14:20:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:20:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 222 ms returned sat
[2022-05-18 14:20:06] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 534 ms returned sat
[2022-05-18 14:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:20:27] [INFO ] [Nat]Absence check using state equation in 21829 ms returned sat
[2022-05-18 14:20:28] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:20:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:20:34] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6722 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1336 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1336 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
[2022-05-18 14:20:37] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:20:38] [INFO ] Computed 1633 place invariants in 965 ms
[2022-05-18 14:20:39] [INFO ] Implicit Places using invariants in 1734 ms returned []
Implicit Place search using SMT only with invariants took 1753 ms to find 0 implicit places.
[2022-05-18 14:20:39] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:20:40] [INFO ] Computed 1633 place invariants in 969 ms
[2022-05-18 14:20:40] [INFO ] Dead Transitions using invariants and state equation in 1758 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-07 in 101807 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-14
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:20:41] [INFO ] Computed 1633 place invariants in 988 ms
Incomplete random walk after 10000 steps, including 231 resets, run finished after 745 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
[2022-05-18 14:20:42] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:20:43] [INFO ] Computed 1633 place invariants in 942 ms
[2022-05-18 14:20:44] [INFO ] [Real]Absence check using 65 positive place invariants in 224 ms returned sat
[2022-05-18 14:20:45] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 530 ms returned sat
[2022-05-18 14:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:20:48] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1287 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Normalized transition count is 20354 out of 21920 initially.
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:20:51] [INFO ] Computed 1633 place invariants in 942 ms
Interrupted random walk after 404599 steps, including 9351 resets, run timeout after 30001 ms. (steps per millisecond=13 ) properties seen 0
Interrupted Best-First random walk after 597853 steps, including 1310 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
[2022-05-18 14:21:26] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:21:27] [INFO ] Computed 1633 place invariants in 944 ms
[2022-05-18 14:21:28] [INFO ] [Real]Absence check using 65 positive place invariants in 221 ms returned sat
[2022-05-18 14:21:28] [INFO ] [Real]Absence check using 65 positive and 1568 generalized place invariants in 554 ms returned sat
[2022-05-18 14:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 14:21:44] [INFO ] [Real]Absence check using state equation in 16015 ms returned sat
[2022-05-18 14:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 14:21:46] [INFO ] [Nat]Absence check using 65 positive place invariants in 229 ms returned sat
[2022-05-18 14:21:46] [INFO ] [Nat]Absence check using 65 positive and 1568 generalized place invariants in 623 ms returned sat
[2022-05-18 14:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 14:22:03] [INFO ] [Nat]Absence check using state equation in 16353 ms returned sat
[2022-05-18 14:22:03] [INFO ] State equation strengthened by 12322 read => feed constraints.
[2022-05-18 14:22:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 14:22:09] [INFO ] [Nat]Added 12322 Read/Feed constraints in 6676 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 8687 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1313 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 8687/8687 places, 21920/21920 transitions.
Applied a total of 0 rules in 1296 ms. Remains 8687 /8687 variables (removed 0) and now considering 21920/21920 (removed 0) transitions.
[2022-05-18 14:22:12] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:22:13] [INFO ] Computed 1633 place invariants in 1009 ms
[2022-05-18 14:22:14] [INFO ] Implicit Places using invariants in 1778 ms returned []
Implicit Place search using SMT only with invariants took 1791 ms to find 0 implicit places.
[2022-05-18 14:22:14] [INFO ] Flow matrix only has 20354 transitions (discarded 1566 similar events)
// Phase 1: matrix 20354 rows 8687 cols
[2022-05-18 14:22:15] [INFO ] Computed 1633 place invariants in 965 ms
[2022-05-18 14:22:16] [INFO ] Dead Transitions using invariants and state equation in 1733 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8687/8687 places, 21920/21920 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S32C07-UpperBounds-14 in 95091 ms.
[2022-05-18 14:22:18] [INFO ] Flatten gal took : 1576 ms
[2022-05-18 14:22:19] [INFO ] Applying decomposition
[2022-05-18 14:22:20] [INFO ] Flatten gal took : 909 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12967859746954939556.txt' '-o' '/tmp/graph12967859746954939556.bin' '-w' '/tmp/graph12967859746954939556.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12967859746954939556.bin' '-l' '-1' '-v' '-w' '/tmp/graph12967859746954939556.weights' '-q' '0' '-e' '0.001'
[2022-05-18 14:22:23] [INFO ] Decomposing Gal with order
[2022-05-18 14:22:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 14:22:35] [INFO ] Removed a total of 43334 redundant transitions.
[2022-05-18 14:22:36] [INFO ] Flatten gal took : 10620 ms
[2022-05-18 14:22:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 16029 labels/synchronizations in 3193 ms.
[2022-05-18 14:22:42] [INFO ] Time to serialize gal into /tmp/UpperBounds827343048341387930.gal : 441 ms
[2022-05-18 14:22:42] [INFO ] Time to serialize properties into /tmp/UpperBounds5646093622206410590.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds827343048341387930.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5646093622206410590.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...273
Loading property file /tmp/UpperBounds5646093622206410590.prop.
ITS-tools command line returned an error code 137
[2022-05-18 14:37:06] [INFO ] Flatten gal took : 6565 ms
[2022-05-18 14:37:07] [INFO ] Time to serialize gal into /tmp/UpperBounds2828974171883184212.gal : 591 ms
[2022-05-18 14:37:07] [INFO ] Time to serialize properties into /tmp/UpperBounds16179472300820685671.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2828974171883184212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16179472300820685671.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds16179472300820685671.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S32C07"
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 MultiCrashLeafsetExtension-PT-S32C07, 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 r132-tall-165271821400837"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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