About the Execution of LTSMin+red for ShieldRVt-PT-030B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
472.487 | 65253.00 | 83298.00 | 253.70 | 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-171683762301005.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 ShieldRVt-PT-030B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762301005
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 800K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 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 1717276755074
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
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:19:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 21:19:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:19:16] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-06-01 21:19:16] [INFO ] Transformed 1503 places.
[2024-06-01 21:19:16] [INFO ] Transformed 1503 transitions.
[2024-06-01 21:19:16] [INFO ] Found NUPN structural information;
[2024-06-01 21:19:16] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 265 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 1503 rows 1503 cols
[2024-06-01 21:19:16] [INFO ] Computed 121 invariants in 37 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 62 ms. (158 steps per ms)
FORMULA ShieldRVt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (14 resets) in 77 ms. (897 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-06-01 21:19:16] [INFO ] Invariant cache hit.
[2024-06-01 21:19:17] [INFO ] [Real]Absence check using 121 positive place invariants in 70 ms returned sat
[2024-06-01 21:19:17] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2024-06-01 21:19:18] [INFO ] Deduced a trap composed of 28 places in 667 ms of which 69 ms to minimize.
[2024-06-01 21:19:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:19] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:19] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2024-06-01 21:19:20] [INFO ] Deduced a trap composed of 28 places in 501 ms of which 17 ms to minimize.
[2024-06-01 21:19:20] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 7 ms to minimize.
[2024-06-01 21:19:21] [INFO ] Deduced a trap composed of 40 places in 374 ms of which 7 ms to minimize.
[2024-06-01 21:19:21] [INFO ] Deduced a trap composed of 57 places in 394 ms of which 7 ms to minimize.
[2024-06-01 21:19:22] [INFO ] Deduced a trap composed of 36 places in 375 ms of which 7 ms to minimize.
[2024-06-01 21:19:22] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 6 ms to minimize.
[2024-06-01 21:19:22] [INFO ] Deduced a trap composed of 37 places in 347 ms of which 7 ms to minimize.
[2024-06-01 21:19:23] [INFO ] Deduced a trap composed of 30 places in 336 ms of which 6 ms to minimize.
[2024-06-01 21:19:23] [INFO ] Deduced a trap composed of 38 places in 357 ms of which 7 ms to minimize.
[2024-06-01 21:19:24] [INFO ] Deduced a trap composed of 55 places in 338 ms of which 6 ms to minimize.
[2024-06-01 21:19:24] [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 21:19:24] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:24] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-06-01 21:19:25] [INFO ] Deduced a trap composed of 29 places in 431 ms of which 8 ms to minimize.
[2024-06-01 21:19:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2024-06-01 21:19:26] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-06-01 21:19:26] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 8 ms to minimize.
[2024-06-01 21:19:27] [INFO ] Deduced a trap composed of 36 places in 421 ms of which 7 ms to minimize.
[2024-06-01 21:19:27] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 8 ms to minimize.
[2024-06-01 21:19:28] [INFO ] Deduced a trap composed of 30 places in 412 ms of which 8 ms to minimize.
[2024-06-01 21:19:28] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 14 ms to minimize.
[2024-06-01 21:19:29] [INFO ] Deduced a trap composed of 36 places in 416 ms of which 7 ms to minimize.
[2024-06-01 21:19:29] [INFO ] Deduced a trap composed of 35 places in 401 ms of which 8 ms to minimize.
[2024-06-01 21:19:29] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 7 ms to minimize.
[2024-06-01 21:19:30] [INFO ] Deduced a trap composed of 52 places in 380 ms of which 7 ms to minimize.
[2024-06-01 21:19:30] [INFO ] Deduced a trap composed of 40 places in 360 ms of which 7 ms to minimize.
[2024-06-01 21:19:30] [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 21:19:30] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2024-06-01 21:19:31] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2024-06-01 21:19:31] [INFO ] Deduced a trap composed of 26 places in 383 ms of which 8 ms to minimize.
[2024-06-01 21:19:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:32] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2024-06-01 21:19:33] [INFO ] Deduced a trap composed of 26 places in 386 ms of which 7 ms to minimize.
[2024-06-01 21:19:33] [INFO ] Deduced a trap composed of 25 places in 381 ms of which 7 ms to minimize.
[2024-06-01 21:19:34] [INFO ] Deduced a trap composed of 23 places in 385 ms of which 7 ms to minimize.
[2024-06-01 21:19:34] [INFO ] Deduced a trap composed of 35 places in 375 ms of which 8 ms to minimize.
[2024-06-01 21:19:34] [INFO ] Deduced a trap composed of 26 places in 373 ms of which 7 ms to minimize.
[2024-06-01 21:19:35] [INFO ] Deduced a trap composed of 36 places in 350 ms of which 7 ms to minimize.
[2024-06-01 21:19:35] [INFO ] Deduced a trap composed of 33 places in 339 ms of which 6 ms to minimize.
[2024-06-01 21:19:36] [INFO ] Deduced a trap composed of 50 places in 360 ms of which 8 ms to minimize.
[2024-06-01 21:19:36] [INFO ] Deduced a trap composed of 40 places in 342 ms of which 6 ms to minimize.
[2024-06-01 21:19:36] [INFO ] Deduced a trap composed of 50 places in 339 ms of which 7 ms to minimize.
[2024-06-01 21:19:37] [INFO ] Deduced a trap composed of 44 places in 335 ms of which 6 ms to minimize.
[2024-06-01 21:19:37] [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 21:19:37] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2024-06-01 21:19:38] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2024-06-01 21:19:38] [INFO ] Deduced a trap composed of 23 places in 360 ms of which 10 ms to minimize.
[2024-06-01 21:19:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:39] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-06-01 21:19:39] [INFO ] Deduced a trap composed of 23 places in 366 ms of which 8 ms to minimize.
[2024-06-01 21:19:40] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 7 ms to minimize.
[2024-06-01 21:19:40] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 6 ms to minimize.
[2024-06-01 21:19:40] [INFO ] Deduced a trap composed of 65 places in 312 ms of which 5 ms to minimize.
[2024-06-01 21:19:41] [INFO ] Deduced a trap composed of 31 places in 296 ms of which 6 ms to minimize.
[2024-06-01 21:19:41] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 6 ms to minimize.
[2024-06-01 21:19:41] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 6 ms to minimize.
[2024-06-01 21:19:42] [INFO ] Deduced a trap composed of 43 places in 280 ms of which 6 ms to minimize.
[2024-06-01 21:19:42] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 6 ms to minimize.
[2024-06-01 21:19:42] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 5 ms to minimize.
[2024-06-01 21:19:43] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 5 ms to minimize.
[2024-06-01 21:19:43] [INFO ] Deduced a trap composed of 58 places in 244 ms of which 5 ms to minimize.
[2024-06-01 21:19:43] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 5 ms to minimize.
[2024-06-01 21:19:43] [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)
[2024-06-01 21:19:44] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2024-06-01 21:19:44] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-06-01 21:19:45] [INFO ] Deduced a trap composed of 37 places in 398 ms of which 7 ms to minimize.
[2024-06-01 21:19:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:45] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-06-01 21:19:46] [INFO ] Deduced a trap composed of 37 places in 389 ms of which 7 ms to minimize.
[2024-06-01 21:19:46] [INFO ] Deduced a trap composed of 53 places in 371 ms of which 8 ms to minimize.
[2024-06-01 21:19:47] [INFO ] Deduced a trap composed of 32 places in 369 ms of which 7 ms to minimize.
[2024-06-01 21:19:47] [INFO ] Deduced a trap composed of 33 places in 368 ms of which 7 ms to minimize.
[2024-06-01 21:19:47] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 7 ms to minimize.
[2024-06-01 21:19:48] [INFO ] Deduced a trap composed of 45 places in 331 ms of which 6 ms to minimize.
[2024-06-01 21:19:48] [INFO ] Deduced a trap composed of 37 places in 310 ms of which 5 ms to minimize.
[2024-06-01 21:19:49] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 6 ms to minimize.
[2024-06-01 21:19:49] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 6 ms to minimize.
[2024-06-01 21:19:49] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 6 ms to minimize.
[2024-06-01 21:19:50] [INFO ] Deduced a trap composed of 37 places in 303 ms of which 6 ms to minimize.
[2024-06-01 21:19:50] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 6 ms to minimize.
[2024-06-01 21:19: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 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: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 21:19:50] [INFO ] [Real]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-06-01 21:19:51] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2024-06-01 21:19:51] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 6 ms to minimize.
[2024-06-01 21:19:51] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:51] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2024-06-01 21:19:52] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2024-06-01 21:19:52] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 5 ms to minimize.
[2024-06-01 21:19:53] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 6 ms to minimize.
[2024-06-01 21:19:53] [INFO ] Deduced a trap composed of 27 places in 277 ms of which 6 ms to minimize.
[2024-06-01 21:19:53] [INFO ] Deduced a trap composed of 35 places in 269 ms of which 5 ms to minimize.
[2024-06-01 21:19:54] [INFO ] Deduced a trap composed of 47 places in 265 ms of which 7 ms to minimize.
[2024-06-01 21:19:54] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 6 ms to minimize.
[2024-06-01 21:19:54] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 5 ms to minimize.
[2024-06-01 21:19:55] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 5 ms to minimize.
[2024-06-01 21:19:55] [INFO ] Deduced a trap composed of 26 places in 270 ms of which 6 ms to minimize.
[2024-06-01 21:19:55] [INFO ] Deduced a trap composed of 37 places in 259 ms of which 5 ms to minimize.
[2024-06-01 21:19:55] [INFO ] Deduced a trap composed of 51 places in 247 ms of which 5 ms to minimize.
[2024-06-01 21:19:56] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 5 ms to minimize.
[2024-06-01 21:19:56] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 5 ms to minimize.
[2024-06-01 21:19:56] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 4 ms to minimize.
[2024-06-01 21:19:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.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 21:19:57] [INFO ] [Real]Absence check using 121 positive place invariants in 52 ms returned sat
[2024-06-01 21:19:57] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2024-06-01 21:19:58] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 8 ms to minimize.
[2024-06-01 21:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:19:58] [INFO ] [Nat]Absence check using 121 positive place invariants in 58 ms returned sat
[2024-06-01 21:19:58] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2024-06-01 21:19:59] [INFO ] Deduced a trap composed of 31 places in 390 ms of which 8 ms to minimize.
[2024-06-01 21:19:59] [INFO ] Deduced a trap composed of 39 places in 376 ms of which 7 ms to minimize.
[2024-06-01 21:20:00] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 7 ms to minimize.
[2024-06-01 21:20:00] [INFO ] Deduced a trap composed of 30 places in 367 ms of which 7 ms to minimize.
[2024-06-01 21:20:01] [INFO ] Deduced a trap composed of 36 places in 362 ms of which 7 ms to minimize.
[2024-06-01 21:20:01] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 7 ms to minimize.
[2024-06-01 21:20:01] [INFO ] Deduced a trap composed of 32 places in 326 ms of which 6 ms to minimize.
[2024-06-01 21:20:02] [INFO ] Deduced a trap composed of 42 places in 331 ms of which 7 ms to minimize.
[2024-06-01 21:20:02] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 7 ms to minimize.
[2024-06-01 21:20:02] [INFO ] Deduced a trap composed of 36 places in 341 ms of which 6 ms to minimize.
[2024-06-01 21:20:03] [INFO ] Deduced a trap composed of 43 places in 316 ms of which 6 ms to minimize.
[2024-06-01 21:20:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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: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, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 476 transitions
Trivial Post-agglo rules discarded 476 transitions
Performed 476 trivial Post agglomeration. Transition count delta: 476
Iterating post reduction 0 with 476 rules applied. Total rules applied 476 place count 1503 transition count 1027
Reduce places removed 476 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 478 rules applied. Total rules applied 954 place count 1027 transition count 1025
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 959 place count 1026 transition count 1021
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 963 place count 1022 transition count 1021
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 118 Pre rules applied. Total rules applied 963 place count 1022 transition count 903
Deduced a syphon composed of 118 places in 1 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 4 with 236 rules applied. Total rules applied 1199 place count 904 transition count 903
Discarding 207 places :
Symmetric choice reduction at 4 with 207 rule applications. Total rules 1406 place count 697 transition count 696
Iterating global reduction 4 with 207 rules applied. Total rules applied 1613 place count 697 transition count 696
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 88 Pre rules applied. Total rules applied 1613 place count 697 transition count 608
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1789 place count 609 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 1 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 4 with 536 rules applied. Total rules applied 2325 place count 341 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2503 place count 252 transition count 426
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 2504 place count 252 transition count 425
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2505 place count 252 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2506 place count 251 transition count 424
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2507 place count 250 transition count 424
Applied a total of 2507 rules in 307 ms. Remains 250 /1503 variables (removed 1253) and now considering 424/1503 (removed 1079) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 317 ms. Remains : 250/1503 places, 424/1503 transitions.
// Phase 1: matrix 424 rows 250 cols
[2024-06-01 21:20:03] [INFO ] Computed 120 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (262 resets) in 3788 ms. (263 steps per ms)
FORMULA ShieldRVt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (89 resets) in 5955 ms. (503 steps per ms)
FORMULA ShieldRVt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-01 21:20:13] [INFO ] Invariant cache hit.
[2024-06-01 21:20:13] [INFO ] [Real]Absence check using 120 positive place invariants in 16 ms returned sat
[2024-06-01 21:20:13] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-06-01 21:20:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 21:20:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 21:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:20:13] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2024-06-01 21:20:13] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-06-01 21:20:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 21:20:13] [INFO ] Computed and/alt/rep : 421/1270/421 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 21:20:16] [INFO ] Added : 363 causal constraints over 73 iterations in 2460 ms. Result :sat
Minimization took 438 ms.
[2024-06-01 21:20:16] [INFO ] [Real]Absence check using 120 positive place invariants in 17 ms returned sat
[2024-06-01 21:20:16] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 21:20:16] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 21:20:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 21:20:16] [INFO ] [Nat]Absence check using 120 positive place invariants in 14 ms returned sat
[2024-06-01 21:20:17] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-06-01 21:20:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 21:20:17] [INFO ] Computed and/alt/rep : 421/1270/421 causal constraints (skipped 0 transitions) in 21 ms.
[2024-06-01 21:20:19] [INFO ] Added : 339 causal constraints over 69 iterations in 2173 ms. Result :sat
Minimization took 444 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ShieldRVt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 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 64061 ms.
ITS solved all properties within timeout
BK_STOP 1717276820327
--------------------
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="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-5568"
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 r528-tall-171683762301005"
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 '
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 ;