fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821000533
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for LeafsetExtension-PT-S64C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1142.968 59636.00 74222.00 156.00 3 1 1 1 1 1 1 1 1 1 1 1 3 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/mcc2022-input.r132-tall-165271821000533.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 LeafsetExtension-PT-S64C3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821000533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 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 LeafsetExtension-PT-S64C3-UpperBounds-00
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-01
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-02
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-03
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-04
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-05
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-06
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-07
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-08
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-09
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-10
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-11
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-12
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-13
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-14
FORMULA_NAME LeafsetExtension-PT-S64C3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652804512757

Running Version 202205111006
[2022-05-17 16:21:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 16:21:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:21:54] [INFO ] Load time of PNML (sax parser for PT used): 650 ms
[2022-05-17 16:21:54] [INFO ] Transformed 21462 places.
[2022-05-17 16:21:54] [INFO ] Transformed 21129 transitions.
[2022-05-17 16:21:54] [INFO ] Parsed PT model containing 21462 places and 21129 transitions in 838 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 21129 rows 21462 cols
[2022-05-17 16:21:57] [INFO ] Computed 333 place invariants in 2818 ms
Incomplete random walk after 10000 steps, including 387 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 16) seen :9
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :1
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :1
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 21129 rows 21462 cols
[2022-05-17 16:22:00] [INFO ] Computed 333 place invariants in 2537 ms
[2022-05-17 16:22:04] [INFO ] [Real]Absence check using 67 positive place invariants in 754 ms returned sat
[2022-05-17 16:22:04] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 823 ms returned sat
[2022-05-17 16:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:09] [INFO ] [Real]Absence check using 67 positive place invariants in 803 ms returned sat
[2022-05-17 16:22:09] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 678 ms returned sat
[2022-05-17 16:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:14] [INFO ] [Real]Absence check using 67 positive place invariants in 723 ms returned sat
[2022-05-17 16:22:14] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 681 ms returned sat
[2022-05-17 16:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:19] [INFO ] [Real]Absence check using 67 positive place invariants in 758 ms returned sat
[2022-05-17 16:22:19] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 680 ms returned unsat
[2022-05-17 16:22:22] [INFO ] [Real]Absence check using 67 positive place invariants in 757 ms returned sat
[2022-05-17 16:22:23] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 652 ms returned sat
[2022-05-17 16:22:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:27] [INFO ] [Real]Absence check using 67 positive place invariants in 765 ms returned sat
[2022-05-17 16:22:28] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 812 ms returned sat
[2022-05-17 16:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:32] [INFO ] [Real]Absence check using 67 positive place invariants in 763 ms returned sat
[2022-05-17 16:22:33] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 650 ms returned sat
[2022-05-17 16:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 16:22:37] [INFO ] [Real]Absence check using 67 positive place invariants in 737 ms returned sat
[2022-05-17 16:22:38] [INFO ] [Real]Absence check using 67 positive and 266 generalized place invariants in 700 ms returned sat
[2022-05-17 16:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, -1, 1, -1] Max seen :[1, 0, 0, 1, 0, 0, 0, 1]
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 21462 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 706 are kept as prefixes of interest. Removing 20756 places using SCC suffix rule.36 ms
Discarding 20756 places :
Also discarding 12187 output transitions
Drop transitions removed 12187 transitions
Drop transitions removed 4216 transitions
Reduce isomorphic transitions removed 4216 transitions.
Drop transitions removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 4437 rules applied. Total rules applied 4438 place count 706 transition count 4505
Reduce places removed 223 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 1 with 228 rules applied. Total rules applied 4666 place count 483 transition count 4500
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 4671 place count 478 transition count 4500
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 4671 place count 478 transition count 4494
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 4683 place count 472 transition count 4494
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 4714 place count 441 transition count 4463
Iterating global reduction 3 with 31 rules applied. Total rules applied 4745 place count 441 transition count 4463
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 4749 place count 441 transition count 4459
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 4753 place count 437 transition count 4459
Partial Free-agglomeration rule applied 155 times.
Drop transitions removed 155 transitions
Iterating global reduction 4 with 155 rules applied. Total rules applied 4908 place count 437 transition count 4459
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 4 with 5 rules applied. Total rules applied 4913 place count 432 transition count 4459
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4915 place count 432 transition count 4457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4917 place count 430 transition count 4457
Applied a total of 4917 rules in 671 ms. Remains 430 /21462 variables (removed 21032) and now considering 4457/21129 (removed 16672) transitions.
Finished structural reductions, in 1 iterations. Remains : 430/21462 places, 4457/21129 transitions.
Successfully produced net in file /tmp/petri1000_12993448098442308499.dot
Successfully produced net in file /tmp/petri1001_10453068537265804677.dot
Successfully produced net in file /tmp/petri1002_17118885010205506817.dot
Successfully produced net in file /tmp/petri1003_1591784630313334761.dot
Successfully produced net in file /tmp/petri1004_655189877634401642.dot
Successfully produced net in file /tmp/petri1005_16531152432238418765.dot
Successfully produced net in file /tmp/petri1006_11602755460438572500.dot
Successfully produced net in file /tmp/petri1007_7386530563119349968.dot
Successfully produced net in file /tmp/petri1008_9783450154556416691.dot
Successfully produced net in file /tmp/petri1009_5379376304821224578.dot
Successfully produced net in file /tmp/petri1010_14480357958892504818.dot
Successfully produced net in file /tmp/petri1011_17764077957257910384.dot
Successfully produced net in file /tmp/petri1012_3999373337632428511.dot
Successfully produced net in file /tmp/petri1013_8643045180086956805.dot
Successfully produced net in file /tmp/petri1014_15893927034205468174.dot
Successfully produced net in file /tmp/petri1015_12661789475317083213.dot
Successfully produced net in file /tmp/petri1016_856587332887811971.dot
Successfully produced net in file /tmp/petri1017_10646322978110335128.dot
Successfully produced net in file /tmp/petri1018_17091289355248897513.dot
Successfully produced net in file /tmp/petri1019_10578783437233372015.dot
Successfully produced net in file /tmp/petri1020_7111474848509260054.dot
Successfully produced net in file /tmp/petri1021_15304065378878767004.dot
Successfully produced net in file /tmp/petri1022_16265663436758248600.dot
Successfully produced net in file /tmp/petri1023_1206735712061789087.dot
Successfully produced net in file /tmp/petri1024_12648060802755667324.dot
Successfully produced net in file /tmp/petri1025_17500935833139663851.dot
Successfully produced net in file /tmp/petri1026_16589382904278593295.dot
Successfully produced net in file /tmp/petri1027_8412752456578425992.dot
Successfully produced net in file /tmp/petri1028_1981484160125977352.dot
Successfully produced net in file /tmp/petri1029_12953006263868599436.dot
Successfully produced net in file /tmp/petri1030_13225618140887570395.dot
Successfully produced net in file /tmp/petri1031_2539918171585740258.dot
Successfully produced net in file /tmp/petri1032_14715629644459836953.dot
Successfully produced net in file /tmp/petri1033_4708164849341239091.dot
Successfully produced net in file /tmp/petri1034_10629884484293819688.dot
Successfully produced net in file /tmp/petri1035_10243798191769985856.dot
Successfully produced net in file /tmp/petri1036_14195560426683041132.dot
Successfully produced net in file /tmp/petri1037_15391277029495040236.dot
Successfully produced net in file /tmp/petri1038_7569149168875151553.dot
Successfully produced net in file /tmp/petri1039_9069385053976047229.dot
Successfully produced net in file /tmp/petri1040_15348361805960657808.dot
Successfully produced net in file /tmp/petri1041_5668014083884455014.dot
Successfully produced net in file /tmp/petri1042_12886539272386441091.dot
Successfully produced net in file /tmp/petri1043_7130737349514708897.dot
Successfully produced net in file /tmp/petri1044_8589716718132103624.dot
Successfully produced net in file /tmp/petri1045_3132609038479489628.dot
Successfully produced net in file /tmp/petri1046_14881259761089347483.dot
Successfully produced net in file /tmp/petri1047_17551802128187094507.dot
Successfully produced net in file /tmp/petri1048_1901511545389020649.dot
Successfully produced net in file /tmp/petri1049_17877096012621445619.dot
Successfully produced net in file /tmp/petri1050_10180471786221610624.dot
Successfully produced net in file /tmp/petri1051_3797167901767470904.dot
Successfully produced net in file /tmp/petri1052_168489070506077886.dot
Successfully produced net in file /tmp/petri1053_15595372821708276598.dot
Successfully produced net in file /tmp/petri1054_1640472357395737036.dot
Successfully produced net in file /tmp/petri1055_14352272645872928554.dot
Successfully produced net in file /tmp/petri1056_16940598903993658571.dot
Successfully produced net in file /tmp/petri1057_3287313761533892516.dot
Successfully produced net in file /tmp/petri1058_304699604998987814.dot
Successfully produced net in file /tmp/petri1059_2287805223468863663.dot
Successfully produced net in file /tmp/petri1060_16583863363971718518.dot
Successfully produced net in file /tmp/petri1061_12074861739000943981.dot
Successfully produced net in file /tmp/petri1062_10316357908918752720.dot
Successfully produced net in file /tmp/petri1063_5020676486293706082.dot
Successfully produced net in file /tmp/petri1064_13263392528868088257.dot
Successfully produced net in file /tmp/petri1065_5326579647583835448.dot
Successfully produced net in file /tmp/petri1066_16717675697384545793.dot
Successfully produced net in file /tmp/petri1067_13615297682424142565.dot
Successfully produced net in file /tmp/petri1068_9197478349376628144.dot
Successfully produced net in file /tmp/petri1069_13616396657305103557.dot
Successfully produced net in file /tmp/petri1070_13500128869600834161.dot
Successfully produced net in file /tmp/petri1071_11906218816006310238.dot
Successfully produced net in file /tmp/petri1072_16490509646902560370.dot
Successfully produced net in file /tmp/petri1073_5017397532373741927.dot
Successfully produced net in file /tmp/petri1074_6197077703615950782.dot
Successfully produced net in file /tmp/petri1075_17529017830436956477.dot
Successfully produced net in file /tmp/petri1076_1645317567702227139.dot
Successfully produced net in file /tmp/petri1077_4320997677317767346.dot
Successfully produced net in file /tmp/petri1078_9099720511423038961.dot
Successfully produced net in file /tmp/petri1079_17143089961324252930.dot
Successfully produced net in file /tmp/petri1080_7807649677354136033.dot
Successfully produced net in file /tmp/petri1081_8677358125036991000.dot
Successfully produced net in file /tmp/petri1082_2426700799266658085.dot
Successfully produced net in file /tmp/petri1083_11091824054033836559.dot
Successfully produced net in file /tmp/petri1084_5192220587530826276.dot
Successfully produced net in file /tmp/petri1085_6334942783903432487.dot
Successfully produced net in file /tmp/petri1086_2618469570004178693.dot
Successfully produced net in file /tmp/petri1087_16832362008184278404.dot
Successfully produced net in file /tmp/petri1088_12582599137023133467.dot
Successfully produced net in file /tmp/petri1089_15034223911682177196.dot
Successfully produced net in file /tmp/petri1090_7535662572330372431.dot
Successfully produced net in file /tmp/petri1091_16060196467115432562.dot
Successfully produced net in file /tmp/petri1092_11036809935993733576.dot
Successfully produced net in file /tmp/petri1093_16170448463729750945.dot
Successfully produced net in file /tmp/petri1094_1471652888607594538.dot
Successfully produced net in file /tmp/petri1095_17808407871142257449.dot
Successfully produced net in file /tmp/petri1096_13328092398475778107.dot
Successfully produced net in file /tmp/petri1097_13371286009016267255.dot
Successfully produced net in file /tmp/petri1098_3676181760782210414.dot
Successfully produced net in file /tmp/petri1099_6759536156319603296.dot
Successfully produced net in file /tmp/petri1100_15830003960842377601.dot
Successfully produced net in file /tmp/petri1101_11196210687655790272.dot
Successfully produced net in file /tmp/petri1102_1331127588289982718.dot
Successfully produced net in file /tmp/petri1103_1734329209940694194.dot
Successfully produced net in file /tmp/petri1104_6726191678792482239.dot
Successfully produced net in file /tmp/petri1105_17703547116308351412.dot
Successfully produced net in file /tmp/petri1106_7028897253100615325.dot
Successfully produced net in file /tmp/petri1107_9965999699264324095.dot
Successfully produced net in file /tmp/petri1108_125415383917607812.dot
Successfully produced net in file /tmp/petri1109_9062305946735971048.dot
Successfully produced net in file /tmp/petri1110_11001581652137170925.dot
Successfully produced net in file /tmp/petri1111_17913396255418483768.dot
Successfully produced net in file /tmp/petri1112_18121244130831327847.dot
Successfully produced net in file /tmp/petri1113_2529631908156944477.dot
Successfully produced net in file /tmp/petri1114_18129249823125031800.dot
Successfully produced net in file /tmp/petri1115_18442207698486705717.dot
Successfully produced net in file /tmp/petri1116_15853005058718373218.dot
Successfully produced net in file /tmp/petri1117_11811881106203327011.dot
Successfully produced net in file /tmp/petri1118_13391588012786652084.dot
Successfully produced net in file /tmp/petri1119_7850257161639997489.dot
Successfully produced net in file /tmp/petri1120_5524888042784487692.dot
Successfully produced net in file /tmp/petri1121_12600135389775519741.dot
Successfully produced net in file /tmp/petri1122_1413697855042429189.dot
Successfully produced net in file /tmp/petri1123_14113949022440609556.dot
Successfully produced net in file /tmp/petri1124_8116217183842093343.dot
Successfully produced net in file /tmp/petri1125_15251301331341501628.dot
Successfully produced net in file /tmp/petri1126_8999923776110128843.dot
Successfully produced net in file /tmp/petri1127_4871964825340981768.dot
Successfully produced net in file /tmp/petri1128_33964270707023616.dot
Successfully produced net in file /tmp/petri1129_9446112375567746835.dot
Successfully produced net in file /tmp/petri1130_6209884292568385737.dot
Successfully produced net in file /tmp/petri1131_14510969681420462109.dot
Successfully produced net in file /tmp/petri1132_5907123303254505534.dot
Successfully produced net in file /tmp/petri1133_15692519993917344962.dot
Successfully produced net in file /tmp/petri1134_7037305139432648177.dot
Successfully produced net in file /tmp/petri1135_2189336743346025328.dot
Successfully produced net in file /tmp/petri1136_3129518399733494825.dot
Successfully produced net in file /tmp/petri1137_5897601025099702560.dot
Successfully produced net in file /tmp/petri1138_15360449172859765107.dot
Successfully produced net in file /tmp/petri1139_15491980779981203047.dot
Successfully produced net in file /tmp/petri1140_3274462165107118323.dot
Successfully produced net in file /tmp/petri1141_4706485524755536156.dot
Successfully produced net in file /tmp/petri1142_9742929425010711197.dot
Successfully produced net in file /tmp/petri1143_6110948379562848177.dot
Successfully produced net in file /tmp/petri1144_14108752683870698261.dot
Successfully produced net in file /tmp/petri1145_6030658628307654141.dot
Successfully produced net in file /tmp/petri1146_1453885139286521745.dot
Successfully produced net in file /tmp/petri1147_7116542698528335527.dot
Successfully produced net in file /tmp/petri1148_9998666433664269794.dot
Successfully produced net in file /tmp/petri1149_9396753856472371193.dot
Successfully produced net in file /tmp/petri1150_14510537126258226534.dot
Successfully produced net in file /tmp/petri1151_4997111269982626274.dot
Successfully produced net in file /tmp/petri1152_17881121918812935742.dot
Successfully produced net in file /tmp/petri1153_17748324389576501756.dot
Successfully produced net in file /tmp/petri1154_11224127809445032243.dot
Drop transitions removed 155 transitions
Dominated transitions for bounds rules discarded 155 transitions
Normalized transition count is 431 out of 4302 initially.
// Phase 1: matrix 431 rows 430 cols
[2022-05-17 16:22:41] [INFO ] Computed 4 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 113742 resets, run finished after 6634 ms. (steps per millisecond=150 ) properties (out of 7) seen :11
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3942 resets, run finished after 1352 ms. (steps per millisecond=739 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 3966 resets, run finished after 1348 ms. (steps per millisecond=741 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 3959 resets, run finished after 1344 ms. (steps per millisecond=744 ) properties (out of 3) seen :7
[2022-05-17 16:22:51] [INFO ] Flow matrix only has 431 transitions (discarded 3871 similar events)
// Phase 1: matrix 431 rows 430 cols
[2022-05-17 16:22:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 16:22:51] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-17 16:22:51] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 16:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using state equation in 104 ms returned unsat
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-17 16:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using state equation in 96 ms returned unsat
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-17 16:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:22:52] [INFO ] [Real]Absence check using state equation in 98 ms returned unsat
Current structural bounds on expressions (after SMT) : [3, 1, 3] Max seen :[3, 1, 3]
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 58407 ms.

BK_STOP 1652804572393

--------------------
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="LeafsetExtension-PT-S64C3"
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 LeafsetExtension-PT-S64C3, 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 r132-tall-165271821000533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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