About the Execution of ITS-Tools for ShieldRVt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 347.512 | 54579.00 | 68508.00 | 218.80 | 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/mcc2022-input.r222-tall-165286026101005.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 ShieldRVt-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-165286026101005
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 8.1K Apr 30 01:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 364K 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 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 1653079330899
Running Version 202205111006
[2022-05-20 20:42:12] [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-20 20:42:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 20:42:12] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2022-05-20 20:42:12] [INFO ] Transformed 1503 places.
[2022-05-20 20:42:12] [INFO ] Transformed 1503 transitions.
[2022-05-20 20:42:12] [INFO ] Found NUPN structural information;
[2022-05-20 20:42:12] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 263 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1503 rows 1503 cols
[2022-05-20 20:42:12] [INFO ] Computed 121 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :8
FORMULA ShieldRVt-PT-030B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 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 11 ms. (steps per millisecond=909 ) 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 11 ms. (steps per millisecond=909 ) 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 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
// Phase 1: matrix 1503 rows 1503 cols
[2022-05-20 20:42:12] [INFO ] Computed 121 place invariants in 11 ms
[2022-05-20 20:42:13] [INFO ] [Real]Absence check using 121 positive place invariants in 66 ms returned sat
[2022-05-20 20:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:13] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2022-05-20 20:42:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-05-20 20:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:14] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-05-20 20:42:15] [INFO ] Deduced a trap composed of 44 places in 443 ms of which 6 ms to minimize.
[2022-05-20 20:42:15] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 2 ms to minimize.
[2022-05-20 20:42:15] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 1 ms to minimize.
[2022-05-20 20:42:16] [INFO ] Deduced a trap composed of 25 places in 390 ms of which 2 ms to minimize.
[2022-05-20 20:42:16] [INFO ] Deduced a trap composed of 51 places in 356 ms of which 2 ms to minimize.
[2022-05-20 20:42:17] [INFO ] Deduced a trap composed of 40 places in 340 ms of which 1 ms to minimize.
[2022-05-20 20:42:17] [INFO ] Deduced a trap composed of 34 places in 334 ms of which 1 ms to minimize.
[2022-05-20 20:42:17] [INFO ] Deduced a trap composed of 32 places in 345 ms of which 1 ms to minimize.
[2022-05-20 20:42:18] [INFO ] Deduced a trap composed of 40 places in 325 ms of which 1 ms to minimize.
[2022-05-20 20:42:18] [INFO ] Deduced a trap composed of 46 places in 313 ms of which 1 ms to minimize.
[2022-05-20 20:42:19] [INFO ] Deduced a trap composed of 19 places in 532 ms of which 1 ms to minimize.
[2022-05-20 20:42:19] [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: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-20 20:42:19] [INFO ] [Real]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-05-20 20:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:20] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2022-05-20 20:42:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 56 ms returned sat
[2022-05-20 20:42:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:20] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-05-20 20:42:21] [INFO ] Deduced a trap composed of 27 places in 378 ms of which 2 ms to minimize.
[2022-05-20 20:42:21] [INFO ] Deduced a trap composed of 36 places in 364 ms of which 1 ms to minimize.
[2022-05-20 20:42:22] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 3 ms to minimize.
[2022-05-20 20:42:22] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 1 ms to minimize.
[2022-05-20 20:42:23] [INFO ] Deduced a trap composed of 38 places in 343 ms of which 0 ms to minimize.
[2022-05-20 20:42:23] [INFO ] Deduced a trap composed of 36 places in 336 ms of which 1 ms to minimize.
[2022-05-20 20:42:23] [INFO ] Deduced a trap composed of 47 places in 345 ms of which 1 ms to minimize.
[2022-05-20 20:42:24] [INFO ] Deduced a trap composed of 26 places in 341 ms of which 1 ms to minimize.
[2022-05-20 20:42:24] [INFO ] Deduced a trap composed of 34 places in 330 ms of which 1 ms to minimize.
[2022-05-20 20:42:25] [INFO ] Deduced a trap composed of 27 places in 335 ms of which 1 ms to minimize.
[2022-05-20 20:42:25] [INFO ] Deduced a trap composed of 34 places in 321 ms of which 1 ms to minimize.
[2022-05-20 20:42:25] [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-20 20:42:25] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2022-05-20 20:42:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:26] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2022-05-20 20:42:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:26] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-05-20 20:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:26] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2022-05-20 20:42:27] [INFO ] Deduced a trap composed of 47 places in 375 ms of which 1 ms to minimize.
[2022-05-20 20:42:27] [INFO ] Deduced a trap composed of 34 places in 366 ms of which 1 ms to minimize.
[2022-05-20 20:42:28] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 4 ms to minimize.
[2022-05-20 20:42:28] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 1 ms to minimize.
[2022-05-20 20:42:29] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 1 ms to minimize.
[2022-05-20 20:42:29] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2022-05-20 20:42:29] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 1 ms to minimize.
[2022-05-20 20:42:30] [INFO ] Deduced a trap composed of 26 places in 373 ms of which 2 ms to minimize.
[2022-05-20 20:42:30] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 4 ms to minimize.
[2022-05-20 20:42:31] [INFO ] Deduced a trap composed of 25 places in 325 ms of which 1 ms to minimize.
[2022-05-20 20:42:31] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 1 ms to minimize.
[2022-05-20 20:42:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-20 20:42:31] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2022-05-20 20:42:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:32] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-05-20 20:42:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2022-05-20 20:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:33] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2022-05-20 20:42:33] [INFO ] Deduced a trap composed of 28 places in 375 ms of which 2 ms to minimize.
[2022-05-20 20:42:33] [INFO ] Deduced a trap composed of 26 places in 364 ms of which 1 ms to minimize.
[2022-05-20 20:42:34] [INFO ] Deduced a trap composed of 29 places in 352 ms of which 1 ms to minimize.
[2022-05-20 20:42:34] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 1 ms to minimize.
[2022-05-20 20:42:35] [INFO ] Deduced a trap composed of 47 places in 354 ms of which 1 ms to minimize.
[2022-05-20 20:42:35] [INFO ] Deduced a trap composed of 23 places in 348 ms of which 1 ms to minimize.
[2022-05-20 20:42:35] [INFO ] Deduced a trap composed of 25 places in 341 ms of which 1 ms to minimize.
[2022-05-20 20:42:36] [INFO ] Deduced a trap composed of 25 places in 339 ms of which 1 ms to minimize.
[2022-05-20 20:42:36] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 1 ms to minimize.
[2022-05-20 20:42:37] [INFO ] Deduced a trap composed of 48 places in 333 ms of which 1 ms to minimize.
[2022-05-20 20:42:37] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2022-05-20 20:42: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 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-20 20:42:37] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2022-05-20 20:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:38] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2022-05-20 20:42:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2022-05-20 20:42:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:38] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-05-20 20:42:39] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 1 ms to minimize.
[2022-05-20 20:42:39] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2022-05-20 20:42:40] [INFO ] Deduced a trap composed of 53 places in 343 ms of which 1 ms to minimize.
[2022-05-20 20:42:40] [INFO ] Deduced a trap composed of 31 places in 346 ms of which 1 ms to minimize.
[2022-05-20 20:42:40] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 1 ms to minimize.
[2022-05-20 20:42:41] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 1 ms to minimize.
[2022-05-20 20:42:41] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 1 ms to minimize.
[2022-05-20 20:42:42] [INFO ] Deduced a trap composed of 34 places in 327 ms of which 1 ms to minimize.
[2022-05-20 20:42:42] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 1 ms to minimize.
[2022-05-20 20:42:42] [INFO ] Deduced a trap composed of 24 places in 315 ms of which 1 ms to minimize.
[2022-05-20 20:42:43] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 1 ms to minimize.
[2022-05-20 20:42:43] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 1 ms to minimize.
[2022-05-20 20:42: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 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-20 20:42:43] [INFO ] [Real]Absence check using 121 positive place invariants in 48 ms returned sat
[2022-05-20 20:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:44] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2022-05-20 20:42:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2022-05-20 20:42:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:45] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2022-05-20 20:42:45] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 4 ms to minimize.
[2022-05-20 20:42:45] [INFO ] Deduced a trap composed of 35 places in 367 ms of which 1 ms to minimize.
[2022-05-20 20:42:46] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 1 ms to minimize.
[2022-05-20 20:42:46] [INFO ] Deduced a trap composed of 23 places in 330 ms of which 1 ms to minimize.
[2022-05-20 20:42:47] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2022-05-20 20:42:47] [INFO ] Deduced a trap composed of 35 places in 337 ms of which 1 ms to minimize.
[2022-05-20 20:42:47] [INFO ] Deduced a trap composed of 34 places in 330 ms of which 1 ms to minimize.
[2022-05-20 20:42:48] [INFO ] Deduced a trap composed of 44 places in 325 ms of which 0 ms to minimize.
[2022-05-20 20:42:48] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 1 ms to minimize.
[2022-05-20 20:42:49] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2022-05-20 20:42:49] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 2 ms to minimize.
[2022-05-20 20:42:49] [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-20 20:42:49] [INFO ] [Real]Absence check using 121 positive place invariants in 49 ms returned sat
[2022-05-20 20:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:50] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2022-05-20 20:42:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-05-20 20:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:51] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2022-05-20 20:42:51] [INFO ] Deduced a trap composed of 34 places in 381 ms of which 1 ms to minimize.
[2022-05-20 20:42:51] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 12 ms to minimize.
[2022-05-20 20:42:52] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 1 ms to minimize.
[2022-05-20 20:42:52] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 1 ms to minimize.
[2022-05-20 20:42:53] [INFO ] Deduced a trap composed of 33 places in 356 ms of which 1 ms to minimize.
[2022-05-20 20:42:53] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 1 ms to minimize.
[2022-05-20 20:42:53] [INFO ] Deduced a trap composed of 35 places in 372 ms of which 1 ms to minimize.
[2022-05-20 20:42:54] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 1 ms to minimize.
[2022-05-20 20:42:54] [INFO ] Deduced a trap composed of 26 places in 357 ms of which 1 ms to minimize.
[2022-05-20 20:42:55] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 1 ms to minimize.
[2022-05-20 20:42:55] [INFO ] Deduced a trap composed of 40 places in 319 ms of which 1 ms to minimize.
[2022-05-20 20:42:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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-20 20:42:55] [INFO ] [Real]Absence check using 121 positive place invariants in 47 ms returned sat
[2022-05-20 20:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:56] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2022-05-20 20:42:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 20:42:56] [INFO ] [Nat]Absence check using 121 positive place invariants in 51 ms returned sat
[2022-05-20 20:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 20:42:57] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2022-05-20 20:42:57] [INFO ] Deduced a trap composed of 33 places in 363 ms of which 1 ms to minimize.
[2022-05-20 20:42:57] [INFO ] Deduced a trap composed of 28 places in 344 ms of which 1 ms to minimize.
[2022-05-20 20:42:58] [INFO ] Deduced a trap composed of 23 places in 331 ms of which 1 ms to minimize.
[2022-05-20 20:42:58] [INFO ] Deduced a trap composed of 49 places in 327 ms of which 1 ms to minimize.
[2022-05-20 20:42:59] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 0 ms to minimize.
[2022-05-20 20:42:59] [INFO ] Deduced a trap composed of 32 places in 324 ms of which 1 ms to minimize.
[2022-05-20 20:42:59] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 1 ms to minimize.
[2022-05-20 20:43:00] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 1 ms to minimize.
[2022-05-20 20:43:00] [INFO ] Deduced a trap composed of 52 places in 328 ms of which 1 ms to minimize.
[2022-05-20 20:43:00] [INFO ] Deduced a trap composed of 37 places in 342 ms of which 1 ms to minimize.
[2022-05-20 20:43:01] [INFO ] Deduced a trap composed of 50 places in 334 ms of which 1 ms to minimize.
[2022-05-20 20:43: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 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 1503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 474 transitions
Trivial Post-agglo rules discarded 474 transitions
Performed 474 trivial Post agglomeration. Transition count delta: 474
Iterating post reduction 0 with 474 rules applied. Total rules applied 474 place count 1503 transition count 1029
Reduce places removed 474 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 476 rules applied. Total rules applied 950 place count 1029 transition count 1027
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 955 place count 1028 transition count 1023
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 959 place count 1024 transition count 1023
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 959 place count 1024 transition count 904
Deduced a syphon composed of 119 places in 3 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1197 place count 905 transition count 904
Discarding 209 places :
Symmetric choice reduction at 4 with 209 rule applications. Total rules 1406 place count 696 transition count 695
Iterating global reduction 4 with 209 rules applied. Total rules applied 1615 place count 696 transition count 695
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 87 Pre rules applied. Total rules applied 1615 place count 696 transition count 608
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1789 place count 609 transition count 608
Performed 270 Post agglomeration using F-continuation condition.Transition count delta: 270
Deduced a syphon composed of 270 places in 1 ms
Reduce places removed 270 places and 0 transitions.
Iterating global reduction 4 with 540 rules applied. Total rules applied 2329 place count 339 transition count 338
Renaming transitions due to excessive name length > 1024 char.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 2499 place count 254 transition count 417
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2500 place count 254 transition count 416
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2501 place count 253 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2502 place count 252 transition count 415
Applied a total of 2502 rules in 367 ms. Remains 252 /1503 variables (removed 1251) and now considering 415/1503 (removed 1088) transitions.
Finished structural reductions, in 1 iterations. Remains : 252/1503 places, 415/1503 transitions.
// Phase 1: matrix 415 rows 252 cols
[2022-05-20 20:43:01] [INFO ] Computed 120 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 261 resets, run finished after 3661 ms. (steps per millisecond=273 ) properties (out of 8) seen :8
FORMULA ShieldRVt-PT-030B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 53366 ms.
BK_STOP 1653079385478
--------------------
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="ShieldRVt-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 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 r222-tall-165286026101005"
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 ;