Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 07:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:43 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-S16C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716624078838

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 08:01:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 08:01:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:01:20] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2024-05-25 08:01:20] [INFO ] Transformed 2952 places.
[2024-05-25 08:01:20] [INFO ] Transformed 4255 transitions.
[2024-05-25 08:01:20] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 296 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 3983 out of 4255 initially.
// Phase 1: matrix 3983 rows 2952 cols
[2024-05-25 08:01:21] [INFO ] Computed 421 invariants in 267 ms
Incomplete random walk after 10000 steps, including 468 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :9
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 116 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :4
[2024-05-25 08:01:21] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2024-05-25 08:01:21] [INFO ] Computed 421 invariants in 100 ms
[2024-05-25 08:01:22] [INFO ] [Real]Absence check using 42 positive place invariants in 56 ms returned sat
[2024-05-25 08:01:22] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 137 ms returned unsat
[2024-05-25 08:01:22] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2024-05-25 08:01:22] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned unsat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 42 positive place invariants in 34 ms returned sat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 128 ms returned unsat
[2024-05-25 08:01:23] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2024-05-25 08:01:24] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 116 ms returned sat
[2024-05-25 08:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:25] [INFO ] [Real]Absence check using state equation in 1500 ms returned sat
[2024-05-25 08:01:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:01:26] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2024-05-25 08:01:26] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 115 ms returned sat
[2024-05-25 08:01:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:28] [INFO ] [Nat]Absence check using state equation in 1711 ms returned sat
[2024-05-25 08:01:28] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2024-05-25 08:01:28] [INFO ] [Nat]Added 1090 Read/Feed constraints in 114 ms returned unsat
[2024-05-25 08:01:28] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2024-05-25 08:01:28] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 106 ms returned unsat
[2024-05-25 08:01:28] [INFO ] [Real]Absence check using 42 positive place invariants in 30 ms returned sat
[2024-05-25 08:01:28] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 122 ms returned unsat
[2024-05-25 08:01:29] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2024-05-25 08:01:29] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 114 ms returned sat
[2024-05-25 08:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:30] [INFO ] [Real]Absence check using state equation in 1566 ms returned sat
[2024-05-25 08:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 08:01:31] [INFO ] [Nat]Absence check using 42 positive place invariants in 33 ms returned sat
[2024-05-25 08:01:31] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 113 ms returned sat
[2024-05-25 08:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 08:01:33] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2024-05-25 08:01:33] [INFO ] [Nat]Added 1090 Read/Feed constraints in 370 ms returned sat
[2024-05-25 08:01:35] [INFO ] Deduced a trap composed of 335 places in 2105 ms of which 10 ms to minimize.
[2024-05-25 08:01:37] [INFO ] Deduced a trap composed of 679 places in 1884 ms of which 4 ms to minimize.
[2024-05-25 08:01: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 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-25 08:01:38] [INFO ] [Real]Absence check using 42 positive place invariants in 41 ms returned sat
[2024-05-25 08:01:38] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 106 ms returned unsat
[2024-05-25 08:01:38] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2024-05-25 08:01:38] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 114 ms returned unsat
[2024-05-25 08:01:38] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2024-05-25 08:01:39] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2024-05-25 08:01:39] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2024-05-25 08:01:39] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 109 ms returned unsat
[2024-05-25 08:01:39] [INFO ] [Real]Absence check using 42 positive place invariants in 31 ms returned sat
[2024-05-25 08:01:39] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2024-05-25 08:01:40] [INFO ] [Real]Absence check using 42 positive place invariants in 35 ms returned sat
[2024-05-25 08:01:40] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 110 ms returned unsat
[2024-05-25 08:01:40] [INFO ] [Real]Absence check using 42 positive place invariants in 32 ms returned sat
[2024-05-25 08:01:40] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 111 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 0, 1, 1, 51, 1, 1, 1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.12 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 544 place count 2928 transition count 3712
Reduce places removed 543 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 544 rules applied. Total rules applied 1088 place count 2385 transition count 3711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1089 place count 2384 transition count 3711
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1089 place count 2384 transition count 3643
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1225 place count 2316 transition count 3643
Discarding 475 places :
Symmetric choice reduction at 3 with 475 rule applications. Total rules 1700 place count 1841 transition count 3168
Iterating global reduction 3 with 475 rules applied. Total rules applied 2175 place count 1841 transition count 3168
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2175 place count 1841 transition count 3165
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2181 place count 1838 transition count 3165
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 2418 place count 1601 transition count 2691
Iterating global reduction 3 with 237 rules applied. Total rules applied 2655 place count 1601 transition count 2691
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2689 place count 1584 transition count 2674
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 2850 place count 1584 transition count 2750
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 3011 place count 1423 transition count 2750
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 3028 place count 1423 transition count 2750
Applied a total of 3028 rules in 1417 ms. Remains 1423 /2952 variables (removed 1529) and now considering 2750/4255 (removed 1505) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1421 ms. Remains : 1423/2952 places, 2750/4255 transitions.
Normalized transition count is 2352 out of 2750 initially.
// Phase 1: matrix 2352 rows 1423 cols
[2024-05-25 08:01:42] [INFO ] Computed 397 invariants in 32 ms
Incomplete random walk after 1000000 steps, including 76165 resets, run finished after 7434 ms. (steps per millisecond=134 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 12965 resets, run finished after 1884 ms. (steps per millisecond=530 ) properties (out of 1) seen :1
[2024-05-25 08:01:51] [INFO ] Flow matrix only has 2352 transitions (discarded 398 similar events)
// Phase 1: matrix 2352 rows 1423 cols
[2024-05-25 08:01:51] [INFO ] Computed 397 invariants in 51 ms
[2024-05-25 08:01:51] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-25 08:01:51] [INFO ] [Real]Absence check using 33 positive and 364 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 31390 ms.

BK_STOP 1716624113147

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S16C02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is MultiCrashLeafsetExtension-PT-S16C02, 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 r263-tall-171654371800001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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