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.r294-smll-165463872600205.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872600205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 6.5K May 30 15:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 30 15:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 30 15:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 25 13:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 25 13:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 8.1K May 30 15:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 30 15:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 30 15:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 30 15:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 51M May 29 12:20 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 StigmergyCommit-PT-09a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-09a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654807612115

Running Version 202205111006
[2022-06-09 20:46:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 20:46:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 20:46:58] [INFO ] Load time of PNML (sax parser for PT used): 3528 ms
[2022-06-09 20:46:58] [INFO ] Transformed 364 places.
[2022-06-09 20:46:58] [INFO ] Transformed 50444 transitions.
[2022-06-09 20:46:58] [INFO ] Found NUPN structural information;
[2022-06-09 20:46:58] [INFO ] Parsed PT model containing 364 places and 50444 transitions in 4288 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Normalized transition count is 2490 out of 2520 initially.
// Phase 1: matrix 2490 rows 364 cols
[2022-06-09 20:46:59] [INFO ] Computed 11 place invariants in 61 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2000 ms. (steps per millisecond=5 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
[2022-06-09 20:47:01] [INFO ] Flow matrix only has 2490 transitions (discarded 30 similar events)
// Phase 1: matrix 2490 rows 364 cols
[2022-06-09 20:47:01] [INFO ] Computed 11 place invariants in 29 ms
[2022-06-09 20:47:02] [INFO ] [Real]Absence check using 11 positive place invariants in 23 ms returned sat
[2022-06-09 20:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:03] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2022-06-09 20:47:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 21 ms returned sat
[2022-06-09 20:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:04] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2022-06-09 20:47:05] [INFO ] State equation strengthened by 2185 read => feed constraints.
[2022-06-09 20:47:06] [INFO ] [Nat]Added 2185 Read/Feed constraints in 906 ms returned sat
[2022-06-09 20:47:08] [INFO ] Deduced a trap composed of 17 places in 1841 ms of which 17 ms to minimize.
[2022-06-09 20:47:09] [INFO ] Deduced a trap composed of 17 places in 1497 ms of which 3 ms to minimize.
[2022-06-09 20:47:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:10] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 20:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:10] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2022-06-09 20:47:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-09 20:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:12] [INFO ] [Nat]Absence check using state equation in 962 ms returned sat
[2022-06-09 20:47:13] [INFO ] [Nat]Added 2185 Read/Feed constraints in 827 ms returned sat
[2022-06-09 20:47:14] [INFO ] Deduced a trap composed of 17 places in 1512 ms of which 2 ms to minimize.
[2022-06-09 20:47:15] [INFO ] Deduced a trap composed of 17 places in 1281 ms of which 2 ms to minimize.
[2022-06-09 20:47:17] [INFO ] Deduced a trap composed of 17 places in 1346 ms of which 2 ms to minimize.
[2022-06-09 20:47:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:17] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 20:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:18] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2022-06-09 20:47:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 20:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:19] [INFO ] [Nat]Absence check using state equation in 1033 ms returned sat
[2022-06-09 20:47:20] [INFO ] [Nat]Added 2185 Read/Feed constraints in 738 ms returned sat
[2022-06-09 20:47:22] [INFO ] Deduced a trap composed of 20 places in 1539 ms of which 2 ms to minimize.
[2022-06-09 20:47:23] [INFO ] Deduced a trap composed of 18 places in 1305 ms of which 2 ms to minimize.
[2022-06-09 20:47:23] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 3108 ms
[2022-06-09 20:47:23] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 20:47:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:24] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2022-06-09 20:47:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-09 20:47:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:25] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2022-06-09 20:47:26] [INFO ] [Nat]Added 2185 Read/Feed constraints in 866 ms returned sat
[2022-06-09 20:47:28] [INFO ] Deduced a trap composed of 18 places in 1790 ms of which 2 ms to minimize.
[2022-06-09 20:47:30] [INFO ] Deduced a trap composed of 17 places in 1824 ms of which 2 ms to minimize.
[2022-06-09 20:47: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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:30] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 20:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:31] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2022-06-09 20:47:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:31] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2022-06-09 20:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:32] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2022-06-09 20:47:33] [INFO ] [Nat]Added 2185 Read/Feed constraints in 850 ms returned sat
[2022-06-09 20:47:35] [INFO ] Deduced a trap composed of 19 places in 1538 ms of which 1 ms to minimize.
[2022-06-09 20:47:37] [INFO ] Deduced a trap composed of 17 places in 1559 ms of which 1 ms to minimize.
[2022-06-09 20:47: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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:37] [INFO ] [Real]Absence check using 11 positive place invariants in 22 ms returned sat
[2022-06-09 20:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:38] [INFO ] [Real]Absence check using state equation in 1027 ms returned sat
[2022-06-09 20:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2022-06-09 20:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:39] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2022-06-09 20:47:40] [INFO ] [Nat]Added 2185 Read/Feed constraints in 782 ms returned sat
[2022-06-09 20:47:41] [INFO ] Deduced a trap composed of 17 places in 1425 ms of which 1 ms to minimize.
[2022-06-09 20:47:43] [INFO ] Deduced a trap composed of 17 places in 1390 ms of which 1 ms to minimize.
[2022-06-09 20:47:44] [INFO ] Deduced a trap composed of 19 places in 1338 ms of which 2 ms to minimize.
[2022-06-09 20:47: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:44] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 20:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:45] [INFO ] [Real]Absence check using state equation in 991 ms returned sat
[2022-06-09 20:47:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 20:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:47] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2022-06-09 20:47:47] [INFO ] [Nat]Added 2185 Read/Feed constraints in 796 ms returned sat
[2022-06-09 20:47:49] [INFO ] Deduced a trap composed of 17 places in 1744 ms of which 3 ms to minimize.
[2022-06-09 20:47:51] [INFO ] Deduced a trap composed of 19 places in 1823 ms of which 1 ms to minimize.
[2022-06-09 20:47: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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:51] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-09 20:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:52] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2022-06-09 20:47:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 20:47:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:53] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2022-06-09 20:47:54] [INFO ] [Nat]Added 2185 Read/Feed constraints in 898 ms returned sat
[2022-06-09 20:47:56] [INFO ] Deduced a trap composed of 17 places in 1794 ms of which 1 ms to minimize.
[2022-06-09 20:47:58] [INFO ] Deduced a trap composed of 19 places in 1513 ms of which 1 ms to minimize.
[2022-06-09 20:47: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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 20:47:58] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-09 20:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 20:47:59] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2022-06-09 20:47:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 20:47:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 11 ms returned sat
[2022-06-09 20:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 20:48:00] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2022-06-09 20:48:01] [INFO ] [Nat]Added 2185 Read/Feed constraints in 685 ms returned sat
[2022-06-09 20:48:02] [INFO ] Deduced a trap composed of 19 places in 1470 ms of which 2 ms to minimize.
[2022-06-09 20:48:04] [INFO ] Deduced a trap composed of 19 places in 1357 ms of which 1 ms to minimize.
[2022-06-09 20:48:05] [INFO ] Deduced a trap composed of 17 places in 1041 ms of which 0 ms to minimize.
[2022-06-09 20:48: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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 364 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 364/364 places, 2520/2520 transitions.
Graph (complete) has 873 edges and 364 vertex of which 354 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.37 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 354 transition count 2423
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 102 rules applied. Total rules applied 190 place count 298 transition count 2377
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 201 place count 288 transition count 2376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 287 transition count 2376
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 202 place count 287 transition count 2309
Deduced a syphon composed of 67 places in 3 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 336 place count 220 transition count 2309
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 386 place count 170 transition count 2259
Iterating global reduction 4 with 50 rules applied. Total rules applied 436 place count 170 transition count 2259
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 486 place count 120 transition count 2209
Iterating global reduction 4 with 50 rules applied. Total rules applied 536 place count 120 transition count 2209
Ensure Unique test removed 1033 transitions
Reduce isomorphic transitions removed 1033 transitions.
Iterating post reduction 4 with 1033 rules applied. Total rules applied 1569 place count 120 transition count 1176
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1576 place count 113 transition count 1169
Iterating global reduction 5 with 7 rules applied. Total rules applied 1583 place count 113 transition count 1169
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1590 place count 106 transition count 1162
Iterating global reduction 5 with 7 rules applied. Total rules applied 1597 place count 106 transition count 1162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1603 place count 106 transition count 1156
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 1635 place count 90 transition count 1140
Drop transitions removed 6 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1647 place count 90 transition count 1128
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1656 place count 81 transition count 1119
Iterating global reduction 7 with 9 rules applied. Total rules applied 1665 place count 81 transition count 1119
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1674 place count 72 transition count 1110
Iterating global reduction 7 with 9 rules applied. Total rules applied 1683 place count 72 transition count 1110
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1692 place count 63 transition count 1101
Iterating global reduction 7 with 9 rules applied. Total rules applied 1701 place count 63 transition count 1101
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 1709 place count 63 transition count 1093
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 1712 place count 63 transition count 1090
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1715 place count 60 transition count 1090
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1723 place count 60 transition count 1090
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1727 place count 60 transition count 1086
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1728 place count 59 transition count 1085
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 8 with 8 rules applied. Total rules applied 1736 place count 58 transition count 1078
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 1743 place count 51 transition count 1078
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1743 place count 51 transition count 1077
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1745 place count 50 transition count 1077
Performed 14 Post agglomeration using F-continuation condition with reduction of 1010 identical transitions.
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 10 with 28 rules applied. Total rules applied 1773 place count 36 transition count 53
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1782 place count 36 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 11 with 17 rules applied. Total rules applied 1799 place count 25 transition count 38
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 1805 place count 25 transition count 32
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 1809 place count 25 transition count 28
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1811 place count 25 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 1813 place count 23 transition count 26
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 1817 place count 19 transition count 22
Applied a total of 1817 rules in 2205 ms. Remains 19 /364 variables (removed 345) and now considering 22/2520 (removed 2498) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/364 places, 22/2520 transitions.
// Phase 1: matrix 22 rows 19 cols
[2022-06-09 20:48:07] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 9) seen :9
FORMULA StigmergyCommit-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 74022 ms.

BK_STOP 1654807688684

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-09a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-09a, 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 r294-smll-165463872600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-09a.tgz
mv StigmergyCommit-PT-09a 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 ;