fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r233-tall-165286037100124
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ShieldIIPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11560.048 2979529.00 3035688.00 13754.60 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.r233-tall-165286037100124.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 gold2021
Input is ShieldIIPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 5.9K Apr 29 18:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 29 18:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K 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 860K 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-050B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653032499743

Running Version 0
[2022-05-20 07:41:41] [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 07:41:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:41:41] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-20 07:41:41] [INFO ] Transformed 3503 places.
[2022-05-20 07:41:41] [INFO ] Transformed 3253 transitions.
[2022-05-20 07:41:41] [INFO ] Found NUPN structural information;
[2022-05-20 07:41:41] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 95 ms.
// Phase 1: matrix 3253 rows 3503 cols
[2022-05-20 07:41:41] [INFO ] Computed 451 place invariants in 51 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 16) seen :9
FORMULA ShieldIIPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) 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 7) seen :0
// Phase 1: matrix 3253 rows 3503 cols
[2022-05-20 07:41:41] [INFO ] Computed 451 place invariants in 29 ms
[2022-05-20 07:41:42] [INFO ] [Real]Absence check using 451 positive place invariants in 214 ms returned sat
[2022-05-20 07:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:44] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2022-05-20 07:41:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:45] [INFO ] [Nat]Absence check using 451 positive place invariants in 208 ms returned sat
[2022-05-20 07:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:48] [INFO ] [Nat]Absence check using state equation in 3645 ms returned sat
[2022-05-20 07:41:50] [INFO ] Deduced a trap composed of 21 places in 1127 ms of which 11 ms to minimize.
[2022-05-20 07:41:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:41:50] [INFO ] [Real]Absence check using 451 positive place invariants in 217 ms returned sat
[2022-05-20 07:41:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:52] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2022-05-20 07:41:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:52] [INFO ] [Nat]Absence check using 451 positive place invariants in 208 ms returned sat
[2022-05-20 07:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:54] [INFO ] [Nat]Absence check using state equation in 1595 ms returned sat
[2022-05-20 07:41:55] [INFO ] Deduced a trap composed of 19 places in 1000 ms of which 2 ms to minimize.
[2022-05-20 07:41:56] [INFO ] Deduced a trap composed of 30 places in 1098 ms of which 9 ms to minimize.
[2022-05-20 07:41:58] [INFO ] Deduced a trap composed of 29 places in 1075 ms of which 5 ms to minimize.
[2022-05-20 07:41:58] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:41:58] [INFO ] [Real]Absence check using 451 positive place invariants in 193 ms returned sat
[2022-05-20 07:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:00] [INFO ] [Real]Absence check using state equation in 1616 ms returned sat
[2022-05-20 07:42:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:01] [INFO ] [Nat]Absence check using 451 positive place invariants in 205 ms returned sat
[2022-05-20 07:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:02] [INFO ] [Nat]Absence check using state equation in 1887 ms returned sat
[2022-05-20 07:42:04] [INFO ] Deduced a trap composed of 17 places in 1273 ms of which 16 ms to minimize.
[2022-05-20 07:42:05] [INFO ] Deduced a trap composed of 23 places in 1196 ms of which 2 ms to minimize.
[2022-05-20 07:42:05] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:42:06] [INFO ] [Real]Absence check using 451 positive place invariants in 193 ms returned sat
[2022-05-20 07:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:07] [INFO ] [Real]Absence check using state equation in 1606 ms returned sat
[2022-05-20 07:42:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:08] [INFO ] [Nat]Absence check using 451 positive place invariants in 199 ms returned sat
[2022-05-20 07:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:10] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2022-05-20 07:42:11] [INFO ] Deduced a trap composed of 26 places in 1138 ms of which 2 ms to minimize.
[2022-05-20 07:42:12] [INFO ] Deduced a trap composed of 31 places in 1095 ms of which 2 ms to minimize.
[2022-05-20 07:42:13] [INFO ] Deduced a trap composed of 24 places in 1071 ms of which 2 ms to minimize.
[2022-05-20 07:42:13] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:42:14] [INFO ] [Real]Absence check using 451 positive place invariants in 192 ms returned sat
[2022-05-20 07:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:16] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2022-05-20 07:42:17] [INFO ] Deduced a trap composed of 22 places in 1052 ms of which 3 ms to minimize.
[2022-05-20 07:42:18] [INFO ] Deduced a trap composed of 20 places in 1061 ms of which 2 ms to minimize.
[2022-05-20 07:42:19] [INFO ] Deduced a trap composed of 23 places in 1039 ms of which 2 ms to minimize.
[2022-05-20 07: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:42:20] [INFO ] [Real]Absence check using 451 positive place invariants in 198 ms returned sat
[2022-05-20 07:42:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:21] [INFO ] [Real]Absence check using state equation in 1556 ms returned sat
[2022-05-20 07:42:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:22] [INFO ] [Nat]Absence check using 451 positive place invariants in 195 ms returned sat
[2022-05-20 07:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:24] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2022-05-20 07:42:25] [INFO ] Deduced a trap composed of 20 places in 1465 ms of which 3 ms to minimize.
[2022-05-20 07:42:27] [INFO ] Deduced a trap composed of 24 places in 1472 ms of which 3 ms to minimize.
[2022-05-20 07:42:27] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-20 07:42:28] [INFO ] [Real]Absence check using 451 positive place invariants in 195 ms returned sat
[2022-05-20 07:42:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:29] [INFO ] [Real]Absence check using state equation in 1590 ms returned sat
[2022-05-20 07:42:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:30] [INFO ] [Nat]Absence check using 451 positive place invariants in 198 ms returned sat
[2022-05-20 07:42:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:31] [INFO ] [Nat]Absence check using state equation in 1597 ms returned sat
[2022-05-20 07:42:33] [INFO ] Deduced a trap composed of 24 places in 1140 ms of which 3 ms to minimize.
[2022-05-20 07:42:34] [INFO ] Deduced a trap composed of 25 places in 1152 ms of which 2 ms to minimize.
[2022-05-20 07:42:35] [INFO ] Deduced a trap composed of 17 places in 1093 ms of which 2 ms to minimize.
[2022-05-20 07:42: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 3503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 847 transitions
Trivial Post-agglo rules discarded 847 transitions
Performed 847 trivial Post agglomeration. Transition count delta: 847
Iterating post reduction 0 with 847 rules applied. Total rules applied 847 place count 3503 transition count 2406
Reduce places removed 847 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 849 rules applied. Total rules applied 1696 place count 2656 transition count 2404
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 1699 place count 2655 transition count 2402
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1701 place count 2653 transition count 2402
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 201 Pre rules applied. Total rules applied 1701 place count 2653 transition count 2201
Deduced a syphon composed of 201 places in 7 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 4 with 402 rules applied. Total rules applied 2103 place count 2452 transition count 2201
Discarding 348 places :
Symmetric choice reduction at 4 with 348 rule applications. Total rules 2451 place count 2104 transition count 1853
Iterating global reduction 4 with 348 rules applied. Total rules applied 2799 place count 2104 transition count 1853
Performed 148 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 148 Pre rules applied. Total rules applied 2799 place count 2104 transition count 1705
Deduced a syphon composed of 148 places in 12 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 4 with 296 rules applied. Total rules applied 3095 place count 1956 transition count 1705
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 3 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 4 with 1696 rules applied. Total rules applied 4791 place count 1108 transition count 857
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4993 place count 1007 transition count 923
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 5087 place count 960 transition count 954
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5088 place count 960 transition count 953
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5089 place count 960 transition count 952
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 5090 place count 959 transition count 952
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 6 with 50 rules applied. Total rules applied 5140 place count 959 transition count 952
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 5141 place count 958 transition count 951
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 5143 place count 956 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 5143 place count 956 transition count 950
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 5145 place count 955 transition count 950
Applied a total of 5145 rules in 1250 ms. Remains 955 /3503 variables (removed 2548) and now considering 950/3253 (removed 2303) transitions.
Finished structural reductions, in 1 iterations. Remains : 955/3503 places, 950/3253 transitions.
// Phase 1: matrix 950 rows 955 cols
[2022-05-20 07:42:36] [INFO ] Computed 449 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7138 ms. (steps per millisecond=140 ) properties (out of 7) seen :2
FORMULA ShieldIIPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4784 ms. (steps per millisecond=209 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4760 ms. (steps per millisecond=210 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4826 ms. (steps per millisecond=207 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4786 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4772 ms. (steps per millisecond=209 ) properties (out of 5) seen :0
// Phase 1: matrix 950 rows 955 cols
[2022-05-20 07:43:07] [INFO ] Computed 449 place invariants in 8 ms
[2022-05-20 07:43:08] [INFO ] [Real]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-20 07:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:08] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-05-20 07:43:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:43:08] [INFO ] [Nat]Absence check using 449 positive place invariants in 62 ms returned sat
[2022-05-20 07:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:08] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2022-05-20 07:43:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:43:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:43:08] [INFO ] Computed and/alt/rep : 947/1685/947 causal constraints (skipped 0 transitions) in 54 ms.
[2022-05-20 07:43:23] [INFO ] Added : 883 causal constraints over 178 iterations in 15069 ms. Result :sat
Minimization took 3001 ms.
[2022-05-20 07:43:27] [INFO ] [Real]Absence check using 449 positive place invariants in 56 ms returned sat
[2022-05-20 07:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:27] [INFO ] [Real]Absence check using state equation in 282 ms returned sat
[2022-05-20 07:43:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:43:27] [INFO ] [Nat]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-20 07:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:27] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-20 07:43:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:43:27] [INFO ] Computed and/alt/rep : 947/1685/947 causal constraints (skipped 0 transitions) in 42 ms.
[2022-05-20 07:43:42] [INFO ] Added : 868 causal constraints over 174 iterations in 14499 ms. Result :sat
Minimization took 3056 ms.
[2022-05-20 07:43:45] [INFO ] [Real]Absence check using 449 positive place invariants in 64 ms returned sat
[2022-05-20 07:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:45] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:43:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:43:46] [INFO ] [Nat]Absence check using 449 positive place invariants in 61 ms returned sat
[2022-05-20 07:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:46] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2022-05-20 07:43:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:43:46] [INFO ] Computed and/alt/rep : 947/1685/947 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:43:59] [INFO ] Added : 859 causal constraints over 173 iterations in 13027 ms. Result :sat
Minimization took 1723 ms.
[2022-05-20 07:44:01] [INFO ] [Real]Absence check using 449 positive place invariants in 61 ms returned sat
[2022-05-20 07:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:01] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-20 07:44:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:01] [INFO ] [Nat]Absence check using 449 positive place invariants in 62 ms returned sat
[2022-05-20 07:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:02] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-20 07:44:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:02] [INFO ] Computed and/alt/rep : 947/1685/947 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-20 07:44:15] [INFO ] Added : 855 causal constraints over 171 iterations in 13752 ms. Result :sat
Minimization took 2322 ms.
[2022-05-20 07:44:18] [INFO ] [Real]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-20 07:44:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:18] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-20 07:44:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:18] [INFO ] [Nat]Absence check using 449 positive place invariants in 61 ms returned sat
[2022-05-20 07:44:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:19] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-20 07:44:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:19] [INFO ] Computed and/alt/rep : 947/1685/947 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-20 07:44:32] [INFO ] Added : 864 causal constraints over 174 iterations in 13341 ms. Result :sat
Minimization took 3005 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 232700 steps, including 726 resets, run finished after 1658 ms. (steps per millisecond=140 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 176400 steps, including 1000 resets, run finished after 1084 ms. (steps per millisecond=162 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 955 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 955/955 places, 950/950 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 955 transition count 949
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 954 transition count 949
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 952 transition count 947
Applied a total of 6 rules in 43 ms. Remains 952 /955 variables (removed 3) and now considering 947/950 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 952/955 places, 947/950 transitions.
// Phase 1: matrix 947 rows 952 cols
[2022-05-20 07:44:38] [INFO ] Computed 449 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6891 ms. (steps per millisecond=145 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4767 ms. (steps per millisecond=209 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4797 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 4752 ms. (steps per millisecond=210 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4763 ms. (steps per millisecond=209 ) properties (out of 4) seen :0
// Phase 1: matrix 947 rows 952 cols
[2022-05-20 07:45:04] [INFO ] Computed 449 place invariants in 7 ms
[2022-05-20 07:45:04] [INFO ] [Real]Absence check using 449 positive place invariants in 59 ms returned sat
[2022-05-20 07:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:04] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:45:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:04] [INFO ] [Nat]Absence check using 449 positive place invariants in 59 ms returned sat
[2022-05-20 07:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:05] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-05-20 07:45:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:45:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-05-20 07:45:05] [INFO ] Computed and/alt/rep : 944/1685/944 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 07:45:20] [INFO ] Added : 870 causal constraints over 176 iterations in 15376 ms. Result :sat
Minimization took 2295 ms.
[2022-05-20 07:45:23] [INFO ] [Real]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-20 07:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:23] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-20 07:45:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:23] [INFO ] [Nat]Absence check using 449 positive place invariants in 60 ms returned sat
[2022-05-20 07:45:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:23] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:45:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:45:23] [INFO ] Computed and/alt/rep : 944/1685/944 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-20 07:45:37] [INFO ] Added : 857 causal constraints over 172 iterations in 13545 ms. Result :sat
Minimization took 1505 ms.
[2022-05-20 07:45:39] [INFO ] [Real]Absence check using 449 positive place invariants in 62 ms returned sat
[2022-05-20 07:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:39] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-20 07:45:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:39] [INFO ] [Nat]Absence check using 449 positive place invariants in 61 ms returned sat
[2022-05-20 07:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:39] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-20 07:45:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:45:39] [INFO ] Computed and/alt/rep : 944/1685/944 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:45:57] [INFO ] Added : 865 causal constraints over 173 iterations in 18123 ms. Result :sat
Minimization took 2838 ms.
[2022-05-20 07:46:00] [INFO ] [Real]Absence check using 449 positive place invariants in 58 ms returned sat
[2022-05-20 07:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:01] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2022-05-20 07:46:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:01] [INFO ] [Nat]Absence check using 449 positive place invariants in 61 ms returned sat
[2022-05-20 07:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:01] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:46:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:46:01] [INFO ] Computed and/alt/rep : 944/1685/944 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-20 07:46:17] [INFO ] Added : 866 causal constraints over 174 iterations in 15791 ms. Result :sat
Minimization took 1849 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 327400 steps, including 1000 resets, run finished after 2057 ms. (steps per millisecond=159 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 199200 steps, including 1001 resets, run finished after 1335 ms. (steps per millisecond=149 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 161500 steps, including 1001 resets, run finished after 1099 ms. (steps per millisecond=146 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 240900 steps, including 1000 resets, run finished after 1480 ms. (steps per millisecond=162 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 952 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 21 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 952/952 places, 947/947 transitions.
Starting structural reductions, iteration 0 : 952/952 places, 947/947 transitions.
Applied a total of 0 rules in 21 ms. Remains 952 /952 variables (removed 0) and now considering 947/947 (removed 0) transitions.
// Phase 1: matrix 947 rows 952 cols
[2022-05-20 07:46:25] [INFO ] Computed 449 place invariants in 7 ms
[2022-05-20 07:46:25] [INFO ] Implicit Places using invariants in 475 ms returned [941]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 478 ms to find 1 implicit places.
[2022-05-20 07:46:25] [INFO ] Redundant transitions in 58 ms returned []
// Phase 1: matrix 947 rows 951 cols
[2022-05-20 07:46:25] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:46:26] [INFO ] Dead Transitions using invariants and state equation in 405 ms returned []
Starting structural reductions, iteration 1 : 951/952 places, 947/947 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 950 transition count 946
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 950 transition count 946
Applied a total of 2 rules in 30 ms. Remains 950 /951 variables (removed 1) and now considering 946/947 (removed 1) transitions.
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:46:26] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-20 07:46:26] [INFO ] Implicit Places using invariants in 433 ms returned []
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:46:26] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-20 07:46:27] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 950/952 places, 946/947 transitions.
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:46:27] [INFO ] Computed 448 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7058 ms. (steps per millisecond=141 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4779 ms. (steps per millisecond=209 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4742 ms. (steps per millisecond=210 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4746 ms. (steps per millisecond=210 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4734 ms. (steps per millisecond=211 ) properties (out of 4) seen :0
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:46:53] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-20 07:46:53] [INFO ] [Real]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-20 07:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:54] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-20 07:46:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:54] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-20 07:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:54] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-20 07:46:54] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-20 07:47:06] [INFO ] Added : 853 causal constraints over 171 iterations in 11954 ms. Result :sat
Minimization took 2630 ms.
[2022-05-20 07:47:09] [INFO ] [Real]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-20 07:47:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:09] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:47:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:09] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-20 07:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:10] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2022-05-20 07:47:10] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:47:22] [INFO ] Added : 858 causal constraints over 172 iterations in 11913 ms. Result :sat
Minimization took 2111 ms.
[2022-05-20 07:47:24] [INFO ] [Real]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-20 07:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:24] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2022-05-20 07:47:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:24] [INFO ] [Nat]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-20 07:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:25] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-20 07:47:25] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:47:39] [INFO ] Added : 848 causal constraints over 171 iterations in 13986 ms. Result :sat
Minimization took 3001 ms.
[2022-05-20 07:47:42] [INFO ] [Real]Absence check using 448 positive place invariants in 58 ms returned sat
[2022-05-20 07:47:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:42] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-05-20 07:47:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:42] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-20 07:47:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:43] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:47:43] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 45 ms.
[2022-05-20 07:47:56] [INFO ] Added : 854 causal constraints over 172 iterations in 13043 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 217400 steps, including 1001 resets, run finished after 1446 ms. (steps per millisecond=150 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 247200 steps, including 1000 resets, run finished after 1474 ms. (steps per millisecond=167 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 17 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 946/946 transitions.
Starting structural reductions, iteration 0 : 950/950 places, 946/946 transitions.
Applied a total of 0 rules in 15 ms. Remains 950 /950 variables (removed 0) and now considering 946/946 (removed 0) transitions.
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:02] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-20 07:48:02] [INFO ] Implicit Places using invariants in 467 ms returned []
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:02] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-20 07:48:03] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
[2022-05-20 07:48:03] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:03] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-20 07:48:04] [INFO ] Dead Transitions using invariants and state equation in 416 ms returned []
Finished structural reductions, in 1 iterations. Remains : 950/950 places, 946/946 transitions.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-03
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:04] [INFO ] Computed 448 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:04] [INFO ] Computed 448 place invariants in 14 ms
[2022-05-20 07:48:04] [INFO ] [Real]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-20 07:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:04] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-20 07:48:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:48:04] [INFO ] [Nat]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-20 07:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:05] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-05-20 07:48:05] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:48:10] [INFO ] Deduced a trap composed of 2 places in 422 ms of which 2 ms to minimize.
[2022-05-20 07:48:10] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 950/950 places, 946/946 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 0 with 1 rules applied. Total rules applied 1 place count 950 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 949 transition count 945
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 949 transition count 943
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 947 transition count 943
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 946 transition count 944
Applied a total of 8 rules in 36 ms. Remains 946 /950 variables (removed 4) and now considering 944/946 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/950 places, 944/946 transitions.
// Phase 1: matrix 944 rows 946 cols
[2022-05-20 07:48:10] [INFO ] Computed 448 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6831 ms. (steps per millisecond=146 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4712 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
// Phase 1: matrix 944 rows 946 cols
[2022-05-20 07:48:21] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-20 07:48:21] [INFO ] [Real]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-20 07:48:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:22] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-20 07:48:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:48:22] [INFO ] [Nat]Absence check using 448 positive place invariants in 62 ms returned sat
[2022-05-20 07:48:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:22] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-05-20 07:48:22] [INFO ] Computed and/alt/rep : 941/1680/941 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:48:38] [INFO ] Added : 857 causal constraints over 172 iterations in 15473 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 946/946 places, 944/944 transitions.
Applied a total of 0 rules in 16 ms. Remains 946 /946 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 944/944 transitions.
Starting structural reductions, iteration 0 : 946/946 places, 944/944 transitions.
Applied a total of 0 rules in 15 ms. Remains 946 /946 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 946 cols
[2022-05-20 07:48:41] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:48:41] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 944 rows 946 cols
[2022-05-20 07:48:41] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:48:42] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2022-05-20 07:48:42] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 944 rows 946 cols
[2022-05-20 07:48:42] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:48:42] [INFO ] Dead Transitions using invariants and state equation in 422 ms returned []
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 944/944 transitions.
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-03 in 38863 ms.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-06
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:42] [INFO ] Computed 448 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:43] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-20 07:48:43] [INFO ] [Real]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-20 07:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:43] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2022-05-20 07:48:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:48:43] [INFO ] [Nat]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-20 07:48:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:43] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-20 07:48:43] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:48:48] [INFO ] Added : 430 causal constraints over 86 iterations in 4561 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 134300 steps, including 732 resets, run finished after 943 ms. (steps per millisecond=142 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-06 in 6522 ms.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-07
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:49] [INFO ] Computed 448 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:48:49] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-20 07:48:49] [INFO ] [Real]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-20 07:48:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:49] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-05-20 07:48:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:48:50] [INFO ] [Nat]Absence check using 448 positive place invariants in 61 ms returned sat
[2022-05-20 07:48:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:48:50] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-20 07:48:50] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 07:48:55] [INFO ] Deduced a trap composed of 2 places in 395 ms of which 10 ms to minimize.
[2022-05-20 07:48: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 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 950/950 places, 946/946 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 0 with 1 rules applied. Total rules applied 1 place count 950 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 949 transition count 945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 949 transition count 944
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 948 transition count 944
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 947 transition count 944
Applied a total of 6 rules in 34 ms. Remains 947 /950 variables (removed 3) and now considering 944/946 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/950 places, 944/946 transitions.
// Phase 1: matrix 944 rows 947 cols
[2022-05-20 07:48:55] [INFO ] Computed 448 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6778 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4726 ms. (steps per millisecond=211 ) properties (out of 1) seen :0
// Phase 1: matrix 944 rows 947 cols
[2022-05-20 07:49:06] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:49:07] [INFO ] [Real]Absence check using 448 positive place invariants in 57 ms returned sat
[2022-05-20 07:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:07] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-20 07:49:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:07] [INFO ] [Nat]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-20 07:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:07] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-05-20 07:49:07] [INFO ] Computed and/alt/rep : 941/1677/941 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:49:23] [INFO ] Added : 868 causal constraints over 174 iterations in 15393 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 947 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 23 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 944/944 transitions.
Starting structural reductions, iteration 0 : 947/947 places, 944/944 transitions.
Applied a total of 0 rules in 16 ms. Remains 947 /947 variables (removed 0) and now considering 944/944 (removed 0) transitions.
// Phase 1: matrix 944 rows 947 cols
[2022-05-20 07:49:26] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:49:26] [INFO ] Implicit Places using invariants in 448 ms returned []
// Phase 1: matrix 944 rows 947 cols
[2022-05-20 07:49:26] [INFO ] Computed 448 place invariants in 1 ms
[2022-05-20 07:49:27] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2022-05-20 07:49:27] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 944 rows 947 cols
[2022-05-20 07:49:27] [INFO ] Computed 448 place invariants in 5 ms
[2022-05-20 07:49:28] [INFO ] Dead Transitions using invariants and state equation in 414 ms returned []
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 944/944 transitions.
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-07 in 38716 ms.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-13
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:49:28] [INFO ] Computed 448 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
// Phase 1: matrix 946 rows 950 cols
[2022-05-20 07:49:28] [INFO ] Computed 448 place invariants in 4 ms
[2022-05-20 07:49:28] [INFO ] [Real]Absence check using 448 positive place invariants in 60 ms returned sat
[2022-05-20 07:49:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:28] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-20 07:49:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:28] [INFO ] [Nat]Absence check using 448 positive place invariants in 64 ms returned sat
[2022-05-20 07:49:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:29] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-20 07:49:29] [INFO ] Computed and/alt/rep : 943/1679/943 causal constraints (skipped 0 transitions) in 43 ms.
[2022-05-20 07:49:34] [INFO ] Deduced a trap composed of 2 places in 377 ms of which 2 ms to minimize.
[2022-05-20 07:49:34] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 950 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 950/950 places, 946/946 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 0 with 1 rules applied. Total rules applied 1 place count 950 transition count 945
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 949 transition count 945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 949 transition count 944
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 948 transition count 944
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 946 transition count 945
Applied a total of 8 rules in 38 ms. Remains 946 /950 variables (removed 4) and now considering 945/946 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/950 places, 945/946 transitions.
// Phase 1: matrix 945 rows 946 cols
[2022-05-20 07:49:34] [INFO ] Computed 448 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6847 ms. (steps per millisecond=146 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4733 ms. (steps per millisecond=211 ) properties (out of 1) seen :0
// Phase 1: matrix 945 rows 946 cols
[2022-05-20 07:49:45] [INFO ] Computed 448 place invariants in 2 ms
[2022-05-20 07:49:45] [INFO ] [Real]Absence check using 448 positive place invariants in 63 ms returned sat
[2022-05-20 07:49:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:46] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2022-05-20 07:49:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:49:46] [INFO ] [Nat]Absence check using 448 positive place invariants in 59 ms returned sat
[2022-05-20 07:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:49:46] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2022-05-20 07:49:46] [INFO ] Computed and/alt/rep : 942/1681/942 causal constraints (skipped 0 transitions) in 40 ms.
[2022-05-20 07:49:58] [INFO ] Added : 859 causal constraints over 172 iterations in 12155 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 24 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Starting structural reductions, iteration 0 : 946/946 places, 945/945 transitions.
Applied a total of 0 rules in 14 ms. Remains 946 /946 variables (removed 0) and now considering 945/945 (removed 0) transitions.
// Phase 1: matrix 945 rows 946 cols
[2022-05-20 07:50:01] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-20 07:50:02] [INFO ] Implicit Places using invariants in 434 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-20 07:50:02] [INFO ] Computed 448 place invariants in 8 ms
[2022-05-20 07:50:03] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1359 ms to find 0 implicit places.
[2022-05-20 07:50:03] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 945 rows 946 cols
[2022-05-20 07:50:03] [INFO ] Computed 448 place invariants in 3 ms
[2022-05-20 07:50:03] [INFO ] Dead Transitions using invariants and state equation in 407 ms returned []
Finished structural reductions, in 1 iterations. Remains : 946/946 places, 945/945 transitions.
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-13 in 35508 ms.
[2022-05-20 07:50:03] [INFO ] Flatten gal took : 127 ms
[2022-05-20 07:50:04] [INFO ] Applying decomposition
[2022-05-20 07:50:04] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3175495677092144613.txt, -o, /tmp/graph3175495677092144613.bin, -w, /tmp/graph3175495677092144613.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3175495677092144613.bin, -l, -1, -v, -w, /tmp/graph3175495677092144613.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-20 07:50:04] [INFO ] Decomposing Gal with order
[2022-05-20 07:50:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:50:04] [INFO ] Removed a total of 1100 redundant transitions.
[2022-05-20 07:50:04] [INFO ] Flatten gal took : 128 ms
[2022-05-20 07:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 452 labels/synchronizations in 22 ms.
[2022-05-20 07:50:04] [INFO ] Time to serialize gal into /tmp/UpperBounds574481814392974129.gal : 16 ms
[2022-05-20 07:50:04] [INFO ] Time to serialize properties into /tmp/UpperBounds8667447641161712133.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds574481814392974129.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8667447641161712133.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds574481814392974129.gal -t CGAL -reachable-file /tmp/UpperBounds8667447641161712133.prop --nowitness
Loading property file /tmp/UpperBounds8667447641161712133.prop.
Detected timeout of ITS tools.
[2022-05-20 08:12:51] [INFO ] Applying decomposition
[2022-05-20 08:12:52] [INFO ] Flatten gal took : 46 ms
[2022-05-20 08:12:52] [INFO ] Decomposing Gal with order
[2022-05-20 08:12:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:12:52] [INFO ] Removed a total of 1171 redundant transitions.
[2022-05-20 08:12:52] [INFO ] Flatten gal took : 69 ms
[2022-05-20 08:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 774 labels/synchronizations in 48 ms.
[2022-05-20 08:12:52] [INFO ] Time to serialize gal into /tmp/UpperBounds2161189343871863068.gal : 12 ms
[2022-05-20 08:12:52] [INFO ] Time to serialize properties into /tmp/UpperBounds13145857559555537693.prop : 10 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2161189343871863068.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13145857559555537693.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2161189343871863068.gal -t CGAL -reachable-file /tmp/UpperBounds13145857559555537693.prop --nowitness
Loading property file /tmp/UpperBounds13145857559555537693.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.75e+140,1105.15,4057320,152,8,5.25146e+06,40,533,1.82828e+07,36,104,0
Total reachable state count : 2.749998568051556215982532983611213785487e+140

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property ShieldIIPt-PT-050B-UpperBounds-03 :0 <= i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u219.p728 <= 1
FORMULA ShieldIIPt-PT-050B-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-UpperBounds-03,0,1105.23,4036012,1,0,5.25146e+06,40,857,1.82828e+07,49,104,805
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property ShieldIIPt-PT-050B-UpperBounds-07 :0 <= i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u285.p980 <= 1
FORMULA ShieldIIPt-PT-050B-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-UpperBounds-07,0,1105.23,4036012,1,0,5.25146e+06,40,999,1.82828e+07,51,104,948
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property ShieldIIPt-PT-050B-UpperBounds-13 :0 <= i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u354.p1265 <= 1
FORMULA ShieldIIPt-PT-050B-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-050B-UpperBounds-13,0,1105.23,4036012,1,0,5.25146e+06,40,1120,1.82828e+07,59,104,1069

BK_STOP 1653035479272

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is ShieldIIPt-PT-050B, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037100124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;