Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 7.6K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 512K May 10 09:34 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-030B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-030B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652960453670

Running Version 202205111006
[2022-05-19 11:40:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:40:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:40:55] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2022-05-19 11:40:55] [INFO ] Transformed 2103 places.
[2022-05-19 11:40:55] [INFO ] Transformed 1953 transitions.
[2022-05-19 11:40:55] [INFO ] Found NUPN structural information;
[2022-05-19 11:40:55] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1953 rows 2103 cols
[2022-05-19 11:40:55] [INFO ] Computed 271 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :8
FORMULA ShieldIIPt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) 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 8) 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 8) seen :0
// Phase 1: matrix 1953 rows 2103 cols
[2022-05-19 11:40:55] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 11:40:56] [INFO ] [Real]Absence check using 271 positive place invariants in 114 ms returned sat
[2022-05-19 11:40:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:40:56] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-05-19 11:40:57] [INFO ] Deduced a trap composed of 25 places in 625 ms of which 7 ms to minimize.
[2022-05-19 11:40:58] [INFO ] Deduced a trap composed of 21 places in 592 ms of which 2 ms to minimize.
[2022-05-19 11:40:59] [INFO ] Deduced a trap composed of 25 places in 522 ms of which 2 ms to minimize.
[2022-05-19 11:41:00] [INFO ] Deduced a trap composed of 19 places in 928 ms of which 3 ms to minimize.
[2022-05-19 11:41:00] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 1 ms to minimize.
[2022-05-19 11:41:01] [INFO ] Deduced a trap composed of 13 places in 944 ms of which 6 ms to minimize.
[2022-05-19 11:41:01] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:02] [INFO ] [Real]Absence check using 271 positive place invariants in 100 ms returned sat
[2022-05-19 11:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:02] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2022-05-19 11:41:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:03] [INFO ] [Nat]Absence check using 271 positive place invariants in 112 ms returned sat
[2022-05-19 11:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:04] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2022-05-19 11:41:04] [INFO ] Deduced a trap composed of 31 places in 484 ms of which 3 ms to minimize.
[2022-05-19 11:41:05] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 1 ms to minimize.
[2022-05-19 11:41:05] [INFO ] Deduced a trap composed of 20 places in 486 ms of which 1 ms to minimize.
[2022-05-19 11:41:06] [INFO ] Deduced a trap composed of 28 places in 447 ms of which 1 ms to minimize.
[2022-05-19 11:41:06] [INFO ] Deduced a trap composed of 12 places in 438 ms of which 2 ms to minimize.
[2022-05-19 11:41:07] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 1 ms to minimize.
[2022-05-19 11:41:07] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 3 ms to minimize.
[2022-05-19 11:41:08] [INFO ] Deduced a trap composed of 26 places in 426 ms of which 1 ms to minimize.
[2022-05-19 11:41: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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:08] [INFO ] [Real]Absence check using 271 positive place invariants in 116 ms returned sat
[2022-05-19 11:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:09] [INFO ] [Real]Absence check using state equation in 811 ms returned sat
[2022-05-19 11:41:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:10] [INFO ] [Nat]Absence check using 271 positive place invariants in 99 ms returned sat
[2022-05-19 11:41:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:10] [INFO ] [Nat]Absence check using state equation in 804 ms returned sat
[2022-05-19 11:41:11] [INFO ] Deduced a trap composed of 44 places in 414 ms of which 1 ms to minimize.
[2022-05-19 11:41:11] [INFO ] Deduced a trap composed of 35 places in 397 ms of which 1 ms to minimize.
[2022-05-19 11:41:12] [INFO ] Deduced a trap composed of 34 places in 409 ms of which 1 ms to minimize.
[2022-05-19 11:41:12] [INFO ] Deduced a trap composed of 24 places in 402 ms of which 1 ms to minimize.
[2022-05-19 11:41:13] [INFO ] Deduced a trap composed of 18 places in 394 ms of which 1 ms to minimize.
[2022-05-19 11:41:13] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 1 ms to minimize.
[2022-05-19 11:41:14] [INFO ] Deduced a trap composed of 18 places in 398 ms of which 1 ms to minimize.
[2022-05-19 11:41:14] [INFO ] Deduced a trap composed of 27 places in 391 ms of which 1 ms to minimize.
[2022-05-19 11:41:15] [INFO ] Deduced a trap composed of 13 places in 1022 ms of which 3 ms to minimize.
[2022-05-19 11:41:15] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:16] [INFO ] [Real]Absence check using 271 positive place invariants in 97 ms returned sat
[2022-05-19 11:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:16] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2022-05-19 11:41:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:17] [INFO ] [Nat]Absence check using 271 positive place invariants in 103 ms returned sat
[2022-05-19 11:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:18] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2022-05-19 11:41:18] [INFO ] Deduced a trap composed of 23 places in 413 ms of which 1 ms to minimize.
[2022-05-19 11:41:19] [INFO ] Deduced a trap composed of 21 places in 393 ms of which 2 ms to minimize.
[2022-05-19 11:41:19] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2022-05-19 11:41:20] [INFO ] Deduced a trap composed of 18 places in 386 ms of which 2 ms to minimize.
[2022-05-19 11:41:20] [INFO ] Deduced a trap composed of 21 places in 402 ms of which 2 ms to minimize.
[2022-05-19 11:41:21] [INFO ] Deduced a trap composed of 24 places in 408 ms of which 1 ms to minimize.
[2022-05-19 11:41:21] [INFO ] Deduced a trap composed of 19 places in 423 ms of which 1 ms to minimize.
[2022-05-19 11:41:22] [INFO ] Deduced a trap composed of 18 places in 390 ms of which 1 ms to minimize.
[2022-05-19 11:41:22] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:22] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2022-05-19 11:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:23] [INFO ] [Real]Absence check using state equation in 763 ms returned sat
[2022-05-19 11:41:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:23] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2022-05-19 11:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:24] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2022-05-19 11:41:25] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 2 ms to minimize.
[2022-05-19 11:41:25] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 1 ms to minimize.
[2022-05-19 11:41:26] [INFO ] Deduced a trap composed of 25 places in 456 ms of which 2 ms to minimize.
[2022-05-19 11:41:26] [INFO ] Deduced a trap composed of 20 places in 439 ms of which 1 ms to minimize.
[2022-05-19 11:41:27] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 1 ms to minimize.
[2022-05-19 11:41:27] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 2 ms to minimize.
[2022-05-19 11:41:28] [INFO ] Deduced a trap composed of 19 places in 413 ms of which 1 ms to minimize.
[2022-05-19 11:41:28] [INFO ] Deduced a trap composed of 17 places in 421 ms of which 1 ms to minimize.
[2022-05-19 11:41: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:29] [INFO ] [Real]Absence check using 271 positive place invariants in 96 ms returned sat
[2022-05-19 11:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:29] [INFO ] [Real]Absence check using state equation in 814 ms returned sat
[2022-05-19 11:41:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:30] [INFO ] [Nat]Absence check using 271 positive place invariants in 98 ms returned sat
[2022-05-19 11:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:31] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2022-05-19 11:41:31] [INFO ] Deduced a trap composed of 18 places in 446 ms of which 1 ms to minimize.
[2022-05-19 11:41:32] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 1 ms to minimize.
[2022-05-19 11:41:32] [INFO ] Deduced a trap composed of 19 places in 434 ms of which 1 ms to minimize.
[2022-05-19 11:41:33] [INFO ] Deduced a trap composed of 19 places in 449 ms of which 1 ms to minimize.
[2022-05-19 11:41:33] [INFO ] Deduced a trap composed of 24 places in 432 ms of which 1 ms to minimize.
[2022-05-19 11:41:34] [INFO ] Deduced a trap composed of 21 places in 454 ms of which 1 ms to minimize.
[2022-05-19 11:41:34] [INFO ] Deduced a trap composed of 25 places in 422 ms of which 1 ms to minimize.
[2022-05-19 11:41:35] [INFO ] Deduced a trap composed of 22 places in 397 ms of which 1 ms to minimize.
[2022-05-19 11:41:35] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:35] [INFO ] [Real]Absence check using 271 positive place invariants in 96 ms returned sat
[2022-05-19 11:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:36] [INFO ] [Real]Absence check using state equation in 778 ms returned sat
[2022-05-19 11:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:36] [INFO ] [Nat]Absence check using 271 positive place invariants in 111 ms returned sat
[2022-05-19 11:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:37] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2022-05-19 11:41:38] [INFO ] Deduced a trap composed of 22 places in 490 ms of which 1 ms to minimize.
[2022-05-19 11:41:38] [INFO ] Deduced a trap composed of 19 places in 467 ms of which 2 ms to minimize.
[2022-05-19 11:41:39] [INFO ] Deduced a trap composed of 21 places in 457 ms of which 1 ms to minimize.
[2022-05-19 11:41:39] [INFO ] Deduced a trap composed of 24 places in 526 ms of which 2 ms to minimize.
[2022-05-19 11:41:40] [INFO ] Deduced a trap composed of 31 places in 429 ms of which 1 ms to minimize.
[2022-05-19 11:41:40] [INFO ] Deduced a trap composed of 32 places in 463 ms of which 1 ms to minimize.
[2022-05-19 11:41:41] [INFO ] Deduced a trap composed of 32 places in 433 ms of which 1 ms to minimize.
[2022-05-19 11:41:41] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 1 ms to minimize.
[2022-05-19 11:41:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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)
[2022-05-19 11:41:42] [INFO ] [Real]Absence check using 271 positive place invariants in 101 ms returned sat
[2022-05-19 11:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:43] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-05-19 11:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 11:41:43] [INFO ] [Nat]Absence check using 271 positive place invariants in 101 ms returned sat
[2022-05-19 11:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 11:41:44] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2022-05-19 11:41:44] [INFO ] Deduced a trap composed of 27 places in 468 ms of which 4 ms to minimize.
[2022-05-19 11:41:45] [INFO ] Deduced a trap composed of 19 places in 466 ms of which 2 ms to minimize.
[2022-05-19 11:41:45] [INFO ] Deduced a trap composed of 30 places in 478 ms of which 1 ms to minimize.
[2022-05-19 11:41:46] [INFO ] Deduced a trap composed of 25 places in 436 ms of which 1 ms to minimize.
[2022-05-19 11:41:46] [INFO ] Deduced a trap composed of 42 places in 442 ms of which 1 ms to minimize.
[2022-05-19 11:41:47] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 2 ms to minimize.
[2022-05-19 11:41:48] [INFO ] Deduced a trap composed of 22 places in 448 ms of which 2 ms to minimize.
[2022-05-19 11:41:48] [INFO ] Deduced a trap composed of 21 places in 406 ms of which 1 ms to minimize.
[2022-05-19 11:41:48] [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 7
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 2103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 507 rules applied. Total rules applied 507 place count 2103 transition count 1446
Reduce places removed 507 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 509 rules applied. Total rules applied 1016 place count 1596 transition count 1444
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1018 place count 1595 transition count 1443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1019 place count 1594 transition count 1443
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 1019 place count 1594 transition count 1323
Deduced a syphon composed of 120 places in 7 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1259 place count 1474 transition count 1323
Discarding 210 places :
Symmetric choice reduction at 4 with 210 rule applications. Total rules 1469 place count 1264 transition count 1113
Iterating global reduction 4 with 210 rules applied. Total rules applied 1679 place count 1264 transition count 1113
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 89 Pre rules applied. Total rules applied 1679 place count 1264 transition count 1024
Deduced a syphon composed of 89 places in 5 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1857 place count 1175 transition count 1024
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 506
Deduced a syphon composed of 506 places in 1 ms
Reduce places removed 506 places and 0 transitions.
Iterating global reduction 4 with 1012 rules applied. Total rules applied 2869 place count 669 transition count 518
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
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 3045 place count 581 transition count 576
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3046 place count 581 transition count 575
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3048 place count 581 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3050 place count 579 transition count 573
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 3079 place count 579 transition count 573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3080 place count 578 transition count 572
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3082 place count 576 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3082 place count 576 transition count 571
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 3084 place count 575 transition count 571
Applied a total of 3084 rules in 622 ms. Remains 575 /2103 variables (removed 1528) and now considering 571/1953 (removed 1382) transitions.
Finished structural reductions, in 1 iterations. Remains : 575/2103 places, 571/1953 transitions.
// Phase 1: matrix 571 rows 575 cols
[2022-05-19 11:41:49] [INFO ] Computed 269 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5536 ms. (steps per millisecond=180 ) properties (out of 8) seen :8
FORMULA ShieldIIPt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 59766 ms.

BK_STOP 1652960514719

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-030B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-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 r222-tall-165286025000301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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