Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000301.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 364K Mar 5 18:23 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 ShieldRVt-PT-030B-UpperBounds-00
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldRVt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679309752975

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:55:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 10:55:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:55:54] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-20 10:55:54] [INFO ] Transformed 1503 places.
[2023-03-20 10:55:54] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:55:54] [INFO ] Found NUPN structural information;
[2023-03-20 10:55:54] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 1503 rows 1503 cols
[2023-03-20 10:55:55] [INFO ] Computed 121 place invariants in 43 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :11
FORMULA ShieldRVt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) 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 5) 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 5) seen :0
[2023-03-20 10:55:55] [INFO ] Invariant cache hit.
[2023-03-20 10:55:55] [INFO ] [Real]Absence check using 121 positive place invariants in 65 ms returned sat
[2023-03-20 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:56] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2023-03-20 10:55:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:55:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2023-03-20 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:57] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-20 10:55:57] [INFO ] Deduced a trap composed of 31 places in 472 ms of which 5 ms to minimize.
[2023-03-20 10:55:58] [INFO ] Deduced a trap composed of 30 places in 462 ms of which 1 ms to minimize.
[2023-03-20 10:55:58] [INFO ] Deduced a trap composed of 42 places in 597 ms of which 2 ms to minimize.
[2023-03-20 10:55:59] [INFO ] Deduced a trap composed of 23 places in 640 ms of which 2 ms to minimize.
[2023-03-20 10:56:00] [INFO ] Deduced a trap composed of 22 places in 429 ms of which 2 ms to minimize.
[2023-03-20 10:56:00] [INFO ] Deduced a trap composed of 38 places in 480 ms of which 1 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Deduced a trap composed of 30 places in 675 ms of which 2 ms to minimize.
[2023-03-20 10:56:01] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 4202 ms
[2023-03-20 10:56:01] [INFO ] [Real]Absence check using 121 positive place invariants in 56 ms returned sat
[2023-03-20 10:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:02] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2023-03-20 10:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:56:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 86 ms returned sat
[2023-03-20 10:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:04] [INFO ] [Nat]Absence check using state equation in 834 ms returned sat
[2023-03-20 10:56:04] [INFO ] Deduced a trap composed of 25 places in 477 ms of which 1 ms to minimize.
[2023-03-20 10:56:05] [INFO ] Deduced a trap composed of 40 places in 480 ms of which 1 ms to minimize.
[2023-03-20 10:56:05] [INFO ] Deduced a trap composed of 35 places in 475 ms of which 1 ms to minimize.
[2023-03-20 10:56:06] [INFO ] Deduced a trap composed of 30 places in 416 ms of which 1 ms to minimize.
[2023-03-20 10:56:06] [INFO ] Deduced a trap composed of 30 places in 394 ms of which 1 ms to minimize.
[2023-03-20 10:56:07] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2023-03-20 10:56:07] [INFO ] Deduced a trap composed of 31 places in 408 ms of which 1 ms to minimize.
[2023-03-20 10:56:08] [INFO ] Deduced a trap composed of 43 places in 528 ms of which 1 ms to minimize.
[2023-03-20 10:56:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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-20 10:56:08] [INFO ] [Real]Absence check using 121 positive place invariants in 81 ms returned sat
[2023-03-20 10:56:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:09] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2023-03-20 10:56:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:56:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 60 ms returned sat
[2023-03-20 10:56:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:10] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-20 10:56:10] [INFO ] Deduced a trap composed of 28 places in 510 ms of which 2 ms to minimize.
[2023-03-20 10:56:11] [INFO ] Deduced a trap composed of 35 places in 712 ms of which 2 ms to minimize.
[2023-03-20 10:56:12] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 3 ms to minimize.
[2023-03-20 10:56:12] [INFO ] Deduced a trap composed of 46 places in 440 ms of which 1 ms to minimize.
[2023-03-20 10:56:13] [INFO ] Deduced a trap composed of 27 places in 492 ms of which 5 ms to minimize.
[2023-03-20 10:56:13] [INFO ] Deduced a trap composed of 79 places in 440 ms of which 1 ms to minimize.
[2023-03-20 10:56:14] [INFO ] Deduced a trap composed of 24 places in 447 ms of which 1 ms to minimize.
[2023-03-20 10:56:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-20 10:56:14] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2023-03-20 10:56:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:15] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-20 10:56:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:56:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 106 ms returned sat
[2023-03-20 10:56:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:16] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2023-03-20 10:56:17] [INFO ] Deduced a trap composed of 45 places in 483 ms of which 1 ms to minimize.
[2023-03-20 10:56:17] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 3 ms to minimize.
[2023-03-20 10:56:18] [INFO ] Deduced a trap composed of 32 places in 458 ms of which 1 ms to minimize.
[2023-03-20 10:56:18] [INFO ] Deduced a trap composed of 26 places in 447 ms of which 1 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 36 places in 442 ms of which 2 ms to minimize.
[2023-03-20 10:56:19] [INFO ] Deduced a trap composed of 38 places in 447 ms of which 1 ms to minimize.
[2023-03-20 10:56:20] [INFO ] Deduced a trap composed of 54 places in 426 ms of which 2 ms to minimize.
[2023-03-20 10:56:20] [INFO ] Deduced a trap composed of 48 places in 540 ms of which 1 ms to minimize.
[2023-03-20 10:56: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 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: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-20 10:56:20] [INFO ] [Real]Absence check using 121 positive place invariants in 47 ms returned sat
[2023-03-20 10:56:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:21] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2023-03-20 10:56:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:56:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 48 ms returned sat
[2023-03-20 10:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:56:22] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-20 10:56:22] [INFO ] Deduced a trap composed of 26 places in 451 ms of which 1 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 46 places in 459 ms of which 2 ms to minimize.
[2023-03-20 10:56:23] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 44 places in 441 ms of which 1 ms to minimize.
[2023-03-20 10:56:24] [INFO ] Deduced a trap composed of 35 places in 448 ms of which 18 ms to minimize.
[2023-03-20 10:56:25] [INFO ] Deduced a trap composed of 37 places in 417 ms of which 2 ms to minimize.
[2023-03-20 10:56:25] [INFO ] Deduced a trap composed of 52 places in 407 ms of which 1 ms to minimize.
[2023-03-20 10:56:26] [INFO ] Deduced a trap composed of 42 places in 406 ms of which 1 ms to minimize.
[2023-03-20 10:56:26] [INFO ] Deduced a trap composed of 34 places in 410 ms of which 1 ms to minimize.
[2023-03-20 10:56:26] [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 4
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 480 transitions
Trivial Post-agglo rules discarded 480 transitions
Performed 480 trivial Post agglomeration. Transition count delta: 480
Iterating post reduction 0 with 480 rules applied. Total rules applied 480 place count 1503 transition count 1023
Reduce places removed 480 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 482 rules applied. Total rules applied 962 place count 1023 transition count 1021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 963 place count 1022 transition count 1021
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 963 place count 1022 transition count 902
Deduced a syphon composed of 119 places in 11 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 1201 place count 903 transition count 902
Discarding 208 places :
Symmetric choice reduction at 3 with 208 rule applications. Total rules 1409 place count 695 transition count 694
Iterating global reduction 3 with 208 rules applied. Total rules applied 1617 place count 695 transition count 694
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 1617 place count 695 transition count 607
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 1791 place count 608 transition count 607
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 3 with 540 rules applied. Total rules applied 2331 place count 338 transition count 337
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 88 places in 12 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2507 place count 250 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2508 place count 250 transition count 420
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2509 place count 250 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2510 place count 249 transition count 419
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2511 place count 249 transition count 418
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2512 place count 249 transition count 418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2513 place count 248 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2514 place count 247 transition count 417
Applied a total of 2514 rules in 614 ms. Remains 247 /1503 variables (removed 1256) and now considering 417/1503 (removed 1086) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 247/1503 places, 417/1503 transitions.
// Phase 1: matrix 417 rows 247 cols
[2023-03-20 10:56:27] [INFO ] Computed 120 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 265 resets, run finished after 4108 ms. (steps per millisecond=243 ) properties (out of 5) seen :5
FORMULA ShieldRVt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 37247 ms.
ITS solved all properties within timeout

BK_STOP 1679309792182

--------------------
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="ShieldRVt-PT-030B"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-030B, 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 r425-tajo-167905978000301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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