fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r528-tall-171683760900333
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ShieldIIPt-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
664.388 262424.00 306933.00 673.20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 860K May 18 16:43 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 ShieldIIPt-PT-050B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717239670148

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:01:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:01:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:01:11] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2024-06-01 11:01:11] [INFO ] Transformed 3503 places.
[2024-06-01 11:01:11] [INFO ] Transformed 3253 transitions.
[2024-06-01 11:01:11] [INFO ] Found NUPN structural information;
[2024-06-01 11:01:11] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 3253 rows 3503 cols
[2024-06-01 11:01:12] [INFO ] Computed 451 invariants in 63 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 136 ms. (72 steps per ms)
FORMULA ShieldIIPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-06-01 11:01:12] [INFO ] Invariant cache hit.
[2024-06-01 11:01:13] [INFO ] [Real]Absence check using 451 positive place invariants in 406 ms returned sat
[2024-06-01 11:01:14] [INFO ] [Real]Absence check using state equation in 1371 ms returned sat
[2024-06-01 11:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:15] [INFO ] [Nat]Absence check using 451 positive place invariants in 233 ms returned sat
[2024-06-01 11:01:17] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2024-06-01 11:01:19] [INFO ] Deduced a trap composed of 17 places in 1877 ms of which 161 ms to minimize.
[2024-06-01 11:01:20] [INFO ] Deduced a trap composed of 24 places in 1749 ms of which 24 ms to minimize.
[2024-06-01 11:01:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 11:01:21] [INFO ] [Real]Absence check using 451 positive place invariants in 221 ms returned sat
[2024-06-01 11:01:23] [INFO ] [Real]Absence check using state equation in 1427 ms returned sat
[2024-06-01 11:01:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:23] [INFO ] [Nat]Absence check using 451 positive place invariants in 207 ms returned sat
[2024-06-01 11:01:25] [INFO ] [Nat]Absence check using state equation in 1481 ms returned sat
[2024-06-01 11:01:27] [INFO ] Deduced a trap composed of 22 places in 1612 ms of which 22 ms to minimize.
[2024-06-01 11:01:28] [INFO ] Deduced a trap composed of 20 places in 1614 ms of which 19 ms to minimize.
[2024-06-01 11:01:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 11:01:29] [INFO ] [Real]Absence check using 451 positive place invariants in 209 ms returned sat
[2024-06-01 11:01:30] [INFO ] [Real]Absence check using state equation in 1383 ms returned sat
[2024-06-01 11:01:32] [INFO ] Deduced a trap composed of 26 places in 1591 ms of which 17 ms to minimize.
[2024-06-01 11:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:33] [INFO ] [Nat]Absence check using 451 positive place invariants in 211 ms returned sat
[2024-06-01 11:01:35] [INFO ] [Nat]Absence check using state equation in 1346 ms returned sat
[2024-06-01 11:01:36] [INFO ] Deduced a trap composed of 26 places in 1660 ms of which 19 ms to minimize.
[2024-06-01 11:01:38] [INFO ] Deduced a trap composed of 29 places in 1574 ms of which 17 ms to minimize.
[2024-06-01 11:01:38] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 11:01:39] [INFO ] [Real]Absence check using 451 positive place invariants in 208 ms returned sat
[2024-06-01 11:01:40] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2024-06-01 11:01:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:01:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 199 ms returned sat
[2024-06-01 11:01:42] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2024-06-01 11:01:44] [INFO ] Deduced a trap composed of 18 places in 1578 ms of which 18 ms to minimize.
[2024-06-01 11:01:46] [INFO ] Deduced a trap composed of 13 places in 1579 ms of which 18 ms to minimize.
[2024-06-01 11:01:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 849 transitions
Trivial Post-agglo rules discarded 849 transitions
Performed 849 trivial Post agglomeration. Transition count delta: 849
Iterating post reduction 0 with 849 rules applied. Total rules applied 849 place count 3503 transition count 2404
Reduce places removed 849 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 851 rules applied. Total rules applied 1700 place count 2654 transition count 2402
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1703 place count 2653 transition count 2400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1705 place count 2651 transition count 2400
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 199 Pre rules applied. Total rules applied 1705 place count 2651 transition count 2201
Deduced a syphon composed of 199 places in 6 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 4 with 398 rules applied. Total rules applied 2103 place count 2452 transition count 2201
Discarding 350 places :
Symmetric choice reduction at 4 with 350 rule applications. Total rules 2453 place count 2102 transition count 1851
Iterating global reduction 4 with 350 rules applied. Total rules applied 2803 place count 2102 transition count 1851
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 2803 place count 2102 transition count 1703
Deduced a syphon composed of 148 places in 12 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 3099 place count 1954 transition count 1703
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 2 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 4 with 1700 rules applied. Total rules applied 4799 place count 1104 transition count 853
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 5001 place count 1003 transition count 918
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 5091 place count 958 transition count 948
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5092 place count 958 transition count 947
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5093 place count 958 transition count 946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5094 place count 957 transition count 946
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 5144 place count 957 transition count 946
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 5145 place count 956 transition count 945
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 5147 place count 954 transition count 945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 5147 place count 954 transition count 944
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 5149 place count 953 transition count 944
Applied a total of 5149 rules in 1154 ms. Remains 953 /3503 variables (removed 2550) and now considering 944/3253 (removed 2309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1165 ms. Remains : 953/3503 places, 944/3253 transitions.
// Phase 1: matrix 944 rows 953 cols
[2024-06-01 11:01:47] [INFO ] Computed 449 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 7696 ms. (129 steps per ms)
FORMULA ShieldIIPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1982782 steps (4 resets) in 10002 ms. (198 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 11:02:05] [INFO ] Invariant cache hit.
[2024-06-01 11:02:05] [INFO ] [Real]Absence check using 449 positive place invariants in 62 ms returned sat
[2024-06-01 11:02:05] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2024-06-01 11:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:02:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:02:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:02:05] [INFO ] [Nat]Absence check using 449 positive place invariants in 67 ms returned sat
[2024-06-01 11:02:06] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2024-06-01 11:02:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 11:02:06] [INFO ] Computed and/alt/rep : 941/1679/941 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 11:02:20] [INFO ] Added : 851 causal constraints over 171 iterations in 14594 ms. Result :sat
Minimization took 4521 ms.
[2024-06-01 11:02:25] [INFO ] [Real]Absence check using 449 positive place invariants in 63 ms returned sat
[2024-06-01 11:02:25] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-06-01 11:02:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:02:25] [INFO ] [Nat]Absence check using 449 positive place invariants in 58 ms returned sat
[2024-06-01 11:02:26] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2024-06-01 11:02:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:02:26] [INFO ] Computed and/alt/rep : 941/1679/941 causal constraints (skipped 0 transitions) in 55 ms.
[2024-06-01 11:02:40] [INFO ] Added : 845 causal constraints over 169 iterations in 14366 ms. Result :sat
Minimization took 2952 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1] Max Struct:[1, 1]
Support contains 2 out of 953 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 953/953 places, 944/944 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 953 transition count 943
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 952 transition count 943
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 951 transition count 942
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 950 transition count 943
Applied a total of 6 rules in 54 ms. Remains 950 /953 variables (removed 3) and now considering 943/944 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 950/953 places, 943/944 transitions.
// Phase 1: matrix 943 rows 950 cols
[2024-06-01 11:02:44] [INFO ] Computed 449 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1] Max Struct:[1, 1]
FORMULA ShieldIIPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 7727 ms. (129 steps per ms)
BEST_FIRST walk for 943428 steps (2 resets) in 5001 ms. (188 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 11:02:57] [INFO ] Invariant cache hit.
[2024-06-01 11:02:57] [INFO ] [Real]Absence check using 449 positive place invariants in 62 ms returned sat
[2024-06-01 11:02:57] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-06-01 11:02:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:02:57] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 11:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:02:57] [INFO ] [Nat]Absence check using 449 positive place invariants in 65 ms returned sat
[2024-06-01 11:02:58] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-06-01 11:02:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:02:58] [INFO ] Computed and/alt/rep : 940/1681/940 causal constraints (skipped 0 transitions) in 49 ms.
[2024-06-01 11:03:12] [INFO ] Added : 850 causal constraints over 170 iterations in 14238 ms. Result :sat
Minimization took 4509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 950 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p1321) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 950/950 places, 942/942 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 950 transition count 941
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 949 transition count 941
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 948 transition count 943
Applied a total of 4 rules in 43 ms. Remains 948 /950 variables (removed 2) and now considering 943/942 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 948/950 places, 943/942 transitions.
// Phase 1: matrix 943 rows 948 cols
[2024-06-01 11:03:17] [INFO ] Computed 449 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 7406 ms. (135 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 4939 ms. (202 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 11:03:29] [INFO ] Invariant cache hit.
[2024-06-01 11:03:29] [INFO ] [Real]Absence check using 449 positive place invariants in 71 ms returned sat
[2024-06-01 11:03:29] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-06-01 11:03:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 11:03:29] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:03:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:03:30] [INFO ] [Nat]Absence check using 449 positive place invariants in 59 ms returned sat
[2024-06-01 11:03:30] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2024-06-01 11:03:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 11:03:30] [INFO ] Computed and/alt/rep : 940/1683/940 causal constraints (skipped 0 transitions) in 47 ms.
[2024-06-01 11:03:45] [INFO ] Added : 853 causal constraints over 171 iterations in 15349 ms. Result :sat
Minimization took 4503 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 943/943 transitions.
Applied a total of 0 rules in 24 ms. Remains 948 /948 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 948/948 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 943/943 transitions.
Applied a total of 0 rules in 17 ms. Remains 948 /948 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2024-06-01 11:03:50] [INFO ] Invariant cache hit.
[2024-06-01 11:03:50] [INFO ] Implicit Places using invariants in 557 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 562 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 947/948 places, 943/943 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 942
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 942
Applied a total of 2 rules in 30 ms. Remains 946 /947 variables (removed 1) and now considering 942/943 (removed 1) transitions.
// Phase 1: matrix 942 rows 946 cols
[2024-06-01 11:03:50] [INFO ] Computed 448 invariants in 8 ms
[2024-06-01 11:03:51] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-01 11:03:51] [INFO ] Invariant cache hit.
[2024-06-01 11:03:52] [INFO ] Implicit Places using invariants and state equation in 944 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 946/948 places, 942/943 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2073 ms. Remains : 946/948 places, 942/943 transitions.
[2024-06-01 11:03:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 7619 ms. (131 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 4961 ms. (201 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 11:04:04] [INFO ] Invariant cache hit.
[2024-06-01 11:04:05] [INFO ] [Real]Absence check using 448 positive place invariants in 65 ms returned sat
[2024-06-01 11:04:05] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2024-06-01 11:04:05] [INFO ] Computed and/alt/rep : 939/1677/939 causal constraints (skipped 0 transitions) in 49 ms.
[2024-06-01 11:04:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:04:05] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2024-06-01 11:04:06] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-06-01 11:04:06] [INFO ] Computed and/alt/rep : 939/1677/939 causal constraints (skipped 0 transitions) in 56 ms.
[2024-06-01 11:04:18] [INFO ] Added : 846 causal constraints over 170 iterations in 12688 ms. Result :sat
Minimization took 3025 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 942/942 transitions.
Applied a total of 0 rules in 17 ms. Remains 946 /946 variables (removed 0) and now considering 942/942 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 946/946 places, 942/942 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 942/942 transitions.
Applied a total of 0 rules in 17 ms. Remains 946 /946 variables (removed 0) and now considering 942/942 (removed 0) transitions.
[2024-06-01 11:04:23] [INFO ] Invariant cache hit.
[2024-06-01 11:04:23] [INFO ] Implicit Places using invariants in 502 ms returned []
[2024-06-01 11:04:23] [INFO ] Invariant cache hit.
[2024-06-01 11:04:24] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2024-06-01 11:04:24] [INFO ] Redundant transitions in 46 ms returned []
Running 939 sub problems to find dead transitions.
[2024-06-01 11:04:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/945 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 2 (OVERLAPS) 1/946 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/1888 variables, and 448 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 0/946 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/945 variables, 447/447 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/945 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 2 (OVERLAPS) 1/946 variables, 1/448 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/946 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 4 (OVERLAPS) 942/1888 variables, 946/1394 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1888 variables, 939/2333 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1888/1888 variables, and 2333 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 448/448 constraints, State Equation: 946/946 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61949 ms. Remains : 946/946 places, 942/942 transitions.
[2024-06-01 11:05:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ShieldIIPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 7220 ms. (138 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 261204 ms.
ITS solved all properties within timeout

BK_STOP 1717239932572

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-050B, 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 r528-tall-171683760900333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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