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.r294-smll-165463872500173.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 itstools
Input is StigmergyCommit-PT-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872500173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 6.0K May 30 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 30 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 14:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 5.4M May 29 12:20 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 StigmergyCommit-PT-07a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654791444566

Running Version 202205111006
[2022-06-09 16:17:26] [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-06-09 16:17:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 16:17:27] [INFO ] Load time of PNML (sax parser for PT used): 940 ms
[2022-06-09 16:17:27] [INFO ] Transformed 292 places.
[2022-06-09 16:17:27] [INFO ] Transformed 7108 transitions.
[2022-06-09 16:17:27] [INFO ] Found NUPN structural information;
[2022-06-09 16:17:27] [INFO ] Parsed PT model containing 292 places and 7108 transitions in 1214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
Normalized transition count is 866 out of 890 initially.
// Phase 1: matrix 866 rows 292 cols
[2022-06-09 16:17:27] [INFO ] Computed 9 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 496 ms. (steps per millisecond=20 ) properties (out of 16) seen :8
FORMULA StigmergyCommit-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
[2022-06-09 16:17:28] [INFO ] Flow matrix only has 866 transitions (discarded 24 similar events)
// Phase 1: matrix 866 rows 292 cols
[2022-06-09 16:17:28] [INFO ] Computed 9 place invariants in 8 ms
[2022-06-09 16:17:28] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2022-06-09 16:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:29] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2022-06-09 16:17:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 16:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:30] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2022-06-09 16:17:30] [INFO ] State equation strengthened by 621 read => feed constraints.
[2022-06-09 16:17:30] [INFO ] [Nat]Added 621 Read/Feed constraints in 261 ms returned sat
[2022-06-09 16:17:31] [INFO ] Deduced a trap composed of 19 places in 798 ms of which 7 ms to minimize.
[2022-06-09 16:17:32] [INFO ] Deduced a trap composed of 19 places in 719 ms of which 3 ms to minimize.
[2022-06-09 16:17:32] [INFO ] Deduced a trap composed of 16 places in 483 ms of which 76 ms to minimize.
[2022-06-09 16:17:33] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 2 ms to minimize.
[2022-06-09 16:17:33] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 2 ms to minimize.
[2022-06-09 16:17:34] [INFO ] Deduced a trap composed of 16 places in 475 ms of which 1 ms to minimize.
[2022-06-09 16:17:34] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2022-06-09 16:17:34] [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 0
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
[2022-06-09 16:17:34] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-09 16:17:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:35] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-09 16:17:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 16:17:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:35] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2022-06-09 16:17:35] [INFO ] [Nat]Added 621 Read/Feed constraints in 143 ms returned sat
[2022-06-09 16:17:36] [INFO ] Deduced a trap composed of 17 places in 481 ms of which 2 ms to minimize.
[2022-06-09 16:17:36] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 1 ms to minimize.
[2022-06-09 16:17:36] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 0 ms to minimize.
[2022-06-09 16:17:37] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 0 ms to minimize.
[2022-06-09 16:17:37] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 1 ms to minimize.
[2022-06-09 16:17:37] [INFO ] Deduced a trap composed of 17 places in 201 ms of which 1 ms to minimize.
[2022-06-09 16:17:37] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 0 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 1 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-06-09 16:17:38] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 0 ms to minimize.
[2022-06-09 16:17:39] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 1 ms to minimize.
[2022-06-09 16:17:39] [INFO ] Deduced a trap composed of 16 places in 224 ms of which 0 ms to minimize.
[2022-06-09 16:17:39] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-09 16:17:39] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-09 16:17:39] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2022-06-09 16:17:40] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 4360 ms
[2022-06-09 16:17:40] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 181 ms.
[2022-06-09 16:17:40] [INFO ] Added : 0 causal constraints over 0 iterations in 183 ms. Result :unknown
[2022-06-09 16:17:40] [INFO ] [Real]Absence check using 9 positive place invariants in 40 ms returned sat
[2022-06-09 16:17:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:40] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2022-06-09 16:17:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2022-06-09 16:17:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:41] [INFO ] [Nat]Absence check using state equation in 460 ms returned sat
[2022-06-09 16:17:41] [INFO ] [Nat]Added 621 Read/Feed constraints in 219 ms returned sat
[2022-06-09 16:17:42] [INFO ] Deduced a trap composed of 16 places in 387 ms of which 1 ms to minimize.
[2022-06-09 16:17:42] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 1 ms to minimize.
[2022-06-09 16:17:43] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 1 ms to minimize.
[2022-06-09 16:17:43] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2022-06-09 16:17:43] [INFO ] Deduced a trap composed of 18 places in 192 ms of which 0 ms to minimize.
[2022-06-09 16:17:44] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2022-06-09 16:17:44] [INFO ] Deduced a trap composed of 16 places in 315 ms of which 1 ms to minimize.
[2022-06-09 16:17:44] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2022-06-09 16:17:44] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 0 ms to minimize.
[2022-06-09 16:17:44] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-06-09 16:17:45] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-09 16:17:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3280 ms
[2022-06-09 16:17:45] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 144 ms.
[2022-06-09 16:17:46] [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 2
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.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
[2022-06-09 16:17:46] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-09 16:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:46] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2022-06-09 16:17:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 16:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:46] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2022-06-09 16:17:47] [INFO ] [Nat]Added 621 Read/Feed constraints in 152 ms returned sat
[2022-06-09 16:17:47] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 1 ms to minimize.
[2022-06-09 16:17:47] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 1 ms to minimize.
[2022-06-09 16:17:48] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2022-06-09 16:17:48] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 1 ms to minimize.
[2022-06-09 16:17:49] [INFO ] Deduced a trap composed of 19 places in 276 ms of which 1 ms to minimize.
[2022-06-09 16:17:49] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2022-06-09 16:17:49] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 1 ms to minimize.
[2022-06-09 16:17:49] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 0 ms to minimize.
[2022-06-09 16:17:50] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 0 ms to minimize.
[2022-06-09 16:17:50] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 0 ms to minimize.
[2022-06-09 16:17:50] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 1 ms to minimize.
[2022-06-09 16:17:50] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2022-06-09 16:17:51] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 1 ms to minimize.
[2022-06-09 16:17:51] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 2 ms to minimize.
[2022-06-09 16:17:51] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 0 ms to minimize.
[2022-06-09 16:17:51] [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 3
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.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
[2022-06-09 16:17:51] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 16:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:51] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2022-06-09 16:17:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-09 16:17:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:52] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-06-09 16:17:52] [INFO ] [Nat]Added 621 Read/Feed constraints in 169 ms returned sat
[2022-06-09 16:17:52] [INFO ] Deduced a trap composed of 16 places in 436 ms of which 1 ms to minimize.
[2022-06-09 16:17:53] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 0 ms to minimize.
[2022-06-09 16:17:53] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 1 ms to minimize.
[2022-06-09 16:17:53] [INFO ] Deduced a trap composed of 17 places in 209 ms of which 1 ms to minimize.
[2022-06-09 16:17:54] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 0 ms to minimize.
[2022-06-09 16:17:54] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 2 ms to minimize.
[2022-06-09 16:17:54] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 1 ms to minimize.
[2022-06-09 16:17:54] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 0 ms to minimize.
[2022-06-09 16:17:54] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2022-06-09 16:17:55] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 1 ms to minimize.
[2022-06-09 16:17:55] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2022-06-09 16:17:55] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2022-06-09 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3001 ms
[2022-06-09 16:17:55] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 89 ms.
[2022-06-09 16:17:56] [INFO ] Added : 67 causal constraints over 14 iterations in 908 ms. Result :sat
Minimization took 206 ms.
[2022-06-09 16:17:56] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-09 16:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:57] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-06-09 16:17:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:17:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 11 ms returned sat
[2022-06-09 16:17:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:17:57] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-06-09 16:17:57] [INFO ] [Nat]Added 621 Read/Feed constraints in 146 ms returned sat
[2022-06-09 16:17:58] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 2 ms to minimize.
[2022-06-09 16:17:58] [INFO ] Deduced a trap composed of 16 places in 285 ms of which 1 ms to minimize.
[2022-06-09 16:17:58] [INFO ] Deduced a trap composed of 16 places in 350 ms of which 1 ms to minimize.
[2022-06-09 16:17:59] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 1 ms to minimize.
[2022-06-09 16:17:59] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 3 ms to minimize.
[2022-06-09 16:17:59] [INFO ] Deduced a trap composed of 17 places in 181 ms of which 0 ms to minimize.
[2022-06-09 16:17:59] [INFO ] Deduced a trap composed of 17 places in 220 ms of which 1 ms to minimize.
[2022-06-09 16:18:00] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 1 ms to minimize.
[2022-06-09 16:18:00] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 1 ms to minimize.
[2022-06-09 16:18:00] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2022-06-09 16:18:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2838 ms
[2022-06-09 16:18:00] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 88 ms.
[2022-06-09 16:18:01] [INFO ] Added : 63 causal constraints over 13 iterations in 834 ms. Result :sat
Minimization took 262 ms.
[2022-06-09 16:18:01] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2022-06-09 16:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:18:01] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2022-06-09 16:18:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:18:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2022-06-09 16:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:18:02] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2022-06-09 16:18:02] [INFO ] [Nat]Added 621 Read/Feed constraints in 144 ms returned sat
[2022-06-09 16:18:02] [INFO ] Deduced a trap composed of 16 places in 287 ms of which 1 ms to minimize.
[2022-06-09 16:18:03] [INFO ] Deduced a trap composed of 17 places in 258 ms of which 0 ms to minimize.
[2022-06-09 16:18:03] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 0 ms to minimize.
[2022-06-09 16:18:03] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 1 ms to minimize.
[2022-06-09 16:18:03] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 0 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 16 places in 170 ms of which 0 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 0 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 4 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 0 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-06-09 16:18:04] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2410 ms
[2022-06-09 16:18:04] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 90 ms.
[2022-06-09 16:18:05] [INFO ] Added : 61 causal constraints over 13 iterations in 987 ms. Result :sat
Minimization took 234 ms.
[2022-06-09 16:18:06] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2022-06-09 16:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 16:18:06] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-09 16:18:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 16:18:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2022-06-09 16:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 16:18:06] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2022-06-09 16:18:07] [INFO ] [Nat]Added 621 Read/Feed constraints in 292 ms returned sat
[2022-06-09 16:18:07] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 0 ms to minimize.
[2022-06-09 16:18:07] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 0 ms to minimize.
[2022-06-09 16:18:07] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2022-06-09 16:18:08] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 0 ms to minimize.
[2022-06-09 16:18:08] [INFO ] Deduced a trap composed of 16 places in 144 ms of which 0 ms to minimize.
[2022-06-09 16:18:08] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2022-06-09 16:18:08] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2022-06-09 16:18:08] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2022-06-09 16:18:09] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-06-09 16:18:09] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1956 ms
[2022-06-09 16:18:09] [INFO ] Computed and/alt/rep : 330/418/330 causal constraints (skipped 535 transitions) in 101 ms.
[2022-06-09 16:18:10] [INFO ] Added : 65 causal constraints over 13 iterations in 1398 ms. Result :sat
Minimization took 234 ms.
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]
FORMULA StigmergyCommit-PT-07a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 292 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 292/292 places, 890/890 transitions.
Graph (complete) has 651 edges and 292 vertex of which 284 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.13 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 284 transition count 810
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 86 rules applied. Total rules applied 159 place count 237 transition count 771
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 168 place count 229 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 228 transition count 770
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 54 Pre rules applied. Total rules applied 169 place count 228 transition count 716
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 277 place count 174 transition count 716
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 318 place count 133 transition count 675
Iterating global reduction 4 with 41 rules applied. Total rules applied 359 place count 133 transition count 675
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 400 place count 92 transition count 634
Iterating global reduction 4 with 41 rules applied. Total rules applied 441 place count 92 transition count 634
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 263 transitions.
Iterating post reduction 4 with 263 rules applied. Total rules applied 704 place count 92 transition count 371
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 713 place count 83 transition count 362
Iterating global reduction 5 with 9 rules applied. Total rules applied 722 place count 83 transition count 362
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 729 place count 76 transition count 355
Iterating global reduction 5 with 7 rules applied. Total rules applied 736 place count 76 transition count 355
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 742 place count 76 transition count 349
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 772 place count 61 transition count 334
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 786 place count 61 transition count 320
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 793 place count 54 transition count 313
Iterating global reduction 7 with 7 rules applied. Total rules applied 800 place count 54 transition count 313
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 807 place count 47 transition count 306
Iterating global reduction 7 with 7 rules applied. Total rules applied 814 place count 47 transition count 306
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 821 place count 40 transition count 299
Iterating global reduction 7 with 7 rules applied. Total rules applied 828 place count 40 transition count 299
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 830 place count 40 transition count 297
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 832 place count 40 transition count 297
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 833 place count 40 transition count 296
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 834 place count 39 transition count 295
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 6 rules applied. Total rules applied 840 place count 38 transition count 290
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 845 place count 33 transition count 290
Performed 11 Post agglomeration using F-continuation condition with reduction of 247 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 867 place count 22 transition count 32
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 874 place count 22 transition count 25
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 19 rules applied. Total rules applied 893 place count 10 transition count 18
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 900 place count 10 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 901 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 902 place count 9 transition count 9
Applied a total of 902 rules in 324 ms. Remains 9 /292 variables (removed 283) and now considering 9/890 (removed 881) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/292 places, 9/890 transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-06-09 16:18:11] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=1773 ) properties (out of 3) seen :3
FORMULA StigmergyCommit-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 45631 ms.

BK_STOP 1654791492044

--------------------
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="StigmergyCommit-PT-07a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is StigmergyCommit-PT-07a, 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 r294-smll-165463872500173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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