Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K Feb 26 07:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 07:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 07:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 197K Feb 26 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 26 07:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 07:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 729K Mar 5 18:22 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 DLCshifumi-PT-2b-UpperBounds-00
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-01
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-02
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-03
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-04
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-05
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-06
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-07
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-08
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-09
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-10
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-11
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-12
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-13
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-14
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678429353092

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCshifumi-PT-2b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 06:22:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 06:22:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 06:22:34] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-10 06:22:34] [INFO ] Transformed 2483 places.
[2023-03-10 06:22:34] [INFO ] Transformed 3183 transitions.
[2023-03-10 06:22:34] [INFO ] Found NUPN structural information;
[2023-03-10 06:22:34] [INFO ] Parsed PT model containing 2483 places and 3183 transitions and 7756 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3183 rows 2483 cols
[2023-03-10 06:22:34] [INFO ] Computed 79 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :12
FORMULA DLCshifumi-PT-2b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
[2023-03-10 06:22:35] [INFO ] Invariant cache hit.
[2023-03-10 06:22:35] [INFO ] [Real]Absence check using 79 positive place invariants in 78 ms returned sat
[2023-03-10 06:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:36] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2023-03-10 06:22:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 06:22:37] [INFO ] [Nat]Absence check using 79 positive place invariants in 69 ms returned sat
[2023-03-10 06:22:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:38] [INFO ] [Nat]Absence check using state equation in 1019 ms returned sat
[2023-03-10 06:22:39] [INFO ] Deduced a trap composed of 59 places in 784 ms of which 5 ms to minimize.
[2023-03-10 06:22:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1048 ms
[2023-03-10 06:22:39] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 181 ms.
[2023-03-10 06:22:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 06:22:42] [INFO ] [Real]Absence check using 79 positive place invariants in 63 ms returned sat
[2023-03-10 06:22:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:43] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2023-03-10 06:22:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 06:22:43] [INFO ] [Nat]Absence check using 79 positive place invariants in 63 ms returned sat
[2023-03-10 06:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:45] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2023-03-10 06:22:46] [INFO ] Deduced a trap composed of 66 places in 920 ms of which 2 ms to minimize.
[2023-03-10 06:22:46] [INFO ] Deduced a trap composed of 181 places in 801 ms of which 2 ms to minimize.
[2023-03-10 06:22:47] [INFO ] Deduced a trap composed of 67 places in 737 ms of which 2 ms to minimize.
[2023-03-10 06:22:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2841 ms
[2023-03-10 06:22:48] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 169 ms.
[2023-03-10 06:22:49] [INFO ] Deduced a trap composed of 16 places in 1112 ms of which 4 ms to minimize.
[2023-03-10 06:22:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 06:22:50] [INFO ] [Real]Absence check using 79 positive place invariants in 69 ms returned sat
[2023-03-10 06:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:51] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2023-03-10 06:22:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 06:22:51] [INFO ] [Nat]Absence check using 79 positive place invariants in 61 ms returned sat
[2023-03-10 06:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:52] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2023-03-10 06:22:53] [INFO ] Deduced a trap composed of 113 places in 785 ms of which 2 ms to minimize.
[2023-03-10 06:22:54] [INFO ] Deduced a trap composed of 69 places in 765 ms of which 2 ms to minimize.
[2023-03-10 06:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1850 ms
[2023-03-10 06:22:54] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 140 ms.
[2023-03-10 06:22:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 06:22:56] [INFO ] [Real]Absence check using 79 positive place invariants in 60 ms returned sat
[2023-03-10 06:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:57] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2023-03-10 06:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 06:22:58] [INFO ] [Nat]Absence check using 79 positive place invariants in 63 ms returned sat
[2023-03-10 06:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 06:22:59] [INFO ] [Nat]Absence check using state equation in 1080 ms returned sat
[2023-03-10 06:23:00] [INFO ] Deduced a trap composed of 67 places in 776 ms of which 2 ms to minimize.
[2023-03-10 06:23:00] [INFO ] Deduced a trap composed of 59 places in 715 ms of which 2 ms to minimize.
[2023-03-10 06:23:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1801 ms
[2023-03-10 06:23:01] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 138 ms.
[2023-03-10 06:23:03] [INFO ] Deduced a trap composed of 16 places in 1123 ms of which 2 ms to minimize.
[2023-03-10 06:23:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 2483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Graph (trivial) has 2441 edges and 2483 vertex of which 335 / 2483 are part of one of the 22 SCC in 11 ms
Free SCC test removed 313 places
Drop transitions removed 352 transitions
Reduce isomorphic transitions removed 352 transitions.
Drop transitions removed 1264 transitions
Trivial Post-agglo rules discarded 1264 transitions
Performed 1264 trivial Post agglomeration. Transition count delta: 1264
Iterating post reduction 0 with 1264 rules applied. Total rules applied 1265 place count 2170 transition count 1567
Reduce places removed 1264 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1362 rules applied. Total rules applied 2627 place count 906 transition count 1469
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 77 rules applied. Total rules applied 2704 place count 858 transition count 1440
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 16 rules applied. Total rules applied 2720 place count 844 transition count 1438
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2722 place count 842 transition count 1438
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 2722 place count 842 transition count 1422
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 2754 place count 826 transition count 1422
Discarding 232 places :
Symmetric choice reduction at 5 with 232 rule applications. Total rules 2986 place count 594 transition count 1190
Iterating global reduction 5 with 232 rules applied. Total rules applied 3218 place count 594 transition count 1190
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 80 Pre rules applied. Total rules applied 3218 place count 594 transition count 1110
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 5 with 160 rules applied. Total rules applied 3378 place count 514 transition count 1110
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 3420 place count 472 transition count 830
Iterating global reduction 5 with 42 rules applied. Total rules applied 3462 place count 472 transition count 830
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 3494 place count 472 transition count 798
Performed 121 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 6 with 242 rules applied. Total rules applied 3736 place count 351 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3738 place count 351 transition count 673
Performed 51 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 3840 place count 300 transition count 741
Drop transitions removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 3851 place count 300 transition count 730
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 3867 place count 284 transition count 663
Iterating global reduction 8 with 16 rules applied. Total rules applied 3883 place count 284 transition count 663
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 8 with 31 rules applied. Total rules applied 3914 place count 284 transition count 632
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 3940 place count 284 transition count 606
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3944 place count 280 transition count 602
Iterating global reduction 9 with 4 rules applied. Total rules applied 3948 place count 280 transition count 602
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 3952 place count 276 transition count 536
Iterating global reduction 9 with 4 rules applied. Total rules applied 3956 place count 276 transition count 536
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 3960 place count 276 transition count 532
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 3964 place count 274 transition count 530
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 3966 place count 272 transition count 497
Iterating global reduction 10 with 2 rules applied. Total rules applied 3968 place count 272 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3970 place count 272 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3978 place count 268 transition count 522
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 3983 place count 268 transition count 517
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 12 with 22 rules applied. Total rules applied 4005 place count 268 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 4013 place count 264 transition count 522
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4019 place count 264 transition count 516
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 4040 place count 264 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 4048 place count 260 transition count 522
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 4054 place count 260 transition count 516
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 4075 place count 260 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 4083 place count 256 transition count 522
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4089 place count 256 transition count 516
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 4110 place count 256 transition count 495
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4118 place count 252 transition count 523
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 4124 place count 252 transition count 517
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 4145 place count 252 transition count 496
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4153 place count 248 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4159 place count 248 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 4180 place count 248 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 4188 place count 244 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 4194 place count 244 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 4215 place count 244 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 4223 place count 240 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 4229 place count 240 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 4250 place count 240 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 4258 place count 236 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 4264 place count 236 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 4285 place count 236 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 4293 place count 232 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 4299 place count 232 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 4320 place count 232 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 4328 place count 228 transition count 524
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 4334 place count 228 transition count 518
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 4355 place count 228 transition count 497
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 4363 place count 224 transition count 525
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 4369 place count 224 transition count 519
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 4390 place count 224 transition count 498
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 4398 place count 220 transition count 525
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 4404 place count 220 transition count 519
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 4425 place count 220 transition count 498
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 24 with 8 rules applied. Total rules applied 4433 place count 216 transition count 526
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 24 with 6 rules applied. Total rules applied 4439 place count 216 transition count 520
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 25 with 21 rules applied. Total rules applied 4460 place count 216 transition count 499
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 25 with 4 rules applied. Total rules applied 4464 place count 214 transition count 504
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 4466 place count 214 transition count 502
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 26 with 5 rules applied. Total rules applied 4471 place count 214 transition count 497
Free-agglomeration rule applied 50 times.
Iterating global reduction 26 with 50 rules applied. Total rules applied 4521 place count 214 transition count 447
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 152 transitions
Reduce isomorphic transitions removed 152 transitions.
Graph (complete) has 464 edges and 164 vertex of which 50 are kept as prefixes of interest. Removing 114 places using SCC suffix rule.1 ms
Discarding 114 places :
Also discarding 154 output transitions
Drop transitions removed 154 transitions
Iterating post reduction 26 with 203 rules applied. Total rules applied 4724 place count 50 transition count 141
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 27 with 48 rules applied. Total rules applied 4772 place count 50 transition count 93
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 28 with 8 rules applied. Total rules applied 4780 place count 50 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 28 with 1 rules applied. Total rules applied 4781 place count 49 transition count 84
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 4783 place count 47 transition count 84
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 29 with 24 rules applied. Total rules applied 4807 place count 31 transition count 76
Drop transitions removed 8 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 29 with 21 rules applied. Total rules applied 4828 place count 31 transition count 55
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 30 with 24 rules applied. Total rules applied 4852 place count 15 transition count 47
Drop transitions removed 14 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 26 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 8 / 15 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 30 with 28 rules applied. Total rules applied 4880 place count 11 transition count 20
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 31 with 11 rules applied. Total rules applied 4891 place count 10 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 32 with 2 Pre rules applied. Total rules applied 4891 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 4 rules applied. Total rules applied 4895 place count 8 transition count 8
Applied a total of 4895 rules in 713 ms. Remains 8 /2483 variables (removed 2475) and now considering 8/3183 (removed 3175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 8/2483 places, 8/3183 transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-10 06:23:04] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 4) seen :4
FORMULA DLCshifumi-PT-2b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30792 ms.
ITS solved all properties within timeout

BK_STOP 1678429386247

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DLCshifumi-PT-2b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DLCshifumi-PT-2b, 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 r107-tall-167814484700805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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