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.r479-smll-167912664200083.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 StigmergyElection-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r479-smll-167912664200083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 16:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 16:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 16:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 16:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:23 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 StigmergyElection-PT-08b-UpperBounds-00
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-01
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-02
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-03
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-04
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-05
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-06
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-07
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-08
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-09
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-10
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-11
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-12
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-13
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-14
FORMULA_NAME StigmergyElection-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679417642775

Running Version 202205111006
[2023-03-21 16:54:05] [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-21 16:54:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:54:06] [INFO ] Load time of PNML (sax parser for PT used): 1304 ms
[2023-03-21 16:54:06] [INFO ] Transformed 1107 places.
[2023-03-21 16:54:06] [INFO ] Transformed 14564 transitions.
[2023-03-21 16:54:06] [INFO ] Found NUPN structural information;
[2023-03-21 16:54:06] [INFO ] Parsed PT model containing 1107 places and 14564 transitions in 1584 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 14564 rows 1107 cols
[2023-03-21 16:54:07] [INFO ] Computed 9 place invariants in 625 ms
Incomplete random walk after 10000 steps, including 73 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 16) seen :8
FORMULA StigmergyElection-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
// Phase 1: matrix 14564 rows 1107 cols
[2023-03-21 16:54:08] [INFO ] Computed 9 place invariants in 346 ms
[2023-03-21 16:54:09] [INFO ] [Real]Absence check using 9 positive place invariants in 33 ms returned sat
[2023-03-21 16:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:14] [INFO ] [Real]Absence check using state equation in 4395 ms returned unknown
[2023-03-21 16:54:14] [INFO ] [Real]Absence check using 9 positive place invariants in 38 ms returned sat
[2023-03-21 16:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:19] [INFO ] [Real]Absence check using state equation in 4622 ms returned unknown
[2023-03-21 16:54:19] [INFO ] [Real]Absence check using 9 positive place invariants in 43 ms returned sat
[2023-03-21 16:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:24] [INFO ] [Real]Absence check using state equation in 4648 ms returned unknown
[2023-03-21 16:54:24] [INFO ] [Real]Absence check using 9 positive place invariants in 35 ms returned sat
[2023-03-21 16:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-21 16:54:29] [INFO ] [Real]Absence check using 9 positive place invariants in 26 ms returned sat
[2023-03-21 16:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:34] [INFO ] [Real]Absence check using state equation in 4737 ms returned unknown
[2023-03-21 16:54:34] [INFO ] [Real]Absence check using 9 positive place invariants in 27 ms returned sat
[2023-03-21 16:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java: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-21 16:54:39] [INFO ] [Real]Absence check using 9 positive place invariants in 26 ms returned sat
[2023-03-21 16:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:44] [INFO ] [Real]Absence check using state equation in 4748 ms returned unknown
[2023-03-21 16:54:44] [INFO ] [Real]Absence check using 9 positive place invariants in 43 ms returned sat
[2023-03-21 16:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:54:49] [INFO ] [Real]Absence check using state equation in 4627 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 1107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1107/1107 places, 14564/14564 transitions.
Graph (trivial) has 1112 edges and 1107 vertex of which 147 / 1107 are part of one of the 22 SCC in 16 ms
Free SCC test removed 125 places
Drop transitions removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Graph (complete) has 2413 edges and 982 vertex of which 966 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.109 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 703 transitions
Trivial Post-agglo rules discarded 703 transitions
Performed 703 trivial Post agglomeration. Transition count delta: 703
Iterating post reduction 0 with 711 rules applied. Total rules applied 713 place count 966 transition count 13685
Reduce places removed 703 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 747 rules applied. Total rules applied 1460 place count 263 transition count 13641
Reduce places removed 22 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 27 rules applied. Total rules applied 1487 place count 241 transition count 13636
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1492 place count 236 transition count 13636
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 1492 place count 236 transition count 13615
Deduced a syphon composed of 21 places in 11 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 1534 place count 215 transition count 13615
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1596 place count 153 transition count 13553
Iterating global reduction 4 with 62 rules applied. Total rules applied 1658 place count 153 transition count 13553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 1660 place count 153 transition count 13551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1661 place count 152 transition count 13551
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 1661 place count 152 transition count 13548
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1667 place count 149 transition count 13548
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1687 place count 129 transition count 1056
Iterating global reduction 6 with 20 rules applied. Total rules applied 1707 place count 129 transition count 1056
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 1722 place count 129 transition count 1041
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1766 place count 107 transition count 1019
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1767 place count 107 transition count 1018
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 1773 place count 101 transition count 1012
Iterating global reduction 8 with 6 rules applied. Total rules applied 1779 place count 101 transition count 1012
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 1795 place count 93 transition count 1019
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1803 place count 93 transition count 1011
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1805 place count 92 transition count 1017
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1813 place count 92 transition count 1009
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1815 place count 91 transition count 1015
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1823 place count 91 transition count 1007
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1825 place count 90 transition count 1013
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1833 place count 90 transition count 1005
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1835 place count 89 transition count 1011
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1843 place count 89 transition count 1003
Free-agglomeration rule applied 43 times.
Iterating global reduction 8 with 43 rules applied. Total rules applied 1886 place count 89 transition count 960
Reduce places removed 43 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 8 with 76 rules applied. Total rules applied 1962 place count 46 transition count 927
Drop transitions removed 127 transitions
Redundant transition composition rules discarded 127 transitions
Iterating global reduction 9 with 127 rules applied. Total rules applied 2089 place count 46 transition count 800
Applied a total of 2089 rules in 4122 ms. Remains 46 /1107 variables (removed 1061) and now considering 800/14564 (removed 13764) transitions.
Finished structural reductions, in 1 iterations. Remains : 46/1107 places, 800/14564 transitions.
// Phase 1: matrix 800 rows 46 cols
[2023-03-21 16:54:53] [INFO ] Computed 9 place invariants in 13 ms
Finished random walk after 804716 steps, including 2 resets, run visited all 8 properties in 30001 ms. (steps per millisecond=26 )
FORMULA StigmergyElection-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 78056 ms.

BK_STOP 1679417723409

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-08b"
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 StigmergyElection-PT-08b, 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 r479-smll-167912664200083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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