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.r103-tall-167814478800789.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 lolaxred
Input is DLCround-PT-13b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478800789
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.3K Feb 25 18:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 18:45 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:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 2.1M 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 DLCround-PT-13b-UpperBounds-00
FORMULA_NAME DLCround-PT-13b-UpperBounds-01
FORMULA_NAME DLCround-PT-13b-UpperBounds-02
FORMULA_NAME DLCround-PT-13b-UpperBounds-03
FORMULA_NAME DLCround-PT-13b-UpperBounds-04
FORMULA_NAME DLCround-PT-13b-UpperBounds-05
FORMULA_NAME DLCround-PT-13b-UpperBounds-06
FORMULA_NAME DLCround-PT-13b-UpperBounds-07
FORMULA_NAME DLCround-PT-13b-UpperBounds-08
FORMULA_NAME DLCround-PT-13b-UpperBounds-09
FORMULA_NAME DLCround-PT-13b-UpperBounds-10
FORMULA_NAME DLCround-PT-13b-UpperBounds-11
FORMULA_NAME DLCround-PT-13b-UpperBounds-12
FORMULA_NAME DLCround-PT-13b-UpperBounds-13
FORMULA_NAME DLCround-PT-13b-UpperBounds-14
FORMULA_NAME DLCround-PT-13b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678279763027

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 12:49:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 12:49:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 12:49:24] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2023-03-08 12:49:24] [INFO ] Transformed 5343 places.
[2023-03-08 12:49:24] [INFO ] Transformed 8727 transitions.
[2023-03-08 12:49:24] [INFO ] Found NUPN structural information;
[2023-03-08 12:49:24] [INFO ] Parsed PT model containing 5343 places and 8727 transitions and 24849 arcs in 423 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 8727 rows 5343 cols
[2023-03-08 12:49:25] [INFO ] Computed 312 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 16) seen :6
FORMULA DLCround-PT-13b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
[2023-03-08 12:49:25] [INFO ] Invariant cache hit.
[2023-03-08 12:49:26] [INFO ] [Real]Absence check using 312 positive place invariants in 368 ms returned sat
[2023-03-08 12:49:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:49:30] [INFO ] [Real]Absence check using state equation in 3848 ms returned unknown
[2023-03-08 12:49:31] [INFO ] [Real]Absence check using 312 positive place invariants in 366 ms returned sat
[2023-03-08 12:49:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:49:35] [INFO ] [Real]Absence check using state equation in 3863 ms returned unknown
[2023-03-08 12:49:36] [INFO ] [Real]Absence check using 312 positive place invariants in 371 ms returned sat
[2023-03-08 12:49:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:49:40] [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.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-08 12:49:41] [INFO ] [Real]Absence check using 312 positive place invariants in 381 ms returned sat
[2023-03-08 12:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:49:45] [INFO ] [Real]Absence check using state equation in 3854 ms returned sat
[2023-03-08 12:49:50] [INFO ] Deduced a trap composed of 12 places in 5181 ms of which 16 ms to minimize.
[2023-03-08 12:49:50] [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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-08 12:49:51] [INFO ] [Real]Absence check using 312 positive place invariants in 351 ms returned sat
[2023-03-08 12:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:49:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-08 12:49:57] [INFO ] [Real]Absence check using 312 positive place invariants in 365 ms returned sat
[2023-03-08 12:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:00] [INFO ] [Real]Absence check using state equation in 3893 ms returned unknown
[2023-03-08 12:50:02] [INFO ] [Real]Absence check using 312 positive place invariants in 353 ms returned sat
[2023-03-08 12:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:05] [INFO ] [Real]Absence check using state equation in 3895 ms returned sat
[2023-03-08 12:50:11] [INFO ] Deduced a trap composed of 12 places in 5248 ms of which 8 ms to minimize.
[2023-03-08 12:50:11] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-08 12:50:12] [INFO ] [Real]Absence check using 312 positive place invariants in 363 ms returned sat
[2023-03-08 12:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:16] [INFO ] [Real]Absence check using state equation in 3902 ms returned unknown
[2023-03-08 12:50:17] [INFO ] [Real]Absence check using 312 positive place invariants in 348 ms returned sat
[2023-03-08 12:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:21] [INFO ] [Real]Absence check using state equation in 3855 ms returned sat
[2023-03-08 12:50:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 12:50:22] [INFO ] [Nat]Absence check using 312 positive place invariants in 366 ms returned sat
[2023-03-08 12:50:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:26] [INFO ] [Nat]Absence check using state equation in 3969 ms returned sat
[2023-03-08 12:50:31] [INFO ] Deduced a trap composed of 12 places in 5291 ms of which 15 ms to minimize.
[2023-03-08 12:50:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-08 12:50:32] [INFO ] [Real]Absence check using 312 positive place invariants in 384 ms returned sat
[2023-03-08 12:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 12:50:36] [INFO ] [Real]Absence check using state equation in 3957 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 8727/8727 transitions.
Graph (trivial) has 4856 edges and 5343 vertex of which 841 / 5343 are part of one of the 60 SCC in 19 ms
Free SCC test removed 781 places
Drop transitions removed 872 transitions
Reduce isomorphic transitions removed 872 transitions.
Drop transitions removed 1885 transitions
Trivial Post-agglo rules discarded 1885 transitions
Performed 1885 trivial Post agglomeration. Transition count delta: 1885
Iterating post reduction 0 with 1885 rules applied. Total rules applied 1886 place count 4562 transition count 5970
Reduce places removed 1885 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 1 with 1978 rules applied. Total rules applied 3864 place count 2677 transition count 5877
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 45 rules applied. Total rules applied 3909 place count 2638 transition count 5871
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 3916 place count 2635 transition count 5867
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 3920 place count 2631 transition count 5867
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 3920 place count 2631 transition count 5859
Deduced a syphon composed of 8 places in 42 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 3936 place count 2623 transition count 5859
Discarding 745 places :
Symmetric choice reduction at 5 with 745 rule applications. Total rules 4681 place count 1878 transition count 5114
Iterating global reduction 5 with 745 rules applied. Total rules applied 5426 place count 1878 transition count 5114
Performed 333 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 333 Pre rules applied. Total rules applied 5426 place count 1878 transition count 4781
Deduced a syphon composed of 333 places in 35 ms
Reduce places removed 333 places and 0 transitions.
Iterating global reduction 5 with 666 rules applied. Total rules applied 6092 place count 1545 transition count 4781
Discarding 103 places :
Symmetric choice reduction at 5 with 103 rule applications. Total rules 6195 place count 1442 transition count 3051
Iterating global reduction 5 with 103 rules applied. Total rules applied 6298 place count 1442 transition count 3051
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 6333 place count 1442 transition count 3016
Performed 381 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 381 places in 1 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 6 with 762 rules applied. Total rules applied 7095 place count 1061 transition count 2622
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 7109 place count 1061 transition count 2608
Renaming transitions due to excessive name length > 1024 char.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -149
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 7135 place count 1048 transition count 2757
Drop transitions removed 8 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 7147 place count 1048 transition count 2745
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 7151 place count 1044 transition count 2631
Iterating global reduction 8 with 4 rules applied. Total rules applied 7155 place count 1044 transition count 2631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 7159 place count 1044 transition count 2627
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 7167 place count 1040 transition count 2676
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 9 with 62 rules applied. Total rules applied 7229 place count 1040 transition count 2614
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 7256 place count 1013 transition count 2587
Iterating global reduction 9 with 27 rules applied. Total rules applied 7283 place count 1013 transition count 2587
Discarding 27 places :
Symmetric choice reduction at 9 with 27 rule applications. Total rules 7310 place count 986 transition count 2126
Iterating global reduction 9 with 27 rules applied. Total rules applied 7337 place count 986 transition count 2126
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 9 with 27 rules applied. Total rules applied 7364 place count 986 transition count 2099
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 7392 place count 972 transition count 2085
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 7406 place count 958 transition count 1846
Iterating global reduction 10 with 14 rules applied. Total rules applied 7420 place count 958 transition count 1846
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 7434 place count 958 transition count 1832
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 7442 place count 954 transition count 1864
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 7447 place count 954 transition count 1859
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 12 with 19 rules applied. Total rules applied 7466 place count 954 transition count 1840
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 7472 place count 951 transition count 1863
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 7477 place count 951 transition count 1858
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 13 with 18 rules applied. Total rules applied 7495 place count 951 transition count 1840
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 6 rules applied. Total rules applied 7501 place count 948 transition count 1865
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 7506 place count 948 transition count 1860
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 14 with 19 rules applied. Total rules applied 7525 place count 948 transition count 1841
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 7531 place count 945 transition count 1864
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 7535 place count 945 transition count 1860
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 15 with 14 rules applied. Total rules applied 7549 place count 945 transition count 1846
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 7553 place count 943 transition count 1864
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 7556 place count 943 transition count 1861
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 16 with 15 rules applied. Total rules applied 7571 place count 943 transition count 1846
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 7575 place count 941 transition count 1866
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 7579 place count 941 transition count 1862
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 17 with 15 rules applied. Total rules applied 7594 place count 941 transition count 1847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 7598 place count 939 transition count 1865
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 17 with 3 rules applied. Total rules applied 7601 place count 939 transition count 1862
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 18 with 15 rules applied. Total rules applied 7616 place count 939 transition count 1847
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 7620 place count 937 transition count 1865
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 7622 place count 937 transition count 1863
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 19 with 9 rules applied. Total rules applied 7631 place count 937 transition count 1854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 7633 place count 936 transition count 1865
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 7634 place count 936 transition count 1864
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 20 with 10 rules applied. Total rules applied 7644 place count 936 transition count 1854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 7646 place count 935 transition count 1865
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 7648 place count 935 transition count 1863
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 21 with 9 rules applied. Total rules applied 7657 place count 935 transition count 1854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 7659 place count 934 transition count 1865
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 7660 place count 934 transition count 1864
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 22 with 10 rules applied. Total rules applied 7670 place count 934 transition count 1854
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 7672 place count 933 transition count 1867
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 7675 place count 933 transition count 1864
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 23 with 9 rules applied. Total rules applied 7684 place count 933 transition count 1855
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 7686 place count 932 transition count 1866
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 7687 place count 932 transition count 1865
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 24 with 10 rules applied. Total rules applied 7697 place count 932 transition count 1855
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 7699 place count 931 transition count 1866
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 7701 place count 931 transition count 1864
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 25 with 9 rules applied. Total rules applied 7710 place count 931 transition count 1855
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 7712 place count 930 transition count 1866
Free-agglomeration rule applied 563 times with reduction of 289 identical transitions.
Iterating global reduction 25 with 563 rules applied. Total rules applied 8275 place count 930 transition count 1014
Reduce places removed 563 places and 0 transitions.
Drop transitions removed 646 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 653 transitions.
Graph (complete) has 701 edges and 367 vertex of which 205 are kept as prefixes of interest. Removing 162 places using SCC suffix rule.1 ms
Discarding 162 places :
Also discarding 0 output transitions
Iterating post reduction 25 with 1217 rules applied. Total rules applied 9492 place count 205 transition count 361
Discarding 89 places :
Symmetric choice reduction at 26 with 89 rule applications. Total rules 9581 place count 116 transition count 243
Iterating global reduction 26 with 89 rules applied. Total rules applied 9670 place count 116 transition count 243
Drop transitions removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 26 with 23 rules applied. Total rules applied 9693 place count 116 transition count 220
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 26 with 1 rules applied. Total rules applied 9694 place count 116 transition count 220
Applied a total of 9694 rules in 3455 ms. Remains 116 /5343 variables (removed 5227) and now considering 220/8727 (removed 8507) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3455 ms. Remains : 116/5343 places, 220/8727 transitions.
Normalized transition count is 143 out of 220 initially.
// Phase 1: matrix 143 rows 116 cols
[2023-03-08 12:50:40] [INFO ] Computed 61 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3511 ms. (steps per millisecond=284 ) properties (out of 10) seen :10
FORMULA DLCround-PT-13b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-13b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 79338 ms.
ITS solved all properties within timeout

BK_STOP 1678279844788

--------------------
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="DLCround-PT-13b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DLCround-PT-13b, 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 r103-tall-167814478800789"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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