About the Execution of 2022-gold for MultiCrashLeafsetExtension-PT-S24C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.220 | 3600000.00 | 2626039.00 | 543895.00 | 1 1 1 1 1 1 ? ? 1 1 1 1 1 1 0 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440400104.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is MultiCrashLeafsetExtension-PT-S24C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400104
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 15K Feb 26 03:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 26 03:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 03:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678759499402
Running Version 202205111006
[2023-03-14 02:05:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 02:05:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:05:01] [INFO ] Load time of PNML (sax parser for PT used): 674 ms
[2023-03-14 02:05:01] [INFO ] Transformed 11106 places.
[2023-03-14 02:05:01] [INFO ] Transformed 16561 transitions.
[2023-03-14 02:05:01] [INFO ] Parsed PT model containing 11106 places and 16561 transitions in 862 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 15961 out of 16561 initially.
// Phase 1: matrix 15961 rows 11106 cols
[2023-03-14 02:05:02] [INFO ] Computed 975 place invariants in 1076 ms
Incomplete random walk after 10000 steps, including 194 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :2
[2023-03-14 02:05:03] [INFO ] Flow matrix only has 15961 transitions (discarded 600 similar events)
// Phase 1: matrix 15961 rows 11106 cols
[2023-03-14 02:05:04] [INFO ] Computed 975 place invariants in 835 ms
[2023-03-14 02:05:06] [INFO ] [Real]Absence check using 64 positive place invariants in 187 ms returned sat
[2023-03-14 02:05:06] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 284 ms returned unsat
[2023-03-14 02:05:07] [INFO ] [Real]Absence check using 64 positive place invariants in 185 ms returned sat
[2023-03-14 02:05:08] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 479 ms returned sat
[2023-03-14 02:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:11] [INFO ] [Real]Absence check using state equation in 3330 ms returned unknown
[2023-03-14 02:05:12] [INFO ] [Real]Absence check using 64 positive place invariants in 174 ms returned sat
[2023-03-14 02:05:13] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 546 ms returned sat
[2023-03-14 02:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:16] [INFO ] [Real]Absence check using state equation in 3206 ms returned unknown
[2023-03-14 02:05:17] [INFO ] [Real]Absence check using 64 positive place invariants in 167 ms returned sat
[2023-03-14 02:05:17] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 261 ms returned unsat
[2023-03-14 02:05:19] [INFO ] [Real]Absence check using 64 positive place invariants in 166 ms returned sat
[2023-03-14 02:05:19] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 261 ms returned unsat
[2023-03-14 02:05:20] [INFO ] [Real]Absence check using 64 positive place invariants in 161 ms returned sat
[2023-03-14 02:05:20] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 258 ms returned unsat
[2023-03-14 02:05:21] [INFO ] [Real]Absence check using 64 positive place invariants in 161 ms returned sat
[2023-03-14 02:05:22] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 542 ms returned sat
[2023-03-14 02:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:25] [INFO ] [Real]Absence check using state equation in 3412 ms returned unknown
[2023-03-14 02:05:26] [INFO ] [Real]Absence check using 64 positive place invariants in 162 ms returned sat
[2023-03-14 02:05:27] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 512 ms returned sat
[2023-03-14 02:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:30] [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: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 02:05:32] [INFO ] [Real]Absence check using 64 positive place invariants in 173 ms returned sat
[2023-03-14 02:05:33] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 527 ms returned sat
[2023-03-14 02:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:36] [INFO ] [Real]Absence check using state equation in 3342 ms returned unknown
[2023-03-14 02:05:37] [INFO ] [Real]Absence check using 64 positive place invariants in 163 ms returned sat
[2023-03-14 02:05:38] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 563 ms returned sat
[2023-03-14 02:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:41] [INFO ] [Real]Absence check using state equation in 3204 ms returned unknown
[2023-03-14 02:05:42] [INFO ] [Real]Absence check using 64 positive place invariants in 171 ms returned sat
[2023-03-14 02:05:42] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 264 ms returned unsat
[2023-03-14 02:05:44] [INFO ] [Real]Absence check using 64 positive place invariants in 174 ms returned sat
[2023-03-14 02:05:44] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 258 ms returned unsat
[2023-03-14 02:05:45] [INFO ] [Real]Absence check using 64 positive place invariants in 164 ms returned sat
[2023-03-14 02:05:45] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 240 ms returned unsat
[2023-03-14 02:05:46] [INFO ] [Real]Absence check using 64 positive place invariants in 161 ms returned sat
[2023-03-14 02:05:47] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 452 ms returned unsat
[2023-03-14 02:05:48] [INFO ] [Real]Absence check using 64 positive place invariants in 170 ms returned sat
[2023-03-14 02:05:48] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 504 ms returned sat
[2023-03-14 02:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:52] [INFO ] [Real]Absence check using state equation in 3479 ms returned unknown
[2023-03-14 02:05:53] [INFO ] [Real]Absence check using 64 positive place invariants in 172 ms returned sat
[2023-03-14 02:05:54] [INFO ] [Real]Absence check using 64 positive and 911 generalized place invariants in 516 ms returned sat
[2023-03-14 02:05:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:05:57] [INFO ] [Real]Absence check using state equation in 3248 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 25, 75, 1, 1, 1, 1, 1, 75, 75, 1, 1, 1, 1, 1, 1] Max seen :[1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 11106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 11106/11106 places, 16561/16561 transitions.
Graph (complete) has 37715 edges and 11106 vertex of which 11068 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.44 ms
Discarding 38 places :
Also discarding 0 output transitions
Drop transitions removed 2997 transitions
Trivial Post-agglo rules discarded 2997 transitions
Performed 2997 trivial Post agglomeration. Transition count delta: 2997
Iterating post reduction 0 with 2997 rules applied. Total rules applied 2998 place count 11068 transition count 13564
Reduce places removed 2997 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 3000 rules applied. Total rules applied 5998 place count 8071 transition count 13561
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 6001 place count 8068 transition count 13561
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 249 Pre rules applied. Total rules applied 6001 place count 8068 transition count 13312
Deduced a syphon composed of 249 places in 10 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 6499 place count 7819 transition count 13312
Discarding 2747 places :
Symmetric choice reduction at 3 with 2747 rule applications. Total rules 9246 place count 5072 transition count 10565
Iterating global reduction 3 with 2747 rules applied. Total rules applied 11993 place count 5072 transition count 10565
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 11993 place count 5072 transition count 10558
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 12007 place count 5065 transition count 10558
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 12554 place count 4518 transition count 7823
Iterating global reduction 3 with 547 rules applied. Total rules applied 13101 place count 4518 transition count 7823
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 13151 place count 4493 transition count 7798
Free-agglomeration rule (complex) applied 337 times.
Iterating global reduction 3 with 337 rules applied. Total rules applied 13488 place count 4493 transition count 9649
Reduce places removed 337 places and 0 transitions.
Iterating post reduction 3 with 337 rules applied. Total rules applied 13825 place count 4156 transition count 9649
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 13900 place count 4156 transition count 9649
Applied a total of 13900 rules in 4830 ms. Remains 4156 /11106 variables (removed 6950) and now considering 9649/16561 (removed 6912) transitions.
Finished structural reductions, in 1 iterations. Remains : 4156/11106 places, 9649/16561 transitions.
Normalized transition count is 8765 out of 9649 initially.
// Phase 1: matrix 8765 rows 4156 cols
[2023-03-14 02:06:02] [INFO ] Computed 937 place invariants in 228 ms
Incomplete random walk after 1000000 steps, including 32003 resets, run finished after 29291 ms. (steps per millisecond=34 ) properties (out of 8) seen :4
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4399 ms. (steps per millisecond=227 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4363 ms. (steps per millisecond=229 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4404 ms. (steps per millisecond=227 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4419 ms. (steps per millisecond=226 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4409 ms. (steps per millisecond=226 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000000 steps, including 3902 resets, run finished after 4436 ms. (steps per millisecond=225 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4431 ms. (steps per millisecond=225 ) properties (out of 7) seen :2
[2023-03-14 02:07:02] [INFO ] Flow matrix only has 8765 transitions (discarded 884 similar events)
// Phase 1: matrix 8765 rows 4156 cols
[2023-03-14 02:07:02] [INFO ] Computed 937 place invariants in 226 ms
[2023-03-14 02:07:03] [INFO ] [Real]Absence check using 49 positive place invariants in 88 ms returned sat
[2023-03-14 02:07:03] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 95 ms returned unsat
[2023-03-14 02:07:03] [INFO ] [Real]Absence check using 49 positive place invariants in 90 ms returned sat
[2023-03-14 02:07:04] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 212 ms returned sat
[2023-03-14 02:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:07] [INFO ] [Real]Absence check using state equation in 3259 ms returned sat
[2023-03-14 02:07:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:07:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 82 ms returned sat
[2023-03-14 02:07:08] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 203 ms returned sat
[2023-03-14 02:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:11] [INFO ] [Nat]Absence check using state equation in 3062 ms returned sat
[2023-03-14 02:07:11] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:07:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:07:17] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6333 ms returned unknown
[2023-03-14 02:07:18] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-14 02:07:18] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 210 ms returned sat
[2023-03-14 02:07:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:21] [INFO ] [Real]Absence check using state equation in 3319 ms returned sat
[2023-03-14 02:07:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:07:22] [INFO ] [Nat]Absence check using 49 positive place invariants in 77 ms returned sat
[2023-03-14 02:07:22] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 205 ms returned sat
[2023-03-14 02:07:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:26] [INFO ] [Nat]Absence check using state equation in 3790 ms returned sat
[2023-03-14 02:07:28] [INFO ] [Nat]Added 5002 Read/Feed constraints in 2167 ms returned sat
[2023-03-14 02:07:33] [INFO ] Deduced a trap composed of 609 places in 4446 ms of which 14 ms to minimize.
[2023-03-14 02:07:38] [INFO ] Deduced a trap composed of 231 places in 4550 ms of which 4 ms to minimize.
[2023-03-14 02:07:43] [INFO ] Deduced a trap composed of 244 places in 4627 ms of which 4 ms to minimize.
[2023-03-14 02:07:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 14746 ms
[2023-03-14 02:07:44] [INFO ] Computed and/alt/rep : 4618/6655/4618 causal constraints (skipped 4122 transitions) in 747 ms.
[2023-03-14 02:07:45] [INFO ] Added : 7 causal constraints over 2 iterations in 2226 ms. Result :sat
[2023-03-14 02:07:46] [INFO ] [Real]Absence check using 49 positive place invariants in 85 ms returned sat
[2023-03-14 02:07:46] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 12 ms returned unsat
[2023-03-14 02:07:46] [INFO ] [Real]Absence check using 49 positive place invariants in 79 ms returned sat
[2023-03-14 02:07:46] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 172 ms returned unsat
[2023-03-14 02:07:47] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-14 02:07:47] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 208 ms returned sat
[2023-03-14 02:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:50] [INFO ] [Real]Absence check using state equation in 3520 ms returned sat
[2023-03-14 02:07:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:07:51] [INFO ] [Nat]Absence check using 49 positive place invariants in 79 ms returned sat
[2023-03-14 02:07:51] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 200 ms returned sat
[2023-03-14 02:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:07:55] [INFO ] [Nat]Absence check using state equation in 3301 ms returned sat
[2023-03-14 02:07:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:07:59] [INFO ] [Nat]Added 5002 Read/Feed constraints in 4086 ms returned unsat
[2023-03-14 02:07:59] [INFO ] [Real]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-14 02:07:59] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 199 ms returned sat
[2023-03-14 02:07:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:08:02] [INFO ] [Real]Absence check using state equation in 3102 ms returned sat
[2023-03-14 02:08:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:08:03] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-14 02:08:03] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 199 ms returned sat
[2023-03-14 02:08:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:08:07] [INFO ] [Nat]Absence check using state equation in 3330 ms returned sat
[2023-03-14 02:08:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:08:12] [INFO ] [Nat]Added 5002 Read/Feed constraints in 5649 ms returned sat
[2023-03-14 02:08:17] [INFO ] Deduced a trap composed of 191 places in 4678 ms of which 8 ms to minimize.
[2023-03-14 02:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5222 ms
[2023-03-14 02:08:18] [INFO ] Computed and/alt/rep : 4618/6655/4618 causal constraints (skipped 4122 transitions) in 659 ms.
[2023-03-14 02:08:19] [INFO ] Added : 7 causal constraints over 2 iterations in 2046 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 0, 1] Max seen :[1, 0, 0, 1, 1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 4156 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4156/4156 places, 9649/9649 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 4156 transition count 9648
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 4155 transition count 9648
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 4155 transition count 9645
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 8 place count 4152 transition count 9645
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 4149 transition count 9642
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 4149 transition count 9642
Applied a total of 14 rules in 1456 ms. Remains 4149 /4156 variables (removed 7) and now considering 9642/9649 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4156 places, 9642/9649 transitions.
Normalized transition count is 8758 out of 9642 initially.
// Phase 1: matrix 8758 rows 4149 cols
[2023-03-14 02:08:22] [INFO ] Computed 937 place invariants in 205 ms
Incomplete random walk after 1000000 steps, including 32004 resets, run finished after 28680 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4396 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4444 ms. (steps per millisecond=225 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3902 resets, run finished after 4401 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
[2023-03-14 02:09:04] [INFO ] Flow matrix only has 8758 transitions (discarded 884 similar events)
// Phase 1: matrix 8758 rows 4149 cols
[2023-03-14 02:09:04] [INFO ] Computed 937 place invariants in 204 ms
[2023-03-14 02:09:04] [INFO ] [Real]Absence check using 49 positive place invariants in 67 ms returned sat
[2023-03-14 02:09:04] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 208 ms returned sat
[2023-03-14 02:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:08] [INFO ] [Real]Absence check using state equation in 3103 ms returned sat
[2023-03-14 02:09:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:09:08] [INFO ] [Nat]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-14 02:09:08] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 203 ms returned sat
[2023-03-14 02:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:12] [INFO ] [Nat]Absence check using state equation in 3313 ms returned sat
[2023-03-14 02:09:12] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:09:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:09:18] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6258 ms returned unknown
[2023-03-14 02:09:19] [INFO ] [Real]Absence check using 49 positive place invariants in 66 ms returned sat
[2023-03-14 02:09:19] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 207 ms returned sat
[2023-03-14 02:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:22] [INFO ] [Real]Absence check using state equation in 3312 ms returned sat
[2023-03-14 02:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:09:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-14 02:09:23] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 217 ms returned sat
[2023-03-14 02:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:26] [INFO ] [Nat]Absence check using state equation in 3255 ms returned sat
[2023-03-14 02:09:27] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1001 ms returned sat
[2023-03-14 02:09:32] [INFO ] Deduced a trap composed of 453 places in 4332 ms of which 4 ms to minimize.
[2023-03-14 02:09:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4823 ms
[2023-03-14 02:09:33] [INFO ] Computed and/alt/rep : 4614/6648/4614 causal constraints (skipped 4119 transitions) in 610 ms.
[2023-03-14 02:09:34] [INFO ] Added : 6 causal constraints over 2 iterations in 2082 ms. Result :sat
[2023-03-14 02:09:35] [INFO ] [Real]Absence check using 49 positive place invariants in 68 ms returned sat
[2023-03-14 02:09:35] [INFO ] [Real]Absence check using 49 positive and 888 generalized place invariants in 216 ms returned sat
[2023-03-14 02:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:38] [INFO ] [Real]Absence check using state equation in 3394 ms returned sat
[2023-03-14 02:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:09:39] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-14 02:09:39] [INFO ] [Nat]Absence check using 49 positive and 888 generalized place invariants in 203 ms returned sat
[2023-03-14 02:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:09:43] [INFO ] [Nat]Absence check using state equation in 3376 ms returned sat
[2023-03-14 02:09:44] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1508 ms returned sat
[2023-03-14 02:09:45] [INFO ] Computed and/alt/rep : 4614/6648/4614 causal constraints (skipped 4119 transitions) in 520 ms.
[2023-03-14 02:09:46] [INFO ] Added : 8 causal constraints over 2 iterations in 1930 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 4149 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9642/9642 transitions.
Applied a total of 0 rules in 456 ms. Remains 4149 /4149 variables (removed 0) and now considering 9642/9642 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4149/4149 places, 9642/9642 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4149/4149 places, 9642/9642 transitions.
Applied a total of 0 rules in 522 ms. Remains 4149 /4149 variables (removed 0) and now considering 9642/9642 (removed 0) transitions.
[2023-03-14 02:09:48] [INFO ] Flow matrix only has 8758 transitions (discarded 884 similar events)
// Phase 1: matrix 8758 rows 4149 cols
[2023-03-14 02:09:48] [INFO ] Computed 937 place invariants in 207 ms
[2023-03-14 02:09:58] [INFO ] Implicit Places using invariants in 10283 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 102, 122, 144, 167, 189, 190, 191, 192, 193, 194, 214, 232, 248, 262, 274, 284, 292, 298, 302, 305, 318, 324, 326, 327, 328, 329, 330, 331, 333, 337, 343, 351, 361, 373, 387, 403, 421, 441, 462, 482, 483, 484, 485, 486, 487, 505, 521, 535, 547, 557, 565, 571, 575, 577, 579, 592, 598, 600, 601, 602, 603, 604, 605, 607, 609, 613, 619, 627, 637, 649, 663, 679, 697, 716, 734, 735, 736, 737, 738, 739, 755, 769, 781, 791, 799, 805, 809, 811, 813, 815, 828, 834, 836, 837, 838, 839, 840, 841, 843, 845, 847, 851, 857, 865, 875, 887, 901, 917, 934, 950, 951, 952, 953, 954, 955, 969, 981, 991, 999, 1005, 1009, 1011, 1013, 1015, 1017, 1030, 1036, 1038, 1039, 1040, 1041, 1042, 1043, 1045, 1047, 1049, 1051, 1055, 1061, 1069, 1079, 1091, 1105, 1120, 1134, 1135, 1136, 1137, 1138, 1139, 1151, 1161, 1169, 1175, 1179, 1181, 1183, 1185, 1187, 1189, 1202, 1208, 1210, 1211, 1212, 1213, 1214, 1215, 1217, 1219, 1221, 1223, 1225, 1229, 1235, 1243, 1253, 1265, 1278, 1290, 1291, 1292, 1293, 1294, 1295, 1305, 1313, 1319, 1323, 1325, 1327, 1329, 1331, 1333, 1335, 1348, 1354, 1356, 1357, 1358, 1359, 1360, 1361, 1363, 1365, 1367, 1369, 1371, 1373, 1377, 1383, 1391, 1401, 1412, 1422, 1423, 1424, 1425, 1426, 1427, 1435, 1441, 1445, 1447, 1449, 1451, 1453, 1455, 1457, 1459, 1472, 1478, 1480, 1481, 1482, 1483, 1484, 1485, 1487, 1489, 1491, 1493, 1495, 1497, 1499, 1503, 1509, 1517, 1526, 1534, 1535, 1536, 1537, 1538, 1539, 1545, 1549, 1551, 1553, 1555, 1557, 1559, 1561, 1563, 1565, 1578, 1584, 1586, 1587, 1588, 1589, 1590, 1591, 1593, 1595, 1597, 1599, 1601, 1603, 1605, 1607, 1611, 1617, 1624, 1630, 1631, 1632, 1633, 1634, 1635, 1639, 1641, 1643, 1645, 1647, 1649, 1651, 1653, 1655, 1657, 1670, 1676, 1678, 1679, 1680, 1681, 1682, 1683, 1685, 1687, 1689, 1691, 1693, 1695, 1697, 1699, 1701, 1705, 1710, 1714, 1715, 1716, 1717, 1718, 1719, 1721, 1723, 1725, 1727, 1729, 1731, 1733, 1735, 1737, 1739, 1758, 1760, 1761, 1762, 1763, 1764, 1765, 1767, 1769, 1771, 1773, 1775, 1777, 1779, 1781, 1783, 1785, 1788, 1790, 1791, 1792, 1793, 1794, 1795, 1797, 1799, 1801, 1803, 1805, 1807, 1809, 1811, 1813, 1815, 1828, 1834, 1836, 1837, 1838, 1839, 1840, 1841, 1843, 1845, 1847, 1849, 1851, 1853, 1855, 1857, 1859, 1861, 1863, 1865, 1866, 1867, 1868, 1869, 1870, 1872, 1874, 1876, 1878, 1880, 1882, 1884, 1886, 1888, 1890, 1903, 1905, 1908, 1910, 1911, 1912, 1913, 1914, 1915, 1917, 1919, 1921, 1923, 1925, 1927, 1929, 1931, 1933, 1935, 1937, 1939, 1940, 1941, 1942, 1943, 1944, 1946, 1948, 1950, 1952, 1954, 1956, 1958, 1960, 1962, 1964, 1977, 1983, 1985, 1986, 1987, 1988, 1989, 1990, 1992, 1994, 1996, 1998, 2000, 2002, 2004, 2006, 2008, 2010, 2012, 2014, 2015, 2016, 2017, 2018, 2019, 2021, 2023, 2025, 2027, 2029, 2031, 2033, 2035, 2037, 2039, 2052, 2058, 2060, 2061, 2062, 2063, 2064, 2065, 2067, 2069, 2071, 2073, 2075, 2077, 2079, 2081, 2083, 2085, 2087, 2090, 2091, 2092, 2093, 2094, 2095, 2097, 2099, 2101, 2103, 2105, 2107, 2109, 2111, 2113, 2115, 2128, 2134, 2136, 2137, 2138, 2139, 2140, 2141, 2143, 2145, 2147, 2149, 2151, 2153, 2155, 2157, 2159, 2161, 2165, 2170, 2171, 2172, 2173, 2174, 2175, 2179, 2181, 2183, 2185, 2187, 2189, 2191, 2193, 2195, 2197, 2210, 2216, 2218, 2219, 2220, 2221, 2222, 2223, 2225, 2227, 2229, 2231, 2233, 2235, 2237, 2239, 2241, 2245, 2251, 2258, 2259, 2260, 2261, 2262, 2263, 2269, 2273, 2275, 2277, 2279, 2281, 2283, 2285, 2287, 2289, 2302, 2308, 2310, 2311, 2312, 2313, 2314, 2315, 2317, 2319, 2321, 2323, 2325, 2327, 2329, 2331, 2335, 2341, 2349, 2358, 2359, 2360, 2361, 2362, 2363, 2371, 2377, 2381, 2383, 2385, 2387, 2389, 2391, 2393, 2395, 2408, 2414, 2416, 2417, 2418, 2419, 2420, 2421, 2423, 2425, 2427, 2429, 2431, 2433, 2435, 2439, 2445, 2453, 2463, 2474, 2475, 2476, 2477, 2478, 2479, 2489, 2497, 2503, 2507, 2509, 2511, 2513, 2515, 2517, 2519, 2532, 2538, 2540, 2541, 2542, 2543, 2544, 2545, 2547, 2549, 2551, 2553, 2555, 2557, 2561, 2567, 2575, 2585, 2597, 2610, 2611, 2612, 2613, 2614, 2615, 2627, 2637, 2645, 2651, 2655, 2657, 2659, 2661, 2663, 2665, 2678, 2684, 2686, 2687, 2688, 2689, 2690, 2691, 2693, 2695, 2697, 2699, 2701, 2705, 2711, 2719, 2729, 2741, 2755, 2770, 2771, 2772, 2773, 2774, 2775, 2789, 2801, 2811, 2819, 2825, 2829, 2831, 2833, 2835, 2837, 2850, 2856, 2858, 2859, 2860, 2861, 2862, 2863, 2865, 2867, 2869, 2871, 2875, 2881, 2889, 2899, 2911, 2925, 2941, 2958, 2959, 2960, 2961, 2962, 2963, 2979, 2993, 3005, 3015, 3023, 3029, 3033, 3035, 3037, 3039, 3052, 3058, 3060, 3061, 3062, 3063, 3064, 3065, 3067, 3069, 3071, 3075, 3081, 3089, 3099, 3111, 3126, 3142, 3160, 3179, 3180, 3181, 3182, 3183, 3184, 3202, 3218, 3232, 3244, 3254, 3262, 3268, 3272, 3274, 3276, 3289, 3295, 3297, 3298, 3299, 3300, 3301, 3302, 3304, 3306, 3310, 3316, 3324, 3334, 3346, 3360, 3376, 3394, 3414, 3435, 3436, 3437, 3438, 3439, 3440, 3460, 3478, 3494, 3508, 3520, 3530, 3538, 3544, 3548, 3550, 3563, 3565, 3568, 3570, 3571, 3572, 3573, 3574, 3575, 3577, 3581, 3587, 3595, 3605, 3617, 3631, 3647, 3665, 3685, 3707, 3730, 3731, 3732, 3733, 3734, 3735, 3757, 3777, 3795, 3811, 3825, 3837, 3847, 3855, 3861, 3865, 3878]
Discarding 876 places :
Implicit Place search using SMT only with invariants took 10308 ms to find 876 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 3273/4149 places, 9642/9642 transitions.
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 240 place count 3033 transition count 9402
Iterating global reduction 0 with 240 rules applied. Total rules applied 480 place count 3033 transition count 9402
Discarding 240 places :
Symmetric choice reduction at 0 with 240 rule applications. Total rules 720 place count 2793 transition count 9162
Iterating global reduction 0 with 240 rules applied. Total rules applied 960 place count 2793 transition count 9162
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 963 place count 2793 transition count 9159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 966 place count 2790 transition count 9159
Applied a total of 966 rules in 1365 ms. Remains 2790 /3273 variables (removed 483) and now considering 9159/9642 (removed 483) transitions.
[2023-03-14 02:09:59] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2790 cols
[2023-03-14 02:10:00] [INFO ] Computed 61 place invariants in 166 ms
[2023-03-14 02:10:04] [INFO ] Implicit Places using invariants in 4224 ms returned [70, 1312]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4233 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2788/4149 places, 9159/9642 transitions.
Applied a total of 0 rules in 469 ms. Remains 2788 /2788 variables (removed 0) and now considering 9159/9159 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 2788/4149 places, 9159/9642 transitions.
Normalized transition count is 8275 out of 9159 initially.
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:10:04] [INFO ] Computed 59 place invariants in 149 ms
Incomplete random walk after 1000000 steps, including 34137 resets, run finished after 27622 ms. (steps per millisecond=36 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2676 resets, run finished after 2935 ms. (steps per millisecond=340 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2679 resets, run finished after 2928 ms. (steps per millisecond=341 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2673 resets, run finished after 2959 ms. (steps per millisecond=337 ) properties (out of 3) seen :0
[2023-03-14 02:10:41] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:10:41] [INFO ] Computed 59 place invariants in 156 ms
[2023-03-14 02:10:41] [INFO ] [Real]Absence check using 47 positive place invariants in 44 ms returned sat
[2023-03-14 02:10:41] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 7 ms returned sat
[2023-03-14 02:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:10:43] [INFO ] [Real]Absence check using state equation in 1965 ms returned sat
[2023-03-14 02:10:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:10:44] [INFO ] [Nat]Absence check using 47 positive place invariants in 44 ms returned sat
[2023-03-14 02:10:44] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:10:46] [INFO ] [Nat]Absence check using state equation in 2239 ms returned sat
[2023-03-14 02:10:46] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:10:49] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:10:52] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6256 ms returned unknown
[2023-03-14 02:10:52] [INFO ] [Real]Absence check using 47 positive place invariants in 42 ms returned sat
[2023-03-14 02:10:52] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:10:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:10:54] [INFO ] [Real]Absence check using state equation in 1955 ms returned sat
[2023-03-14 02:10:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:10:55] [INFO ] [Nat]Absence check using 47 positive place invariants in 42 ms returned sat
[2023-03-14 02:10:55] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:10:58] [INFO ] [Nat]Absence check using state equation in 3009 ms returned sat
[2023-03-14 02:11:00] [INFO ] [Nat]Added 5002 Read/Feed constraints in 2074 ms returned sat
[2023-03-14 02:11:02] [INFO ] Deduced a trap composed of 358 places in 1898 ms of which 2 ms to minimize.
[2023-03-14 02:11:04] [INFO ] Deduced a trap composed of 74 places in 2030 ms of which 3 ms to minimize.
[2023-03-14 02:11:06] [INFO ] Deduced a trap composed of 104 places in 1989 ms of which 3 ms to minimize.
[2023-03-14 02:11:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6714 ms
[2023-03-14 02:11:07] [INFO ] Computed and/alt/rep : 4552/6594/4552 causal constraints (skipped 3629 transitions) in 513 ms.
[2023-03-14 02:11:08] [INFO ] Added : 10 causal constraints over 2 iterations in 1803 ms. Result :sat
[2023-03-14 02:11:09] [INFO ] [Real]Absence check using 47 positive place invariants in 44 ms returned sat
[2023-03-14 02:11:09] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-14 02:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:11:11] [INFO ] [Real]Absence check using state equation in 2189 ms returned sat
[2023-03-14 02:11:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:11:12] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2023-03-14 02:11:12] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:11:15] [INFO ] [Nat]Absence check using state equation in 3065 ms returned sat
[2023-03-14 02:11:16] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1664 ms returned sat
[2023-03-14 02:11:18] [INFO ] Deduced a trap composed of 308 places in 1864 ms of which 3 ms to minimize.
[2023-03-14 02:11:21] [INFO ] Deduced a trap composed of 96 places in 2054 ms of which 4 ms to minimize.
[2023-03-14 02:11:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4471 ms
[2023-03-14 02:11:21] [INFO ] Computed and/alt/rep : 4552/6594/4552 causal constraints (skipped 3629 transitions) in 459 ms.
[2023-03-14 02:11:23] [INFO ] Added : 11 causal constraints over 3 iterations in 1926 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 2788 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2788/2788 places, 9159/9159 transitions.
Applied a total of 0 rules in 445 ms. Remains 2788 /2788 variables (removed 0) and now considering 9159/9159 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2788/2788 places, 9159/9159 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2788/2788 places, 9159/9159 transitions.
Applied a total of 0 rules in 439 ms. Remains 2788 /2788 variables (removed 0) and now considering 9159/9159 (removed 0) transitions.
[2023-03-14 02:11:24] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:11:24] [INFO ] Computed 59 place invariants in 155 ms
[2023-03-14 02:11:28] [INFO ] Implicit Places using invariants in 3851 ms returned []
[2023-03-14 02:11:28] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:11:28] [INFO ] Computed 59 place invariants in 147 ms
[2023-03-14 02:11:34] [INFO ] Implicit Places using invariants and state equation in 6052 ms returned []
Implicit Place search using SMT with State Equation took 9905 ms to find 0 implicit places.
[2023-03-14 02:11:35] [INFO ] Redundant transitions in 1402 ms returned []
[2023-03-14 02:11:35] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:11:35] [INFO ] Computed 59 place invariants in 158 ms
[2023-03-14 02:11:40] [INFO ] Dead Transitions using invariants and state equation in 4679 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2788/2788 places, 9159/9159 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06
Normalized transition count is 8275 out of 9159 initially.
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:11:40] [INFO ] Computed 59 place invariants in 149 ms
Incomplete random walk after 10000 steps, including 342 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
[2023-03-14 02:11:41] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:11:41] [INFO ] Computed 59 place invariants in 147 ms
[2023-03-14 02:11:41] [INFO ] [Real]Absence check using 47 positive place invariants in 44 ms returned sat
[2023-03-14 02:11:41] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:11:43] [INFO ] [Real]Absence check using state equation in 1950 ms returned sat
[2023-03-14 02:11:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:11:43] [INFO ] [Nat]Absence check using 47 positive place invariants in 41 ms returned sat
[2023-03-14 02:11:43] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:11:46] [INFO ] [Nat]Absence check using state equation in 2238 ms returned sat
[2023-03-14 02:11:46] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:11:48] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:11:48] [INFO ] [Nat]Added 5002 Read/Feed constraints in 2476 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2788 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2788/2788 places, 9159/9159 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2788 transition count 9158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2787 transition count 9158
Applied a total of 2 rules in 941 ms. Remains 2787 /2788 variables (removed 1) and now considering 9158/9159 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2788 places, 9158/9159 transitions.
Normalized transition count is 8273 out of 9158 initially.
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:11:49] [INFO ] Computed 59 place invariants in 135 ms
Incomplete random walk after 1000000 steps, including 34135 resets, run finished after 27789 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2690 resets, run finished after 3024 ms. (steps per millisecond=330 ) properties (out of 1) seen :0
[2023-03-14 02:12:20] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:12:20] [INFO ] Computed 59 place invariants in 131 ms
[2023-03-14 02:12:20] [INFO ] [Real]Absence check using 47 positive place invariants in 47 ms returned sat
[2023-03-14 02:12:20] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:12:23] [INFO ] [Real]Absence check using state equation in 2985 ms returned sat
[2023-03-14 02:12:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:12:24] [INFO ] [Nat]Absence check using 47 positive place invariants in 59 ms returned sat
[2023-03-14 02:12:24] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:12:27] [INFO ] [Nat]Absence check using state equation in 2649 ms returned sat
[2023-03-14 02:12:27] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:12:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:12:33] [INFO ] [Nat]Added 5002 Read/Feed constraints in 6235 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2787 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 468 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2787 places, 9158/9158 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 460 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
[2023-03-14 02:12:34] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:12:34] [INFO ] Computed 59 place invariants in 128 ms
[2023-03-14 02:12:38] [INFO ] Implicit Places using invariants in 3925 ms returned []
[2023-03-14 02:12:38] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:12:38] [INFO ] Computed 59 place invariants in 125 ms
[2023-03-14 02:12:44] [INFO ] Implicit Places using invariants and state equation in 6065 ms returned []
Implicit Place search using SMT with State Equation took 9994 ms to find 0 implicit places.
[2023-03-14 02:12:45] [INFO ] Redundant transitions in 1092 ms returned []
[2023-03-14 02:12:45] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:12:45] [INFO ] Computed 59 place invariants in 130 ms
[2023-03-14 02:12:49] [INFO ] Dead Transitions using invariants and state equation in 4561 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2787 places, 9158/9158 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-06 in 69442 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07
Normalized transition count is 8275 out of 9159 initially.
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:12:50] [INFO ] Computed 59 place invariants in 152 ms
Incomplete random walk after 10000 steps, including 341 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
[2023-03-14 02:12:50] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:12:50] [INFO ] Computed 59 place invariants in 149 ms
[2023-03-14 02:12:50] [INFO ] [Real]Absence check using 47 positive place invariants in 45 ms returned sat
[2023-03-14 02:12:50] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:12:52] [INFO ] [Real]Absence check using state equation in 1925 ms returned sat
[2023-03-14 02:12:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:12:53] [INFO ] [Nat]Absence check using 47 positive place invariants in 45 ms returned sat
[2023-03-14 02:12:53] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:12:56] [INFO ] [Nat]Absence check using state equation in 3031 ms returned sat
[2023-03-14 02:12:56] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:12:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:12:58] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1703 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2788 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2788/2788 places, 9159/9159 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2788 transition count 9157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 2786 transition count 9157
Applied a total of 4 rules in 929 ms. Remains 2786 /2788 variables (removed 2) and now considering 9157/9159 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2786/2788 places, 9157/9159 transitions.
Normalized transition count is 8271 out of 9157 initially.
// Phase 1: matrix 8271 rows 2786 cols
[2023-03-14 02:12:59] [INFO ] Computed 59 place invariants in 133 ms
Incomplete random walk after 1000000 steps, including 34138 resets, run finished after 27607 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2685 resets, run finished after 3026 ms. (steps per millisecond=330 ) properties (out of 1) seen :0
[2023-03-14 02:13:29] [INFO ] Flow matrix only has 8271 transitions (discarded 886 similar events)
// Phase 1: matrix 8271 rows 2786 cols
[2023-03-14 02:13:29] [INFO ] Computed 59 place invariants in 136 ms
[2023-03-14 02:13:30] [INFO ] [Real]Absence check using 47 positive place invariants in 45 ms returned sat
[2023-03-14 02:13:30] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 11 ms returned sat
[2023-03-14 02:13:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:13:32] [INFO ] [Real]Absence check using state equation in 2164 ms returned sat
[2023-03-14 02:13:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:13:32] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2023-03-14 02:13:32] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:13:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:13:36] [INFO ] [Nat]Absence check using state equation in 3290 ms returned sat
[2023-03-14 02:13:36] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:13:37] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1769 ms returned sat
[2023-03-14 02:13:40] [INFO ] Deduced a trap composed of 376 places in 2086 ms of which 3 ms to minimize.
[2023-03-14 02:13:42] [INFO ] Deduced a trap composed of 97 places in 1867 ms of which 2 ms to minimize.
[2023-03-14 02:13:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4553 ms
[2023-03-14 02:13:42] [INFO ] Computed and/alt/rep : 4548/6588/4548 causal constraints (skipped 3629 transitions) in 458 ms.
[2023-03-14 02:13:44] [INFO ] Added : 10 causal constraints over 2 iterations in 1671 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2786 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2786/2786 places, 9157/9157 transitions.
Applied a total of 0 rules in 488 ms. Remains 2786 /2786 variables (removed 0) and now considering 9157/9157 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2786/2786 places, 9157/9157 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2786/2786 places, 9157/9157 transitions.
Applied a total of 0 rules in 492 ms. Remains 2786 /2786 variables (removed 0) and now considering 9157/9157 (removed 0) transitions.
[2023-03-14 02:13:45] [INFO ] Flow matrix only has 8271 transitions (discarded 886 similar events)
// Phase 1: matrix 8271 rows 2786 cols
[2023-03-14 02:13:45] [INFO ] Computed 59 place invariants in 140 ms
[2023-03-14 02:13:49] [INFO ] Implicit Places using invariants in 4088 ms returned []
[2023-03-14 02:13:49] [INFO ] Flow matrix only has 8271 transitions (discarded 886 similar events)
// Phase 1: matrix 8271 rows 2786 cols
[2023-03-14 02:13:49] [INFO ] Computed 59 place invariants in 165 ms
[2023-03-14 02:13:55] [INFO ] Implicit Places using invariants and state equation in 6133 ms returned []
Implicit Place search using SMT with State Equation took 10223 ms to find 0 implicit places.
[2023-03-14 02:13:56] [INFO ] Redundant transitions in 1170 ms returned []
[2023-03-14 02:13:56] [INFO ] Flow matrix only has 8271 transitions (discarded 886 similar events)
// Phase 1: matrix 8271 rows 2786 cols
[2023-03-14 02:13:56] [INFO ] Computed 59 place invariants in 136 ms
[2023-03-14 02:14:01] [INFO ] Dead Transitions using invariants and state equation in 4753 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2786/2786 places, 9157/9157 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-07 in 71664 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15
Normalized transition count is 8275 out of 9159 initially.
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:14:01] [INFO ] Computed 59 place invariants in 152 ms
Incomplete random walk after 10000 steps, including 340 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2023-03-14 02:14:02] [INFO ] Flow matrix only has 8275 transitions (discarded 884 similar events)
// Phase 1: matrix 8275 rows 2788 cols
[2023-03-14 02:14:02] [INFO ] Computed 59 place invariants in 149 ms
[2023-03-14 02:14:02] [INFO ] [Real]Absence check using 47 positive place invariants in 47 ms returned sat
[2023-03-14 02:14:02] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:14:05] [INFO ] [Real]Absence check using state equation in 2429 ms returned sat
[2023-03-14 02:14:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:14:05] [INFO ] [Nat]Absence check using 47 positive place invariants in 48 ms returned sat
[2023-03-14 02:14:05] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-14 02:14:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:14:08] [INFO ] [Nat]Absence check using state equation in 3402 ms returned sat
[2023-03-14 02:14:08] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:14:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-14 02:14:10] [INFO ] [Nat]Added 5002 Read/Feed constraints in 1283 ms returned unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2788 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2788/2788 places, 9159/9159 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 2788 transition count 9158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2787 transition count 9158
Applied a total of 2 rules in 920 ms. Remains 2787 /2788 variables (removed 1) and now considering 9158/9159 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2788 places, 9158/9159 transitions.
Normalized transition count is 8273 out of 9158 initially.
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:14:11] [INFO ] Computed 59 place invariants in 125 ms
Incomplete random walk after 1000000 steps, including 34131 resets, run finished after 27607 ms. (steps per millisecond=36 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2676 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
[2023-03-14 02:14:41] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:14:42] [INFO ] Computed 59 place invariants in 122 ms
[2023-03-14 02:14:42] [INFO ] [Real]Absence check using 47 positive place invariants in 47 ms returned sat
[2023-03-14 02:14:42] [INFO ] [Real]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:14:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:14:45] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2023-03-14 02:14:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:14:46] [INFO ] [Nat]Absence check using 47 positive place invariants in 46 ms returned sat
[2023-03-14 02:14:46] [INFO ] [Nat]Absence check using 47 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-14 02:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:14:49] [INFO ] [Nat]Absence check using state equation in 2867 ms returned sat
[2023-03-14 02:14:49] [INFO ] State equation strengthened by 5002 read => feed constraints.
[2023-03-14 02:14:51] [INFO ] [Nat]Added 5002 Read/Feed constraints in 2093 ms returned sat
[2023-03-14 02:14:53] [INFO ] Deduced a trap composed of 326 places in 1895 ms of which 3 ms to minimize.
[2023-03-14 02:14:55] [INFO ] Deduced a trap composed of 112 places in 1922 ms of which 2 ms to minimize.
[2023-03-14 02:14:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4404 ms
[2023-03-14 02:14:56] [INFO ] Computed and/alt/rep : 4550/6591/4550 causal constraints (skipped 3629 transitions) in 481 ms.
[2023-03-14 02:14:57] [INFO ] Added : 10 causal constraints over 2 iterations in 1702 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2787 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 453 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2787 places, 9158/9158 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2787/2787 places, 9158/9158 transitions.
Applied a total of 0 rules in 448 ms. Remains 2787 /2787 variables (removed 0) and now considering 9158/9158 (removed 0) transitions.
[2023-03-14 02:14:58] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:14:58] [INFO ] Computed 59 place invariants in 146 ms
[2023-03-14 02:15:02] [INFO ] Implicit Places using invariants in 4044 ms returned []
[2023-03-14 02:15:02] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:15:02] [INFO ] Computed 59 place invariants in 117 ms
[2023-03-14 02:15:08] [INFO ] Implicit Places using invariants and state equation in 6071 ms returned []
Implicit Place search using SMT with State Equation took 10115 ms to find 0 implicit places.
[2023-03-14 02:15:09] [INFO ] Redundant transitions in 1115 ms returned []
[2023-03-14 02:15:09] [INFO ] Flow matrix only has 8273 transitions (discarded 885 similar events)
// Phase 1: matrix 8273 rows 2787 cols
[2023-03-14 02:15:09] [INFO ] Computed 59 place invariants in 133 ms
[2023-03-14 02:15:14] [INFO ] Dead Transitions using invariants and state equation in 4778 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2787/2787 places, 9158/9158 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S24C05-UpperBounds-15 in 72920 ms.
[2023-03-14 02:15:16] [INFO ] Flatten gal took : 530 ms
[2023-03-14 02:15:16] [INFO ] Applying decomposition
[2023-03-14 02:15:16] [INFO ] Flatten gal took : 350 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/graph17948838832354030444.txt' '-o' '/tmp/graph17948838832354030444.bin' '-w' '/tmp/graph17948838832354030444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17948838832354030444.bin' '-l' '-1' '-v' '-w' '/tmp/graph17948838832354030444.weights' '-q' '0' '-e' '0.001'
[2023-03-14 02:15:17] [INFO ] Decomposing Gal with order
[2023-03-14 02:15:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 02:15:20] [INFO ] Removed a total of 14528 redundant transitions.
[2023-03-14 02:15:20] [INFO ] Flatten gal took : 2491 ms
[2023-03-14 02:15:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 7467 labels/synchronizations in 646 ms.
[2023-03-14 02:15:21] [INFO ] Time to serialize gal into /tmp/UpperBounds10543341342475350044.gal : 287 ms
[2023-03-14 02:15:21] [INFO ] Time to serialize properties into /tmp/UpperBounds15330019750734032925.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10543341342475350044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15330019750734032925.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...276
Loading property file /tmp/UpperBounds15330019750734032925.prop.
Detected timeout of ITS tools.
[2023-03-14 02:39:06] [INFO ] Flatten gal took : 1428 ms
[2023-03-14 02:39:06] [INFO ] Time to serialize gal into /tmp/UpperBounds1638101232763778951.gal : 164 ms
[2023-03-14 02:39:06] [INFO ] Time to serialize properties into /tmp/UpperBounds16231171776025246954.prop : 2 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/UpperBounds1638101232763778951.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16231171776025246954.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/UpperBounds16231171776025246954.prop.
Detected timeout of ITS tools.
[2023-03-14 03:03:11] [INFO ] Flatten gal took : 1516 ms
[2023-03-14 03:03:18] [INFO ] Input system was already deterministic with 9159 transitions.
[2023-03-14 03:03:18] [INFO ] Transformed 2788 places.
[2023-03-14 03:03:18] [INFO ] Transformed 9159 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-14 03:03:21] [INFO ] Time to serialize gal into /tmp/UpperBounds88538351501543427.gal : 29 ms
[2023-03-14 03:03:21] [INFO ] Time to serialize properties into /tmp/UpperBounds4799394927783570254.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/UpperBounds88538351501543427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4799394927783570254.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...338
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4799394927783570254.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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-S24C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is MultiCrashLeafsetExtension-PT-S24C05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r255-tall-167856440400104"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S24C05.tgz
mv MultiCrashLeafsetExtension-PT-S24C05 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;