fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r453-smll-167912645400437
Last Updated
May 14, 2023

About the Execution of ITS-Tools for StigmergyCommit-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
365.896 74403.00 93890.00 549.70 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 10:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 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 627K 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 StigmergyCommit-PT-04b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679339506496

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-20 19:11:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-20 19:11:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:11:49] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2023-03-20 19:11:49] [INFO ] Transformed 1534 places.
[2023-03-20 19:11:49] [INFO ] Transformed 2136 transitions.
[2023-03-20 19:11:49] [INFO ] Found NUPN structural information;
[2023-03-20 19:11:49] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 2136 rows 1534 cols
[2023-03-20 19:11:50] [INFO ] Computed 6 place invariants in 102 ms
Incomplete random walk after 10000 steps, including 106 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-20 19:11:50] [INFO ] Invariant cache hit.
[2023-03-20 19:11:51] [INFO ] [Real]Absence check using 6 positive place invariants in 43 ms returned sat
[2023-03-20 19:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:11:52] [INFO ] [Real]Absence check using state equation in 1346 ms returned sat
[2023-03-20 19:11:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:11:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 69 ms returned sat
[2023-03-20 19:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:11:54] [INFO ] [Nat]Absence check using state equation in 1159 ms returned sat
[2023-03-20 19:11:55] [INFO ] Deduced a trap composed of 398 places in 1180 ms of which 6 ms to minimize.
[2023-03-20 19:11:57] [INFO ] Deduced a trap composed of 397 places in 1753 ms of which 3 ms to minimize.
[2023-03-20 19:11:59] [INFO ] Deduced a trap composed of 20 places in 1619 ms of which 4 ms to minimize.
[2023-03-20 19:11:59] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:11:59] [INFO ] [Real]Absence check using 6 positive place invariants in 57 ms returned sat
[2023-03-20 19:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:01] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2023-03-20 19:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 39 ms returned sat
[2023-03-20 19:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:02] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2023-03-20 19:12:04] [INFO ] Deduced a trap composed of 399 places in 1954 ms of which 6 ms to minimize.
[2023-03-20 19:12:06] [INFO ] Deduced a trap composed of 583 places in 1714 ms of which 2 ms to minimize.
[2023-03-20 19:12:06] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:12:07] [INFO ] [Real]Absence check using 6 positive place invariants in 54 ms returned sat
[2023-03-20 19:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:08] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2023-03-20 19:12:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-20 19:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:10] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2023-03-20 19:12:11] [INFO ] Deduced a trap composed of 397 places in 1586 ms of which 2 ms to minimize.
[2023-03-20 19:12:13] [INFO ] Deduced a trap composed of 398 places in 1625 ms of which 2 ms to minimize.
[2023-03-20 19:12:13] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3488 ms
[2023-03-20 19:12:14] [INFO ] [Real]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-20 19:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:15] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2023-03-20 19:12:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 37 ms returned sat
[2023-03-20 19:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:16] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2023-03-20 19:12:18] [INFO ] Deduced a trap composed of 491 places in 1290 ms of which 2 ms to minimize.
[2023-03-20 19:12:19] [INFO ] Deduced a trap composed of 396 places in 1200 ms of which 2 ms to minimize.
[2023-03-20 19:12:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2869 ms
[2023-03-20 19:12:19] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 289 ms.
[2023-03-20 19:12:20] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:12:20] [INFO ] [Real]Absence check using 6 positive place invariants in 56 ms returned sat
[2023-03-20 19:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:22] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2023-03-20 19:12:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-20 19:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:23] [INFO ] [Nat]Absence check using state equation in 1113 ms returned sat
[2023-03-20 19:12:25] [INFO ] Deduced a trap composed of 401 places in 1477 ms of which 2 ms to minimize.
[2023-03-20 19:12:26] [INFO ] Deduced a trap composed of 396 places in 1571 ms of which 2 ms to minimize.
[2023-03-20 19:12:28] [INFO ] Deduced a trap composed of 397 places in 1083 ms of which 2 ms to minimize.
[2023-03-20 19:12:28] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:12:28] [INFO ] [Real]Absence check using 6 positive place invariants in 58 ms returned sat
[2023-03-20 19:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:30] [INFO ] [Real]Absence check using state equation in 1379 ms returned sat
[2023-03-20 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-20 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:31] [INFO ] [Nat]Absence check using state equation in 985 ms returned sat
[2023-03-20 19:12:32] [INFO ] Deduced a trap composed of 403 places in 1305 ms of which 1 ms to minimize.
[2023-03-20 19:12:34] [INFO ] Deduced a trap composed of 397 places in 1466 ms of which 2 ms to minimize.
[2023-03-20 19:12:36] [INFO ] Deduced a trap composed of 396 places in 1222 ms of which 2 ms to minimize.
[2023-03-20 19:12:36] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 19:12:36] [INFO ] [Real]Absence check using 6 positive place invariants in 54 ms returned sat
[2023-03-20 19:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:37] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2023-03-20 19:12:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 37 ms returned sat
[2023-03-20 19:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:39] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2023-03-20 19:12:40] [INFO ] Deduced a trap composed of 396 places in 1418 ms of which 2 ms to minimize.
[2023-03-20 19:12:42] [INFO ] Deduced a trap composed of 397 places in 1412 ms of which 2 ms to minimize.
[2023-03-20 19:12:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3166 ms
[2023-03-20 19:12:42] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 275 ms.
[2023-03-20 19:12:42] [INFO ] Added : 5 causal constraints over 1 iterations in 420 ms. Result :unknown
[2023-03-20 19:12:43] [INFO ] [Real]Absence check using 6 positive place invariants in 36 ms returned sat
[2023-03-20 19:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:44] [INFO ] [Real]Absence check using state equation in 1105 ms returned sat
[2023-03-20 19:12:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 59 ms returned sat
[2023-03-20 19:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:46] [INFO ] [Nat]Absence check using state equation in 1148 ms returned sat
[2023-03-20 19:12:47] [INFO ] Deduced a trap composed of 397 places in 1523 ms of which 2 ms to minimize.
[2023-03-20 19:12:49] [INFO ] Deduced a trap composed of 402 places in 1546 ms of which 2 ms to minimize.
[2023-03-20 19:12:49] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3317 ms
[2023-03-20 19:12:50] [INFO ] [Real]Absence check using 6 positive place invariants in 55 ms returned sat
[2023-03-20 19:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:51] [INFO ] [Real]Absence check using state equation in 1281 ms returned sat
[2023-03-20 19:12:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 19:12:52] [INFO ] [Nat]Absence check using 6 positive place invariants in 61 ms returned sat
[2023-03-20 19:12:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 19:12:53] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-20 19:12:54] [INFO ] Deduced a trap composed of 399 places in 1654 ms of which 2 ms to minimize.
[2023-03-20 19:12:56] [INFO ] Deduced a trap composed of 397 places in 1477 ms of which 2 ms to minimize.
[2023-03-20 19:12:56] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1510 edges and 1534 vertex of which 105 / 1534 are part of one of the 15 SCC in 26 ms
Free SCC test removed 90 places
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (complete) has 2161 edges and 1444 vertex of which 1434 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.14 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 1143 transitions
Trivial Post-agglo rules discarded 1143 transitions
Performed 1143 trivial Post agglomeration. Transition count delta: 1143
Iterating post reduction 0 with 1148 rules applied. Total rules applied 1150 place count 1434 transition count 868
Reduce places removed 1143 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 1182 rules applied. Total rules applied 2332 place count 291 transition count 829
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 2351 place count 276 transition count 825
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2355 place count 272 transition count 825
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 48 Pre rules applied. Total rules applied 2355 place count 272 transition count 777
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 2451 place count 224 transition count 777
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2513 place count 162 transition count 715
Iterating global reduction 4 with 62 rules applied. Total rules applied 2575 place count 162 transition count 715
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2575 place count 162 transition count 714
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2577 place count 161 transition count 714
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 2612 place count 126 transition count 258
Iterating global reduction 4 with 35 rules applied. Total rules applied 2647 place count 126 transition count 258
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2663 place count 126 transition count 242
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2669 place count 120 transition count 236
Iterating global reduction 5 with 6 rules applied. Total rules applied 2675 place count 120 transition count 236
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2681 place count 114 transition count 230
Iterating global reduction 5 with 6 rules applied. Total rules applied 2687 place count 114 transition count 230
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2692 place count 114 transition count 225
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 2722 place count 99 transition count 210
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2723 place count 99 transition count 209
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2728 place count 94 transition count 204
Iterating global reduction 7 with 5 rules applied. Total rules applied 2733 place count 94 transition count 204
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2738 place count 89 transition count 199
Iterating global reduction 7 with 5 rules applied. Total rules applied 2743 place count 89 transition count 199
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2748 place count 84 transition count 194
Iterating global reduction 7 with 5 rules applied. Total rules applied 2753 place count 84 transition count 194
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2757 place count 82 transition count 204
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 2788 place count 82 transition count 173
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 64 rules applied. Total rules applied 2852 place count 51 transition count 140
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2857 place count 46 transition count 135
Iterating global reduction 8 with 5 rules applied. Total rules applied 2862 place count 46 transition count 135
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2899 place count 46 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2901 place count 45 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2903 place count 44 transition count 100
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 2909 place count 44 transition count 100
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2912 place count 44 transition count 97
Applied a total of 2912 rules in 326 ms. Remains 44 /1534 variables (removed 1490) and now considering 97/2136 (removed 2039) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 326 ms. Remains : 44/1534 places, 97/2136 transitions.
// Phase 1: matrix 97 rows 44 cols
[2023-03-20 19:12:57] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2218 ms. (steps per millisecond=450 ) properties (out of 7) seen :5
FORMULA StigmergyCommit-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 2) seen :2
FORMULA StigmergyCommit-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 70437 ms.

BK_STOP 1679339580899

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-04b"
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-5348"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-04b, 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 r453-smll-167912645400437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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