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-167856440400103.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-S24C04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 15K Feb 26 03:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 03:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 03:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 03:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 10M 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-S24C04-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678759311405

Running Version 202205111006
[2023-03-14 02:01:52] [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:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 02:01:53] [INFO ] Load time of PNML (sax parser for PT used): 644 ms
[2023-03-14 02:01:53] [INFO ] Transformed 9748 places.
[2023-03-14 02:01:53] [INFO ] Transformed 14659 transitions.
[2023-03-14 02:01:53] [INFO ] Parsed PT model containing 9748 places and 14659 transitions in 835 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Normalized transition count is 14059 out of 14659 initially.
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-14 02:01:54] [INFO ] Computed 921 place invariants in 1022 ms
Incomplete random walk after 10000 steps, including 241 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 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 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :0
[2023-03-14 02:01:55] [INFO ] Flow matrix only has 14059 transitions (discarded 600 similar events)
// Phase 1: matrix 14059 rows 9748 cols
[2023-03-14 02:01:56] [INFO ] Computed 921 place invariants in 657 ms
[2023-03-14 02:01:57] [INFO ] [Real]Absence check using 62 positive place invariants in 164 ms returned sat
[2023-03-14 02:01:57] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 424 ms returned sat
[2023-03-14 02:01:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:01] [INFO ] [Real]Absence check using state equation in 3325 ms returned unknown
[2023-03-14 02:02:02] [INFO ] [Real]Absence check using 62 positive place invariants in 149 ms returned sat
[2023-03-14 02:02:02] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 173 ms returned unsat
[2023-03-14 02:02:03] [INFO ] [Real]Absence check using 62 positive place invariants in 137 ms returned sat
[2023-03-14 02:02:03] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 169 ms returned unsat
[2023-03-14 02:02:04] [INFO ] [Real]Absence check using 62 positive place invariants in 145 ms returned sat
[2023-03-14 02:02:04] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 177 ms returned unsat
[2023-03-14 02:02:05] [INFO ] [Real]Absence check using 62 positive place invariants in 141 ms returned sat
[2023-03-14 02:02:06] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 424 ms returned sat
[2023-03-14 02:02:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:09] [INFO ] [Real]Absence check using state equation in 3664 ms returned unknown
[2023-03-14 02:02:10] [INFO ] [Real]Absence check using 62 positive place invariants in 141 ms returned sat
[2023-03-14 02:02:11] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 421 ms returned sat
[2023-03-14 02:02:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:14] [INFO ] [Real]Absence check using state equation in 3617 ms returned unknown
[2023-03-14 02:02:15] [INFO ] [Real]Absence check using 62 positive place invariants in 144 ms returned sat
[2023-03-14 02:02:16] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 433 ms returned sat
[2023-03-14 02:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:19] [INFO ] [Real]Absence check using state equation in 3514 ms returned unknown
[2023-03-14 02:02:20] [INFO ] [Real]Absence check using 62 positive place invariants in 141 ms returned sat
[2023-03-14 02:02:21] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 169 ms returned unsat
[2023-03-14 02:02:22] [INFO ] [Real]Absence check using 62 positive place invariants in 133 ms returned sat
[2023-03-14 02:02:22] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 421 ms returned sat
[2023-03-14 02:02:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:26] [INFO ] [Real]Absence check using state equation in 3550 ms returned unknown
[2023-03-14 02:02:27] [INFO ] [Real]Absence check using 62 positive place invariants in 139 ms returned sat
[2023-03-14 02:02:27] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 419 ms returned sat
[2023-03-14 02:02:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:31] [INFO ] [Real]Absence check using state equation in 3557 ms returned unknown
[2023-03-14 02:02:32] [INFO ] [Real]Absence check using 62 positive place invariants in 132 ms returned sat
[2023-03-14 02:02:32] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 173 ms returned unsat
[2023-03-14 02:02:33] [INFO ] [Real]Absence check using 62 positive place invariants in 134 ms returned sat
[2023-03-14 02:02:33] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 415 ms returned sat
[2023-03-14 02:02:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:37] [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 11
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:02:38] [INFO ] [Real]Absence check using 62 positive place invariants in 131 ms returned sat
[2023-03-14 02:02:38] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 404 ms returned sat
[2023-03-14 02:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:42] [INFO ] [Real]Absence check using state equation in 3574 ms returned unknown
[2023-03-14 02:02:43] [INFO ] [Real]Absence check using 62 positive place invariants in 134 ms returned sat
[2023-03-14 02:02:43] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 154 ms returned unsat
[2023-03-14 02:02:44] [INFO ] [Real]Absence check using 62 positive place invariants in 131 ms returned sat
[2023-03-14 02:02:44] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 156 ms returned unsat
[2023-03-14 02:02:45] [INFO ] [Real]Absence check using 62 positive place invariants in 127 ms returned sat
[2023-03-14 02:02:46] [INFO ] [Real]Absence check using 62 positive and 859 generalized place invariants in 408 ms returned sat
[2023-03-14 02:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:02:49] [INFO ] [Real]Absence check using state equation in 3613 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 25, 1, 75, 1, 1, 1, 75, 1, 1, 1] Max seen :[0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 9748 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 9748/9748 places, 14659/14659 transitions.
Graph (complete) has 33897 edges and 9748 vertex of which 9712 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.50 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2397 transitions
Trivial Post-agglo rules discarded 2397 transitions
Performed 2397 trivial Post agglomeration. Transition count delta: 2397
Iterating post reduction 0 with 2397 rules applied. Total rules applied 2398 place count 9712 transition count 12262
Reduce places removed 2397 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 2399 rules applied. Total rules applied 4797 place count 7315 transition count 12260
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4799 place count 7313 transition count 12260
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 4799 place count 7313 transition count 12060
Deduced a syphon composed of 200 places in 11 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 5199 place count 7113 transition count 12060
Discarding 2197 places :
Symmetric choice reduction at 3 with 2197 rule applications. Total rules 7396 place count 4916 transition count 9863
Iterating global reduction 3 with 2197 rules applied. Total rules applied 9593 place count 4916 transition count 9863
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 9593 place count 4916 transition count 9858
Deduced a syphon composed of 5 places in 8 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 9603 place count 4911 transition count 9858
Discarding 547 places :
Symmetric choice reduction at 3 with 547 rule applications. Total rules 10150 place count 4364 transition count 7670
Iterating global reduction 3 with 547 rules applied. Total rules applied 10697 place count 4364 transition count 7670
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 5 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 10747 place count 4339 transition count 7645
Free-agglomeration rule (complex) applied 339 times.
Iterating global reduction 3 with 339 rules applied. Total rules applied 11086 place count 4339 transition count 8947
Reduce places removed 339 places and 0 transitions.
Iterating post reduction 3 with 339 rules applied. Total rules applied 11425 place count 4000 transition count 8947
Partial Free-agglomeration rule applied 75 times.
Drop transitions removed 75 transitions
Iterating global reduction 4 with 75 rules applied. Total rules applied 11500 place count 4000 transition count 8947
Applied a total of 11500 rules in 4921 ms. Remains 4000 /9748 variables (removed 5748) and now considering 8947/14659 (removed 5712) transitions.
Finished structural reductions, in 1 iterations. Remains : 4000/9748 places, 8947/14659 transitions.
Normalized transition count is 8061 out of 8947 initially.
// Phase 1: matrix 8061 rows 4000 cols
[2023-03-14 02:02:55] [INFO ] Computed 885 place invariants in 208 ms
Incomplete random walk after 1000000 steps, including 39702 resets, run finished after 24882 ms. (steps per millisecond=40 ) properties (out of 9) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3870 ms. (steps per millisecond=258 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000000 steps, including 4780 resets, run finished after 3882 ms. (steps per millisecond=257 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4780 resets, run finished after 3897 ms. (steps per millisecond=256 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3869 ms. (steps per millisecond=258 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4780 resets, run finished after 3874 ms. (steps per millisecond=258 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3877 ms. (steps per millisecond=257 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3894 ms. (steps per millisecond=256 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4780 resets, run finished after 3930 ms. (steps per millisecond=254 ) properties (out of 8) seen :2
[2023-03-14 02:03:50] [INFO ] Flow matrix only has 8061 transitions (discarded 886 similar events)
// Phase 1: matrix 8061 rows 4000 cols
[2023-03-14 02:03:51] [INFO ] Computed 885 place invariants in 202 ms
[2023-03-14 02:03:51] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:03:51] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 185 ms returned sat
[2023-03-14 02:03:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:03:54] [INFO ] [Real]Absence check using state equation in 2768 ms returned sat
[2023-03-14 02:03:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:03:55] [INFO ] [Nat]Absence check using 49 positive place invariants in 81 ms returned sat
[2023-03-14 02:03:55] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 211 ms returned sat
[2023-03-14 02:03:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:03:58] [INFO ] [Nat]Absence check using state equation in 3142 ms returned sat
[2023-03-14 02:03:58] [INFO ] State equation strengthened by 4402 read => feed constraints.
[2023-03-14 02:04:00] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1524 ms returned unsat
[2023-03-14 02:04:00] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:04:00] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 191 ms returned sat
[2023-03-14 02:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:03] [INFO ] [Real]Absence check using state equation in 3104 ms returned sat
[2023-03-14 02:04:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:04] [INFO ] [Nat]Absence check using 49 positive place invariants in 74 ms returned sat
[2023-03-14 02:04:04] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 195 ms returned sat
[2023-03-14 02:04:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:08] [INFO ] [Nat]Absence check using state equation in 3090 ms returned sat
[2023-03-14 02:04:09] [INFO ] [Nat]Added 4402 Read/Feed constraints in 1348 ms returned unsat
[2023-03-14 02:04:09] [INFO ] [Real]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-14 02:04:09] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 187 ms returned sat
[2023-03-14 02:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:12] [INFO ] [Real]Absence check using state equation in 2739 ms returned sat
[2023-03-14 02:04:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:13] [INFO ] [Nat]Absence check using 49 positive place invariants in 70 ms returned sat
[2023-03-14 02:04:13] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 209 ms returned sat
[2023-03-14 02:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:16] [INFO ] [Nat]Absence check using state equation in 3164 ms returned sat
[2023-03-14 02:04:19] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2433 ms returned unsat
[2023-03-14 02:04:19] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:04:19] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 95 ms returned unsat
[2023-03-14 02:04:20] [INFO ] [Real]Absence check using 49 positive place invariants in 75 ms returned sat
[2023-03-14 02:04:20] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 205 ms returned sat
[2023-03-14 02:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:23] [INFO ] [Real]Absence check using state equation in 2975 ms returned sat
[2023-03-14 02:04:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:24] [INFO ] [Nat]Absence check using 49 positive place invariants in 76 ms returned sat
[2023-03-14 02:04:24] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 205 ms returned sat
[2023-03-14 02:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:27] [INFO ] [Nat]Absence check using state equation in 3125 ms returned sat
[2023-03-14 02:04:27] [INFO ] [Nat]Added 4402 Read/Feed constraints in 540 ms returned unsat
[2023-03-14 02:04:28] [INFO ] [Real]Absence check using 49 positive place invariants in 69 ms returned sat
[2023-03-14 02:04:28] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 201 ms returned sat
[2023-03-14 02:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:31] [INFO ] [Real]Absence check using state equation in 2807 ms returned sat
[2023-03-14 02:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:04:32] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 208 ms returned sat
[2023-03-14 02:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:35] [INFO ] [Nat]Absence check using state equation in 3260 ms returned sat
[2023-03-14 02:04:37] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2412 ms returned unsat
[2023-03-14 02:04:38] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:04:38] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 102 ms returned unsat
[2023-03-14 02:04:38] [INFO ] [Real]Absence check using 49 positive place invariants in 73 ms returned sat
[2023-03-14 02:04:39] [INFO ] [Real]Absence check using 49 positive and 836 generalized place invariants in 201 ms returned sat
[2023-03-14 02:04:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:42] [INFO ] [Real]Absence check using state equation in 2963 ms returned sat
[2023-03-14 02:04:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 02:04:42] [INFO ] [Nat]Absence check using 49 positive place invariants in 78 ms returned sat
[2023-03-14 02:04:42] [INFO ] [Nat]Absence check using 49 positive and 836 generalized place invariants in 204 ms returned sat
[2023-03-14 02:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 02:04:46] [INFO ] [Nat]Absence check using state equation in 3209 ms returned sat
[2023-03-14 02:04:48] [INFO ] [Nat]Added 4402 Read/Feed constraints in 2633 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 1, 0, 0, 1, 0] Max seen :[0, 0, 0, 1, 0, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S24C04-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 176258 ms.

BK_STOP 1678759488851

--------------------
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-S24C04"
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-S24C04, 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-167856440400103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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