Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620506200613.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudDeployment-PT-6b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200613
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 11 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.8M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717209375218

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:36:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 02:36:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:36:16] [INFO ] Load time of PNML (sax parser for PT used): 448 ms
[2024-06-01 02:36:16] [INFO ] Transformed 1888 places.
[2024-06-01 02:36:16] [INFO ] Transformed 6804 transitions.
[2024-06-01 02:36:16] [INFO ] Found NUPN structural information;
[2024-06-01 02:36:16] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 602 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 6804 rows 1888 cols
[2024-06-01 02:36:17] [INFO ] Computed 25 invariants in 179 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (50 resets) in 109 ms. (90 steps per ms)
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (57 resets) in 180 ms. (552 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-06-01 02:36:17] [INFO ] Invariant cache hit.
[2024-06-01 02:36:18] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 139 ms returned sat
[2024-06-01 02:36:19] [INFO ] [Real]Absence check using state equation in 1750 ms returned sat
[2024-06-01 02:36:22] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1866 ms.
[2024-06-01 02:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:36:22] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 45 ms returned sat
[2024-06-01 02:36:24] [INFO ] [Nat]Absence check using state equation in 1532 ms returned sat
[2024-06-01 02:36:26] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1532 ms.
[2024-06-01 02:36:27] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:36:27] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 02:36:29] [INFO ] [Real]Absence check using state equation in 1692 ms returned sat
[2024-06-01 02:36:31] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1293 ms.
[2024-06-01 02:36:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:36:32] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 02:36:34] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2024-06-01 02:36:36] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1885 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 02:36:37] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 44 ms returned sat
[2024-06-01 02:36:39] [INFO ] [Real]Absence check using state equation in 1814 ms returned sat
[2024-06-01 02:36:41] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1428 ms.
[2024-06-01 02:36:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:36:42] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2024-06-01 02:36:44] [INFO ] [Nat]Absence check using state equation in 1592 ms returned sat
[2024-06-01 02:36:46] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1435 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 02:36:48] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 02:36:49] [INFO ] [Real]Absence check using state equation in 1874 ms returned sat
[2024-06-01 02:36:51] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1437 ms.
[2024-06-01 02:36:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:36:52] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 47 ms returned sat
[2024-06-01 02:36:54] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2024-06-01 02:36:56] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1401 ms.
[2024-06-01 02:36:57] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:36:57] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 51 ms returned sat
[2024-06-01 02:36:59] [INFO ] [Real]Absence check using state equation in 1563 ms returned sat
[2024-06-01 02:36:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:36:59] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 44 ms returned sat
[2024-06-01 02:37:01] [INFO ] [Nat]Absence check using state equation in 1621 ms returned sat
[2024-06-01 02:37:03] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1392 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-06-01 02:37:05] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 41 ms returned sat
[2024-06-01 02:37:06] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2024-06-01 02:37:08] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1410 ms.
[2024-06-01 02:37:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:09] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 02:37:11] [INFO ] [Nat]Absence check using state equation in 1585 ms returned sat
[2024-06-01 02:37:12] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1394 ms.
[2024-06-01 02:37:14] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:37:14] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 42 ms returned sat
[2024-06-01 02:37:16] [INFO ] [Real]Absence check using state equation in 1658 ms returned sat
[2024-06-01 02:37:18] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1408 ms.
[2024-06-01 02:37:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:19] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 46 ms returned sat
[2024-06-01 02:37:21] [INFO ] [Nat]Absence check using state equation in 1657 ms returned sat
[2024-06-01 02:37:22] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1405 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-06-01 02:37:24] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 41 ms returned sat
[2024-06-01 02:37:26] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2024-06-01 02:37:28] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1561 ms.
[2024-06-01 02:37:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:29] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 43 ms returned sat
[2024-06-01 02:37:31] [INFO ] [Nat]Absence check using state equation in 1581 ms returned sat
[2024-06-01 02:37:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1271 ms.
[2024-06-01 02:37:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 02:37:34] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 40 ms returned sat
[2024-06-01 02:37:36] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2024-06-01 02:37:37] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1273 ms.
[2024-06-01 02:37:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:39] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 44 ms returned sat
[2024-06-01 02:37:40] [INFO ] [Nat]Absence check using state equation in 1597 ms returned sat
[2024-06-01 02:37:42] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 1276 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1896 edges and 1888 vertex of which 488 / 1888 are part of one of the 47 SCC in 11 ms
Free SCC test removed 441 places
Drop transitions (Empty/Sink Transition effects.) removed 4636 transitions
Reduce isomorphic transitions removed 4636 transitions.
Graph (complete) has 4320 edges and 1447 vertex of which 1403 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.7 ms
Discarding 44 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 680 transitions
Trivial Post-agglo rules discarded 680 transitions
Performed 680 trivial Post agglomeration. Transition count delta: 680
Iterating post reduction 0 with 704 rules applied. Total rules applied 706 place count 1403 transition count 1458
Reduce places removed 680 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 682 rules applied. Total rules applied 1388 place count 723 transition count 1456
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1391 place count 722 transition count 1454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1393 place count 720 transition count 1454
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 1393 place count 720 transition count 1430
Deduced a syphon composed of 24 places in 2 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 1441 place count 696 transition count 1430
Discarding 317 places :
Symmetric choice reduction at 4 with 317 rule applications. Total rules 1758 place count 379 transition count 1113
Iterating global reduction 4 with 317 rules applied. Total rules applied 2075 place count 379 transition count 1113
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 2104 place count 379 transition count 1084
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2104 place count 379 transition count 1059
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 2154 place count 354 transition count 1059
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2157 place count 351 transition count 1056
Iterating global reduction 5 with 3 rules applied. Total rules applied 2160 place count 351 transition count 1056
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2162 place count 349 transition count 1054
Iterating global reduction 5 with 2 rules applied. Total rules applied 2164 place count 349 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2166 place count 347 transition count 1052
Iterating global reduction 5 with 2 rules applied. Total rules applied 2168 place count 347 transition count 1052
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2169 place count 346 transition count 1051
Iterating global reduction 5 with 1 rules applied. Total rules applied 2170 place count 346 transition count 1051
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 5 with 182 rules applied. Total rules applied 2352 place count 255 transition count 960
Performed 37 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 2426 place count 218 transition count 1175
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 2450 place count 218 transition count 1151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 2462 place count 212 transition count 1211
Drop transitions (Redundant composition of simpler transitions.) removed 200 transitions
Redundant transition composition rules discarded 200 transitions
Iterating global reduction 6 with 200 rules applied. Total rules applied 2662 place count 212 transition count 1011
Free-agglomeration rule applied 61 times with reduction of 27 identical transitions.
Iterating global reduction 6 with 61 rules applied. Total rules applied 2723 place count 212 transition count 923
Reduce places removed 61 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 135 transitions
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 201 transitions.
Graph (complete) has 1258 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 263 rules applied. Total rules applied 2986 place count 150 transition count 722
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2987 place count 150 transition count 721
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2992 place count 145 transition count 686
Iterating global reduction 8 with 5 rules applied. Total rules applied 2997 place count 145 transition count 686
Drop transitions (Redundant composition of simpler transitions.) removed 116 transitions
Redundant transition composition rules discarded 116 transitions
Iterating global reduction 8 with 116 rules applied. Total rules applied 3113 place count 145 transition count 570
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3114 place count 144 transition count 569
Applied a total of 3114 rules in 490 ms. Remains 144 /1888 variables (removed 1744) and now considering 569/6804 (removed 6235) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 144/1888 places, 569/6804 transitions.
[2024-06-01 02:37:44] [INFO ] Flow matrix only has 284 transitions (discarded 285 similar events)
// Phase 1: matrix 284 rows 144 cols
[2024-06-01 02:37:44] [INFO ] Computed 23 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2369 ms. (421 steps per ms)
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (6 resets) in 2023 ms. (1482 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 02:37:48] [INFO ] Flow matrix only has 284 transitions (discarded 285 similar events)
[2024-06-01 02:37:48] [INFO ] Invariant cache hit.
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 17 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-06-01 02:37:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 02:37:49] [INFO ] [Real]Added 7 Read/Feed constraints in 10 ms returned sat
[2024-06-01 02:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 3 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Added 7 Read/Feed constraints in 5 ms returned sat
[2024-06-01 02:37:49] [INFO ] Computed and/alt/rep : 211/804/211 causal constraints (skipped 34 transitions) in 14 ms.
[2024-06-01 02:37:49] [INFO ] Added : 18 causal constraints over 6 iterations in 106 ms. Result :sat
Minimization took 57 ms.
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using 6 positive and 17 generalized place invariants in 4 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Real]Added 7 Read/Feed constraints in 6 ms returned sat
[2024-06-01 02:37:49] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using 6 positive and 17 generalized place invariants in 8 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 02:37:49] [INFO ] [Nat]Added 7 Read/Feed constraints in 7 ms returned sat
[2024-06-01 02:37:49] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 5 ms to minimize.
[2024-06-01 02:37:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-01 02:37:49] [INFO ] Computed and/alt/rep : 211/804/211 causal constraints (skipped 34 transitions) in 66 ms.
[2024-06-01 02:37:49] [INFO ] Added : 21 causal constraints over 6 iterations in 154 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 144 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p735) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 566/566 transitions.
Graph (trivial) has 57 edges and 144 vertex of which 4 / 144 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 142 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 141 transition count 561
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 141 transition count 560
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 140 transition count 560
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 139 transition count 559
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 139 transition count 559
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 138 transition count 558
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 138 transition count 558
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 135 transition count 555
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 135 transition count 549
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 134 transition count 553
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 134 transition count 547
Applied a total of 29 rules in 34 ms. Remains 134 /144 variables (removed 10) and now considering 547/566 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 134/144 places, 547/566 transitions.
[2024-06-01 02:37:50] [INFO ] Flow matrix only has 259 transitions (discarded 288 similar events)
// Phase 1: matrix 259 rows 134 cols
[2024-06-01 02:37:50] [INFO ] Computed 23 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA CloudDeployment-PT-6b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (12721 resets) in 1930 ms. (517 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 95690 ms.
ITS solved all properties within timeout

BK_STOP 1717209472013

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-6b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-6b, 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 r476-tall-171620506200613"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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