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-165286037100118.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-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 924K
-rw-r--r-- 1 mcc users 6.0K Apr 29 18:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 29 18:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 29 18:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 29 18:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 686K 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-040B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653032473880

Running Version 0
[2022-05-20 07:41:15] [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:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 07:41:15] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2022-05-20 07:41:15] [INFO ] Transformed 2803 places.
[2022-05-20 07:41:15] [INFO ] Transformed 2603 transitions.
[2022-05-20 07:41:15] [INFO ] Found NUPN structural information;
[2022-05-20 07:41:15] [INFO ] Parsed PT model containing 2803 places and 2603 transitions in 360 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 2603 rows 2803 cols
[2022-05-20 07:41:15] [INFO ] Computed 361 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :9
FORMULA ShieldIIPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 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 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 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 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
// Phase 1: matrix 2603 rows 2803 cols
[2022-05-20 07:41:16] [INFO ] Computed 361 place invariants in 29 ms
[2022-05-20 07:41:16] [INFO ] [Real]Absence check using 361 positive place invariants in 176 ms returned sat
[2022-05-20 07:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:18] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2022-05-20 07:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:18] [INFO ] [Nat]Absence check using 361 positive place invariants in 164 ms returned sat
[2022-05-20 07:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:19] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2022-05-20 07:41:20] [INFO ] Deduced a trap composed of 17 places in 832 ms of which 17 ms to minimize.
[2022-05-20 07:41:21] [INFO ] Deduced a trap composed of 19 places in 763 ms of which 5 ms to minimize.
[2022-05-20 07:41:22] [INFO ] Deduced a trap composed of 18 places in 854 ms of which 18 ms to minimize.
[2022-05-20 07:41:23] [INFO ] Deduced a trap composed of 28 places in 750 ms of which 3 ms to minimize.
[2022-05-20 07:41:23] [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:24] [INFO ] [Real]Absence check using 361 positive place invariants in 167 ms returned sat
[2022-05-20 07:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:25] [INFO ] [Real]Absence check using state equation in 1194 ms returned sat
[2022-05-20 07:41:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 154 ms returned sat
[2022-05-20 07:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:27] [INFO ] [Nat]Absence check using state equation in 1209 ms returned sat
[2022-05-20 07:41:27] [INFO ] Deduced a trap composed of 32 places in 763 ms of which 2 ms to minimize.
[2022-05-20 07:41:28] [INFO ] Deduced a trap composed of 27 places in 796 ms of which 2 ms to minimize.
[2022-05-20 07:41:29] [INFO ] Deduced a trap composed of 27 places in 761 ms of which 2 ms to minimize.
[2022-05-20 07:41:30] [INFO ] Deduced a trap composed of 28 places in 764 ms of which 1 ms to minimize.
[2022-05-20 07:41:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:31] [INFO ] [Real]Absence check using 361 positive place invariants in 148 ms returned sat
[2022-05-20 07:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:32] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2022-05-20 07:41:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:32] [INFO ] [Nat]Absence check using 361 positive place invariants in 151 ms returned sat
[2022-05-20 07:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:34] [INFO ] [Nat]Absence check using state equation in 1197 ms returned sat
[2022-05-20 07:41:34] [INFO ] Deduced a trap composed of 22 places in 836 ms of which 2 ms to minimize.
[2022-05-20 07:41:35] [INFO ] Deduced a trap composed of 21 places in 841 ms of which 2 ms to minimize.
[2022-05-20 07:41:36] [INFO ] Deduced a trap composed of 36 places in 875 ms of which 2 ms to minimize.
[2022-05-20 07:41:37] [INFO ] Deduced a trap composed of 31 places in 759 ms of which 1 ms to minimize.
[2022-05-20 07:41:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:38] [INFO ] [Real]Absence check using 361 positive place invariants in 146 ms returned sat
[2022-05-20 07:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:39] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2022-05-20 07:41:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:39] [INFO ] [Nat]Absence check using 361 positive place invariants in 160 ms returned sat
[2022-05-20 07:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:41] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2022-05-20 07:41:42] [INFO ] Deduced a trap composed of 29 places in 735 ms of which 2 ms to minimize.
[2022-05-20 07:41:42] [INFO ] Deduced a trap composed of 17 places in 739 ms of which 2 ms to minimize.
[2022-05-20 07:41:43] [INFO ] Deduced a trap composed of 34 places in 779 ms of which 1 ms to minimize.
[2022-05-20 07:41:44] [INFO ] Deduced a trap composed of 27 places in 742 ms of which 2 ms to minimize.
[2022-05-20 07:41:44] [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:41:45] [INFO ] [Real]Absence check using 361 positive place invariants in 157 ms returned sat
[2022-05-20 07:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:46] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2022-05-20 07:41:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 195 ms returned sat
[2022-05-20 07:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:48] [INFO ] [Nat]Absence check using state equation in 1162 ms returned sat
[2022-05-20 07:41:48] [INFO ] Deduced a trap composed of 30 places in 805 ms of which 2 ms to minimize.
[2022-05-20 07:41:49] [INFO ] Deduced a trap composed of 25 places in 742 ms of which 2 ms to minimize.
[2022-05-20 07:41:50] [INFO ] Deduced a trap composed of 29 places in 756 ms of which 1 ms to minimize.
[2022-05-20 07:41:51] [INFO ] Deduced a trap composed of 32 places in 734 ms of which 2 ms to minimize.
[2022-05-20 07:41:51] [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: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:51] [INFO ] [Real]Absence check using 361 positive place invariants in 161 ms returned sat
[2022-05-20 07:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:53] [INFO ] [Real]Absence check using state equation in 1206 ms returned sat
[2022-05-20 07:41:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:41:53] [INFO ] [Nat]Absence check using 361 positive place invariants in 146 ms returned sat
[2022-05-20 07:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:41:55] [INFO ] [Nat]Absence check using state equation in 1272 ms returned sat
[2022-05-20 07:41:55] [INFO ] Deduced a trap composed of 24 places in 723 ms of which 2 ms to minimize.
[2022-05-20 07:41:56] [INFO ] Deduced a trap composed of 32 places in 678 ms of which 2 ms to minimize.
[2022-05-20 07:41:57] [INFO ] Deduced a trap composed of 44 places in 650 ms of which 2 ms to minimize.
[2022-05-20 07:41:58] [INFO ] Deduced a trap composed of 25 places in 649 ms of which 1 ms to minimize.
[2022-05-20 07:41:58] [INFO ] Deduced a trap composed of 21 places in 652 ms of which 2 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 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:41:59] [INFO ] [Real]Absence check using 361 positive place invariants in 153 ms returned sat
[2022-05-20 07:41:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:00] [INFO ] [Real]Absence check using state equation in 1203 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 361 positive place invariants in 159 ms returned sat
[2022-05-20 07:42:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:03] [INFO ] [Nat]Absence check using state equation in 2302 ms returned sat
[2022-05-20 07:42:04] [INFO ] Deduced a trap composed of 16 places in 607 ms of which 1 ms to minimize.
[2022-05-20 07:42:04] [INFO ] Deduced a trap composed of 31 places in 579 ms of which 1 ms to minimize.
[2022-05-20 07:42:05] [INFO ] Deduced a trap composed of 37 places in 559 ms of which 2 ms to minimize.
[2022-05-20 07:42:06] [INFO ] Deduced a trap composed of 44 places in 572 ms of which 1 ms to minimize.
[2022-05-20 07:42:06] [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 2803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 680 transitions
Trivial Post-agglo rules discarded 680 transitions
Performed 680 trivial Post agglomeration. Transition count delta: 680
Iterating post reduction 0 with 680 rules applied. Total rules applied 680 place count 2803 transition count 1923
Reduce places removed 680 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 682 rules applied. Total rules applied 1362 place count 2123 transition count 1921
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1363 place count 2122 transition count 1921
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 1363 place count 2122 transition count 1762
Deduced a syphon composed of 159 places in 6 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 3 with 318 rules applied. Total rules applied 1681 place count 1963 transition count 1762
Discarding 278 places :
Symmetric choice reduction at 3 with 278 rule applications. Total rules 1959 place count 1685 transition count 1484
Iterating global reduction 3 with 278 rules applied. Total rules applied 2237 place count 1685 transition count 1484
Performed 118 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 118 Pre rules applied. Total rules applied 2237 place count 1685 transition count 1366
Deduced a syphon composed of 118 places in 8 ms
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 236 rules applied. Total rules applied 2473 place count 1567 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 2 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 3833 place count 887 transition count 686
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4035 place count 786 transition count 751
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 4065 place count 771 transition count 762
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4066 place count 771 transition count 761
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4067 place count 771 transition count 760
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4068 place count 770 transition count 760
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 4108 place count 770 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4109 place count 769 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 4111 place count 767 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 4111 place count 767 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4113 place count 766 transition count 758
Applied a total of 4113 rules in 1007 ms. Remains 766 /2803 variables (removed 2037) and now considering 758/2603 (removed 1845) transitions.
Finished structural reductions, in 1 iterations. Remains : 766/2803 places, 758/2603 transitions.
// Phase 1: matrix 758 rows 766 cols
[2022-05-20 07:42:07] [INFO ] Computed 359 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6010 ms. (steps per millisecond=166 ) properties (out of 7) seen :1
FORMULA ShieldIIPt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3930 ms. (steps per millisecond=254 ) properties (out of 6) seen :1
FORMULA ShieldIIPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3924 ms. (steps per millisecond=254 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3912 ms. (steps per millisecond=255 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3959 ms. (steps per millisecond=252 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3899 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
// Phase 1: matrix 758 rows 766 cols
[2022-05-20 07:42:32] [INFO ] Computed 359 place invariants in 11 ms
[2022-05-20 07:42:33] [INFO ] [Real]Absence check using 359 positive place invariants in 54 ms returned sat
[2022-05-20 07:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:33] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-20 07:42:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:33] [INFO ] [Nat]Absence check using 359 positive place invariants in 51 ms returned sat
[2022-05-20 07:42:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:33] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-05-20 07:42:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:42:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2022-05-20 07:42:33] [INFO ] Computed and/alt/rep : 755/1344/755 causal constraints (skipped 0 transitions) in 69 ms.
[2022-05-20 07:42:42] [INFO ] Added : 680 causal constraints over 137 iterations in 8984 ms. Result :sat
Minimization took 3012 ms.
[2022-05-20 07:42:45] [INFO ] [Real]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-20 07:42:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:46] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-05-20 07:42:46] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:42:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:46] [INFO ] [Nat]Absence check using 359 positive place invariants in 45 ms returned sat
[2022-05-20 07:42:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:46] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2022-05-20 07:42:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:42:46] [INFO ] Computed and/alt/rep : 755/1344/755 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:42:56] [INFO ] Added : 674 causal constraints over 136 iterations in 9669 ms. Result :sat
Minimization took 1593 ms.
[2022-05-20 07:42:58] [INFO ] [Real]Absence check using 359 positive place invariants in 80 ms returned sat
[2022-05-20 07:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:58] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2022-05-20 07:42:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:42:58] [INFO ] [Nat]Absence check using 359 positive place invariants in 43 ms returned sat
[2022-05-20 07:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:42:58] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 07:42:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:42:58] [INFO ] Computed and/alt/rep : 755/1344/755 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-20 07:43:08] [INFO ] Added : 685 causal constraints over 138 iterations in 9696 ms. Result :sat
Minimization took 2270 ms.
[2022-05-20 07:43:10] [INFO ] [Real]Absence check using 359 positive place invariants in 47 ms returned sat
[2022-05-20 07:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:10] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-20 07:43:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:43:11] [INFO ] [Nat]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-20 07:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:11] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
[2022-05-20 07:43:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:43:11] [INFO ] Computed and/alt/rep : 755/1344/755 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-20 07:43:20] [INFO ] Added : 682 causal constraints over 137 iterations in 8763 ms. Result :sat
Minimization took 1060 ms.
[2022-05-20 07:43:21] [INFO ] [Real]Absence check using 359 positive place invariants in 51 ms returned sat
[2022-05-20 07:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:21] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-20 07:43:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:43:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-20 07:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:43:21] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-20 07:43:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:43:22] [INFO ] Computed and/alt/rep : 755/1344/755 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:43:30] [INFO ] Added : 682 causal constraints over 137 iterations in 8308 ms. Result :sat
Minimization took 2974 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 115500 steps, including 1001 resets, run finished after 660 ms. (steps per millisecond=175 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 114500 steps, including 1000 resets, run finished after 661 ms. (steps per millisecond=173 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 104100 steps, including 1001 resets, run finished after 673 ms. (steps per millisecond=154 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 107000 steps, including 1000 resets, run finished after 587 ms. (steps per millisecond=182 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 766 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 766/766 places, 758/758 transitions.
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 4 place count 764 transition count 756
Applied a total of 4 rules in 65 ms. Remains 764 /766 variables (removed 2) and now considering 756/758 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 764/766 places, 756/758 transitions.
// Phase 1: matrix 756 rows 764 cols
[2022-05-20 07:43:35] [INFO ] Computed 359 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6144 ms. (steps per millisecond=162 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3897 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4229 ms. (steps per millisecond=236 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4183 ms. (steps per millisecond=239 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3921 ms. (steps per millisecond=255 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3903 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
// Phase 1: matrix 756 rows 764 cols
[2022-05-20 07:44:02] [INFO ] Computed 359 place invariants in 15 ms
[2022-05-20 07:44:02] [INFO ] [Real]Absence check using 359 positive place invariants in 43 ms returned sat
[2022-05-20 07:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:02] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2022-05-20 07:44:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:02] [INFO ] [Nat]Absence check using 359 positive place invariants in 45 ms returned sat
[2022-05-20 07:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:02] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2022-05-20 07:44:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:44:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:44:03] [INFO ] Computed and/alt/rep : 753/1340/753 causal constraints (skipped 0 transitions) in 47 ms.
[2022-05-20 07:44:11] [INFO ] Added : 668 causal constraints over 134 iterations in 8698 ms. Result :sat
Minimization took 2898 ms.
[2022-05-20 07:44:14] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-20 07:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:14] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-20 07:44:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:15] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-20 07:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:15] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-20 07:44:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:15] [INFO ] Computed and/alt/rep : 753/1340/753 causal constraints (skipped 0 transitions) in 35 ms.
[2022-05-20 07:44:24] [INFO ] Added : 697 causal constraints over 140 iterations in 8962 ms. Result :sat
Minimization took 3005 ms.
[2022-05-20 07:44:27] [INFO ] [Real]Absence check using 359 positive place invariants in 45 ms returned sat
[2022-05-20 07:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:27] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2022-05-20 07:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:27] [INFO ] [Nat]Absence check using 359 positive place invariants in 51 ms returned sat
[2022-05-20 07:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:28] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-20 07:44:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:44:28] [INFO ] Computed and/alt/rep : 753/1340/753 causal constraints (skipped 0 transitions) in 38 ms.
[2022-05-20 07:44:36] [INFO ] Added : 672 causal constraints over 135 iterations in 8636 ms. Result :sat
Minimization took 367 ms.
[2022-05-20 07:44:37] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-20 07:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:37] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-20 07:44:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:37] [INFO ] [Nat]Absence check using 359 positive place invariants in 51 ms returned sat
[2022-05-20 07:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:37] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-20 07:44:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:44:38] [INFO ] Computed and/alt/rep : 753/1340/753 causal constraints (skipped 0 transitions) in 36 ms.
[2022-05-20 07:44:47] [INFO ] Added : 695 causal constraints over 140 iterations in 9257 ms. Result :sat
Minimization took 1818 ms.
[2022-05-20 07:44:49] [INFO ] [Real]Absence check using 359 positive place invariants in 48 ms returned sat
[2022-05-20 07:44:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:49] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-05-20 07:44:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:44:49] [INFO ] [Nat]Absence check using 359 positive place invariants in 50 ms returned sat
[2022-05-20 07:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:44:49] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2022-05-20 07:44:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:44:49] [INFO ] Computed and/alt/rep : 753/1340/753 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:44:58] [INFO ] Added : 676 causal constraints over 136 iterations in 8524 ms. Result :sat
Minimization took 1515 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 124000 steps, including 1000 resets, run finished after 643 ms. (steps per millisecond=192 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 153700 steps, including 1000 resets, run finished after 776 ms. (steps per millisecond=198 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 191200 steps, including 1000 resets, run finished after 1164 ms. (steps per millisecond=164 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldIIPt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 195300 steps, including 1000 resets, run finished after 961 ms. (steps per millisecond=203 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 764 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 764/764 places, 756/756 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 764 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 763 transition count 755
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 763 transition count 754
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 762 transition count 754
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 6 place count 761 transition count 755
Applied a total of 6 rules in 39 ms. Remains 761 /764 variables (removed 3) and now considering 755/756 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/764 places, 755/756 transitions.
// Phase 1: matrix 755 rows 761 cols
[2022-05-20 07:45:03] [INFO ] Computed 359 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5889 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3893 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3928 ms. (steps per millisecond=254 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3985 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
// Phase 1: matrix 755 rows 761 cols
[2022-05-20 07:45:21] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-20 07:45:21] [INFO ] [Real]Absence check using 359 positive place invariants in 49 ms returned sat
[2022-05-20 07:45:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:21] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-20 07:45:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:21] [INFO ] [Nat]Absence check using 359 positive place invariants in 44 ms returned sat
[2022-05-20 07:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:21] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 07:45:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-20 07:45:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:45:22] [INFO ] Computed and/alt/rep : 752/1342/752 causal constraints (skipped 0 transitions) in 41 ms.
[2022-05-20 07:45:30] [INFO ] Added : 686 causal constraints over 138 iterations in 8254 ms. Result :sat
Minimization took 1618 ms.
[2022-05-20 07:45:32] [INFO ] [Real]Absence check using 359 positive place invariants in 54 ms returned sat
[2022-05-20 07:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:32] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-20 07:45:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:32] [INFO ] [Nat]Absence check using 359 positive place invariants in 46 ms returned sat
[2022-05-20 07:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:32] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 07:45:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2022-05-20 07:45:32] [INFO ] Computed and/alt/rep : 752/1342/752 causal constraints (skipped 0 transitions) in 32 ms.
[2022-05-20 07:45:43] [INFO ] Added : 686 causal constraints over 138 iterations in 10911 ms. Result :sat
Minimization took 2850 ms.
[2022-05-20 07:45:46] [INFO ] [Real]Absence check using 359 positive place invariants in 42 ms returned sat
[2022-05-20 07:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:46] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-20 07:45:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:45:46] [INFO ] [Nat]Absence check using 359 positive place invariants in 45 ms returned sat
[2022-05-20 07:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:45:47] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2022-05-20 07:45:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-20 07:45:47] [INFO ] Computed and/alt/rep : 752/1342/752 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-20 07:45:55] [INFO ] Added : 688 causal constraints over 138 iterations in 8705 ms. Result :sat
Minimization took 3000 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 163000 steps, including 1000 resets, run finished after 785 ms. (steps per millisecond=207 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 121300 steps, including 1001 resets, run finished after 689 ms. (steps per millisecond=176 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 761 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 761/761 places, 755/755 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 761/761 places, 755/755 transitions.
Starting structural reductions, iteration 0 : 761/761 places, 755/755 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 761 cols
[2022-05-20 07:46:00] [INFO ] Computed 359 place invariants in 2 ms
[2022-05-20 07:46:00] [INFO ] Implicit Places using invariants in 512 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 531 ms to find 1 implicit places.
[2022-05-20 07:46:00] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 755 rows 760 cols
[2022-05-20 07:46:00] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:46:01] [INFO ] Dead Transitions using invariants and state equation in 373 ms returned []
Starting structural reductions, iteration 1 : 760/761 places, 755/755 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 754
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 754
Applied a total of 2 rules in 47 ms. Remains 759 /760 variables (removed 1) and now considering 754/755 (removed 1) transitions.
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:01] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:46:01] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:01] [INFO ] Computed 358 place invariants in 14 ms
[2022-05-20 07:46:02] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 759/761 places, 754/755 transitions.
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:02] [INFO ] Computed 358 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5826 ms. (steps per millisecond=171 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3895 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3851 ms. (steps per millisecond=259 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3859 ms. (steps per millisecond=259 ) properties (out of 3) seen :0
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:19] [INFO ] Computed 358 place invariants in 5 ms
[2022-05-20 07:46:20] [INFO ] [Real]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-20 07:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:20] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2022-05-20 07:46:20] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-20 07:46:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:20] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:20] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-20 07:46:20] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 39 ms.
[2022-05-20 07:46:29] [INFO ] Added : 684 causal constraints over 137 iterations in 8349 ms. Result :sat
Minimization took 1549 ms.
[2022-05-20 07:46:30] [INFO ] [Real]Absence check using 358 positive place invariants in 47 ms returned sat
[2022-05-20 07:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:31] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-20 07:46:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:31] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:31] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-05-20 07:46:31] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-20 07:46:43] [INFO ] Added : 694 causal constraints over 140 iterations in 11521 ms. Result :sat
Minimization took 1646 ms.
[2022-05-20 07:46:44] [INFO ] [Real]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:45] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-20 07:46:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:46:45] [INFO ] [Nat]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-20 07:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:46:45] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 07:46:45] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-20 07:46:53] [INFO ] Added : 674 causal constraints over 136 iterations in 7928 ms. Result :sat
Minimization took 2220 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 222700 steps, including 1000 resets, run finished after 1097 ms. (steps per millisecond=203 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 129700 steps, including 1000 resets, run finished after 649 ms. (steps per millisecond=199 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 162400 steps, including 1001 resets, run finished after 931 ms. (steps per millisecond=174 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 759 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 754/754 transitions.
Starting structural reductions, iteration 0 : 759/759 places, 754/754 transitions.
Applied a total of 0 rules in 13 ms. Remains 759 /759 variables (removed 0) and now considering 754/754 (removed 0) transitions.
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:58] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:46:58] [INFO ] Implicit Places using invariants in 501 ms returned []
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:58] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:46:59] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2022-05-20 07:46:59] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:46:59] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:47:00] [INFO ] Dead Transitions using invariants and state equation in 549 ms returned []
Finished structural reductions, in 1 iterations. Remains : 759/759 places, 754/754 transitions.
Starting property specific reduction for ShieldIIPt-PT-040B-UpperBounds-05
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:00] [INFO ] Computed 358 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:00] [INFO ] Computed 358 place invariants in 10 ms
[2022-05-20 07:47:00] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-20 07:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:00] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2022-05-20 07:47:00] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 34 ms.
[2022-05-20 07:47:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:00] [INFO ] [Nat]Absence check using 358 positive place invariants in 44 ms returned sat
[2022-05-20 07:47:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:01] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2022-05-20 07:47:01] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 73 ms.
[2022-05-20 07:47:06] [INFO ] Deduced a trap composed of 2 places in 389 ms of which 1 ms to minimize.
[2022-05-20 07:47:06] [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 759 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 759/759 places, 754/754 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 759 transition count 753
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 758 transition count 753
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 0 with 2 rules applied. Total rules applied 4 place count 757 transition count 752
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 0 with 2 rules applied. Total rules applied 6 place count 756 transition count 753
Applied a total of 6 rules in 35 ms. Remains 756 /759 variables (removed 3) and now considering 753/754 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/759 places, 753/754 transitions.
// Phase 1: matrix 753 rows 756 cols
[2022-05-20 07:47:06] [INFO ] Computed 358 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6393 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3975 ms. (steps per millisecond=251 ) properties (out of 1) seen :0
// Phase 1: matrix 753 rows 756 cols
[2022-05-20 07:47:16] [INFO ] Computed 358 place invariants in 17 ms
[2022-05-20 07:47:16] [INFO ] [Real]Absence check using 358 positive place invariants in 45 ms returned sat
[2022-05-20 07:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:17] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2022-05-20 07:47:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:17] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:47:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:17] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-20 07:47:17] [INFO ] Computed and/alt/rep : 750/1338/750 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-20 07:47:25] [INFO ] Added : 677 causal constraints over 137 iterations in 7832 ms. Result :sat
Minimization took 1733 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 196800 steps, including 1000 resets, run finished after 950 ms. (steps per millisecond=207 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 756 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 756/756 places, 753/753 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 753/753 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 753/753 transitions.
Starting structural reductions, iteration 0 : 756/756 places, 753/753 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 753/753 (removed 0) transitions.
// Phase 1: matrix 753 rows 756 cols
[2022-05-20 07:47:28] [INFO ] Computed 358 place invariants in 1 ms
[2022-05-20 07:47:28] [INFO ] Implicit Places using invariants in 554 ms returned []
// Phase 1: matrix 753 rows 756 cols
[2022-05-20 07:47:28] [INFO ] Computed 358 place invariants in 11 ms
[2022-05-20 07:47:29] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2022-05-20 07:47:29] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 753 rows 756 cols
[2022-05-20 07:47:29] [INFO ] Computed 358 place invariants in 21 ms
[2022-05-20 07:47:29] [INFO ] Dead Transitions using invariants and state equation in 428 ms returned []
Finished structural reductions, in 1 iterations. Remains : 756/756 places, 753/753 transitions.
Ending property specific reduction for ShieldIIPt-PT-040B-UpperBounds-05 in 29623 ms.
Starting property specific reduction for ShieldIIPt-PT-040B-UpperBounds-14
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:29] [INFO ] Computed 358 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:29] [INFO ] Computed 358 place invariants in 3 ms
[2022-05-20 07:47:30] [INFO ] [Real]Absence check using 358 positive place invariants in 63 ms returned sat
[2022-05-20 07:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:30] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2022-05-20 07:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:30] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-20 07:47:30] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 59 ms.
[2022-05-20 07:47:35] [INFO ] Added : 465 causal constraints over 93 iterations in 4666 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 118000 steps, including 840 resets, run finished after 752 ms. (steps per millisecond=156 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for ShieldIIPt-PT-040B-UpperBounds-14 in 6279 ms.
Starting property specific reduction for ShieldIIPt-PT-040B-UpperBounds-15
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:36] [INFO ] Computed 358 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
// Phase 1: matrix 754 rows 759 cols
[2022-05-20 07:47:36] [INFO ] Computed 358 place invariants in 2 ms
[2022-05-20 07:47:36] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2022-05-20 07:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:36] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-20 07:47:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 07:47:36] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2022-05-20 07:47:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 07:47:36] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2022-05-20 07:47:36] [INFO ] Computed and/alt/rep : 751/1336/751 causal constraints (skipped 0 transitions) in 33 ms.
[2022-05-20 07:47:41] [INFO ] Added : 480 causal constraints over 96 iterations in 4661 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 120700 steps, including 262 resets, run finished after 804 ms. (steps per millisecond=150 ) properties (out of 1) seen :1 could not realise parikh vector
FORMULA ShieldIIPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for ShieldIIPt-PT-040B-UpperBounds-15 in 6314 ms.
[2022-05-20 07:47:42] [INFO ] Flatten gal took : 252 ms
[2022-05-20 07:47:43] [INFO ] Applying decomposition
[2022-05-20 07:47:43] [INFO ] Flatten gal took : 113 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/graph362389035614010650.txt, -o, /tmp/graph362389035614010650.bin, -w, /tmp/graph362389035614010650.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/graph362389035614010650.bin, -l, -1, -v, -w, /tmp/graph362389035614010650.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-20 07:47:43] [INFO ] Decomposing Gal with order
[2022-05-20 07:47:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 07:47:43] [INFO ] Removed a total of 870 redundant transitions.
[2022-05-20 07:47:43] [INFO ] Flatten gal took : 162 ms
[2022-05-20 07:47:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 342 labels/synchronizations in 24 ms.
[2022-05-20 07:47:44] [INFO ] Time to serialize gal into /tmp/UpperBounds9515252503983400252.gal : 21 ms
[2022-05-20 07:47:44] [INFO ] Time to serialize properties into /tmp/UpperBounds3352950030444157572.prop : 1 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/UpperBounds9515252503983400252.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3352950030444157572.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/UpperBounds9515252503983400252.gal -t CGAL -reachable-file /tmp/UpperBounds3352950030444157572.prop --nowitness
Loading property file /tmp/UpperBounds3352950030444157572.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,1.59016e+112,1187.01,6479516,149,18,8.64529e+06,452,648,3.10184e+07,64,5022,0
Total reachable state count : 1.590162358300545896705296193490911321507e+112

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property ShieldIIPt-PT-040B-UpperBounds-05 :0 <= i1.u15.p151 <= 1
FORMULA ShieldIIPt-PT-040B-UpperBounds-05 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-040B-UpperBounds-05,0,1187.15,6437208,1,0,8.64529e+06,452,1082,3.10184e+07,78,5022,1367

BK_STOP 1653034052976

--------------------
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-040B"
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-040B, 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-165286037100118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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