Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.8K Apr 30 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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 CloudDeployment-PT-5b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-5b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652523613529

Running Version 0
[2022-05-14 10:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 10:20:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 10:20:17] [INFO ] Load time of PNML (sax parser for PT used): 419 ms
[2022-05-14 10:20:17] [INFO ] Transformed 1525 places.
[2022-05-14 10:20:17] [INFO ] Transformed 3132 transitions.
[2022-05-14 10:20:17] [INFO ] Found NUPN structural information;
[2022-05-14 10:20:17] [INFO ] Parsed PT model containing 1525 places and 3132 transitions in 522 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 3132 rows 1525 cols
[2022-05-14 10:20:17] [INFO ] Computed 21 place invariants in 103 ms
Incomplete random walk after 10000 steps, including 58 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :9
FORMULA CloudDeployment-PT-5b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
// Phase 1: matrix 3132 rows 1525 cols
[2022-05-14 10:20:18] [INFO ] Computed 21 place invariants in 94 ms
[2022-05-14 10:20:19] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 74 ms returned sat
[2022-05-14 10:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:20] [INFO ] [Real]Absence check using state equation in 1376 ms returned sat
[2022-05-14 10:20:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:21] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 80 ms returned sat
[2022-05-14 10:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:23] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2022-05-14 10:20:24] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 794 ms.
[2022-05-14 10:20:26] [INFO ] Added : 30 causal constraints over 6 iterations in 2099 ms. Result :unknown
[2022-05-14 10:20:26] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 77 ms returned sat
[2022-05-14 10:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:28] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2022-05-14 10:20:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:28] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 76 ms returned sat
[2022-05-14 10:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:30] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2022-05-14 10:20:30] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 652 ms.
[2022-05-14 10:20:33] [INFO ] Added : 55 causal constraints over 11 iterations in 3211 ms. Result :unknown
[2022-05-14 10:20:33] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 66 ms returned sat
[2022-05-14 10:20:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:35] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2022-05-14 10:20:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:36] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 77 ms returned sat
[2022-05-14 10:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:38] [INFO ] [Nat]Absence check using state equation in 2164 ms returned sat
[2022-05-14 10:20:38] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 430 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-14 10:20:40] [INFO ] Added : 35 causal constraints over 7 iterations in 2229 ms. Result :unknown
[2022-05-14 10:20:41] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 76 ms returned sat
[2022-05-14 10:20:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:42] [INFO ] [Real]Absence check using state equation in 1642 ms returned sat
[2022-05-14 10:20:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:43] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 72 ms returned sat
[2022-05-14 10:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:45] [INFO ] [Nat]Absence check using state equation in 1769 ms returned sat
[2022-05-14 10:20:45] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 346 ms.
[2022-05-14 10:20:48] [INFO ] Added : 40 causal constraints over 8 iterations in 2753 ms. Result :unknown
[2022-05-14 10:20:48] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 76 ms returned sat
[2022-05-14 10:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:50] [INFO ] [Real]Absence check using state equation in 1528 ms returned sat
[2022-05-14 10:20:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:50] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 48 ms returned sat
[2022-05-14 10:20:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:51] [INFO ] [Nat]Absence check using state equation in 1319 ms returned sat
[2022-05-14 10:20:52] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 416 ms.
[2022-05-14 10:20:55] [INFO ] Added : 50 causal constraints over 10 iterations in 3268 ms. Result :unknown
[2022-05-14 10:20:55] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 75 ms returned sat
[2022-05-14 10:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:20:57] [INFO ] [Real]Absence check using state equation in 1909 ms returned sat
[2022-05-14 10:20:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:20:58] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 52 ms returned sat
[2022-05-14 10:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:00] [INFO ] [Nat]Absence check using state equation in 1760 ms returned sat
[2022-05-14 10:21:00] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 366 ms.
[2022-05-14 10:21:03] [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 5
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-14 10:21:03] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 77 ms returned sat
[2022-05-14 10:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:05] [INFO ] [Real]Absence check using state equation in 1868 ms returned sat
[2022-05-14 10:21:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 10:21:06] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 77 ms returned sat
[2022-05-14 10:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 10:21:07] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2022-05-14 10:21:08] [INFO ] Computed and/alt/rep : 1754/2979/1754 causal constraints (skipped 1377 transitions) in 381 ms.
[2022-05-14 10:21:10] [INFO ] Added : 50 causal constraints over 10 iterations in 3010 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 1525 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Graph (trivial) has 1538 edges and 1525 vertex of which 413 / 1525 are part of one of the 39 SCC in 54 ms
Free SCC test removed 374 places
Drop transitions removed 1482 transitions
Reduce isomorphic transitions removed 1482 transitions.
Graph (complete) has 3269 edges and 1151 vertex of which 1114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.16 ms
Discarding 37 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 567 rules applied. Total rules applied 569 place count 1114 transition count 1078
Reduce places removed 547 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 550 rules applied. Total rules applied 1119 place count 567 transition count 1075
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1122 place count 564 transition count 1075
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 1122 place count 564 transition count 1056
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 1160 place count 545 transition count 1056
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1397 place count 308 transition count 819
Iterating global reduction 3 with 237 rules applied. Total rules applied 1634 place count 308 transition count 819
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1654 place count 308 transition count 799
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1654 place count 308 transition count 776
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1700 place count 285 transition count 776
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1703 place count 282 transition count 773
Iterating global reduction 4 with 3 rules applied. Total rules applied 1706 place count 282 transition count 773
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1708 place count 280 transition count 771
Iterating global reduction 4 with 2 rules applied. Total rules applied 1710 place count 280 transition count 771
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1711 place count 279 transition count 770
Iterating global reduction 4 with 1 rules applied. Total rules applied 1712 place count 279 transition count 770
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1860 place count 205 transition count 696
Performed 35 Post agglomeration using F-continuation condition with reduction of 70 identical transitions.
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1930 place count 170 transition count 888
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1944 place count 170 transition count 874
Drop transitions removed 152 transitions
Redundant transition composition rules discarded 152 transitions
Iterating global reduction 5 with 152 rules applied. Total rules applied 2096 place count 170 transition count 722
Free-agglomeration rule applied 49 times with reduction of 20 identical transitions.
Iterating global reduction 5 with 49 rules applied. Total rules applied 2145 place count 170 transition count 653
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 93 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 919 edges and 121 vertex of which 120 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 188 rules applied. Total rules applied 2333 place count 120 transition count 515
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2334 place count 120 transition count 514
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2337 place count 117 transition count 496
Iterating global reduction 7 with 3 rules applied. Total rules applied 2340 place count 117 transition count 496
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 7 with 75 rules applied. Total rules applied 2415 place count 117 transition count 421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2416 place count 116 transition count 420
Applied a total of 2416 rules in 748 ms. Remains 116 /1525 variables (removed 1409) and now considering 420/3132 (removed 2712) transitions.
Finished structural reductions, in 1 iterations. Remains : 116/1525 places, 420/3132 transitions.
Normalized transition count is 220 out of 420 initially.
// Phase 1: matrix 220 rows 116 cols
[2022-05-14 10:21:11] [INFO ] Computed 19 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 14643 resets, run finished after 3207 ms. (steps per millisecond=311 ) properties (out of 7) seen :7
FORMULA CloudDeployment-PT-5b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-5b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652523675950

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is CloudDeployment-PT-5b, 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 r046-smll-165252115700022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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