Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r455-smll-167912647400437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is StigmergyCommit-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r455-smll-167912647400437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 10:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 10:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Feb 26 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 627K Mar 5 18:23 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-04b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679248627596

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 17:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:57:11] [INFO ] Load time of PNML (sax parser for PT used): 265 ms
[2023-03-19 17:57:11] [INFO ] Transformed 1534 places.
[2023-03-19 17:57:11] [INFO ] Transformed 2136 transitions.
[2023-03-19 17:57:11] [INFO ] Found NUPN structural information;
[2023-03-19 17:57:11] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 2136 rows 1534 cols
[2023-03-19 17:57:11] [INFO ] Computed 6 place invariants in 78 ms
Incomplete random walk after 10000 steps, including 105 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-19 17:57:11] [INFO ] Invariant cache hit.
[2023-03-19 17:57:12] [INFO ] [Real]Absence check using 6 positive place invariants in 64 ms returned sat
[2023-03-19 17:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:14] [INFO ] [Real]Absence check using state equation in 1660 ms returned sat
[2023-03-19 17:57:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 66 ms returned sat
[2023-03-19 17:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:16] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2023-03-19 17:57:18] [INFO ] Deduced a trap composed of 398 places in 1379 ms of which 6 ms to minimize.
[2023-03-19 17:57:19] [INFO ] Deduced a trap composed of 397 places in 1274 ms of which 2 ms to minimize.
[2023-03-19 17:57:21] [INFO ] Deduced a trap composed of 20 places in 1613 ms of which 3 ms to minimize.
[2023-03-19 17:57:21] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:57:21] [INFO ] [Real]Absence check using 6 positive place invariants in 36 ms returned sat
[2023-03-19 17:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:23] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2023-03-19 17:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 63 ms returned sat
[2023-03-19 17:57:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:24] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2023-03-19 17:57:26] [INFO ] Deduced a trap composed of 399 places in 1532 ms of which 4 ms to minimize.
[2023-03-19 17:57:28] [INFO ] Deduced a trap composed of 583 places in 1405 ms of which 3 ms to minimize.
[2023-03-19 17:57:29] [INFO ] Deduced a trap composed of 20 places in 1756 ms of which 2 ms to minimize.
[2023-03-19 17:57:29] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:57:30] [INFO ] [Real]Absence check using 6 positive place invariants in 48 ms returned sat
[2023-03-19 17:57:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:31] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2023-03-19 17:57:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 61 ms returned sat
[2023-03-19 17:57:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:33] [INFO ] [Nat]Absence check using state equation in 1274 ms returned sat
[2023-03-19 17:57:35] [INFO ] Deduced a trap composed of 397 places in 1851 ms of which 3 ms to minimize.
[2023-03-19 17:57:37] [INFO ] Deduced a trap composed of 398 places in 1891 ms of which 3 ms to minimize.
[2023-03-19 17:57: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:57:38] [INFO ] [Real]Absence check using 6 positive place invariants in 57 ms returned sat
[2023-03-19 17:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:39] [INFO ] [Real]Absence check using state equation in 1223 ms returned sat
[2023-03-19 17:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 38 ms returned sat
[2023-03-19 17:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:41] [INFO ] [Nat]Absence check using state equation in 1144 ms returned sat
[2023-03-19 17:57:42] [INFO ] Deduced a trap composed of 491 places in 1722 ms of which 3 ms to minimize.
[2023-03-19 17:57:45] [INFO ] Deduced a trap composed of 396 places in 1859 ms of which 3 ms to minimize.
[2023-03-19 17:57:45] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:57:45] [INFO ] [Real]Absence check using 6 positive place invariants in 57 ms returned sat
[2023-03-19 17:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:46] [INFO ] [Real]Absence check using state equation in 1338 ms returned sat
[2023-03-19 17:57:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 56 ms returned sat
[2023-03-19 17:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:48] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2023-03-19 17:57:50] [INFO ] Deduced a trap composed of 401 places in 1477 ms of which 2 ms to minimize.
[2023-03-19 17:57:52] [INFO ] Deduced a trap composed of 396 places in 1821 ms of which 2 ms to minimize.
[2023-03-19 17:57:52] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:57:52] [INFO ] [Real]Absence check using 6 positive place invariants in 54 ms returned sat
[2023-03-19 17:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:54] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2023-03-19 17:57:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:57:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 37 ms returned sat
[2023-03-19 17:57:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:57:55] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2023-03-19 17:57:57] [INFO ] Deduced a trap composed of 403 places in 1530 ms of which 3 ms to minimize.
[2023-03-19 17:57:58] [INFO ] Deduced a trap composed of 397 places in 1622 ms of which 2 ms to minimize.
[2023-03-19 17:58:00] [INFO ] Deduced a trap composed of 396 places in 1689 ms of which 2 ms to minimize.
[2023-03-19 17:58:00] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:58:01] [INFO ] [Real]Absence check using 6 positive place invariants in 43 ms returned sat
[2023-03-19 17:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:02] [INFO ] [Real]Absence check using state equation in 1061 ms returned sat
[2023-03-19 17:58:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:58:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 61 ms returned sat
[2023-03-19 17:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:03] [INFO ] [Nat]Absence check using state equation in 1280 ms returned sat
[2023-03-19 17:58:05] [INFO ] Deduced a trap composed of 396 places in 1396 ms of which 2 ms to minimize.
[2023-03-19 17:58:06] [INFO ] Deduced a trap composed of 397 places in 1290 ms of which 2 ms to minimize.
[2023-03-19 17:58:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3012 ms
[2023-03-19 17:58:07] [INFO ] Computed and/alt/rep : 2011/4310/2011 causal constraints (skipped 124 transitions) in 280 ms.
[2023-03-19 17:58:08] [INFO ] Deduced a trap composed of 20 places in 1328 ms of which 2 ms to minimize.
[2023-03-19 17:58:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:58:08] [INFO ] [Real]Absence check using 6 positive place invariants in 33 ms returned sat
[2023-03-19 17:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:09] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2023-03-19 17:58:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:58:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 37 ms returned sat
[2023-03-19 17:58:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:11] [INFO ] [Nat]Absence check using state equation in 929 ms returned sat
[2023-03-19 17:58:12] [INFO ] Deduced a trap composed of 397 places in 1087 ms of which 2 ms to minimize.
[2023-03-19 17:58:13] [INFO ] Deduced a trap composed of 402 places in 1130 ms of which 2 ms to minimize.
[2023-03-19 17:58:14] [INFO ] Deduced a trap composed of 399 places in 1005 ms of which 1 ms to minimize.
[2023-03-19 17:58:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 3706 ms
[2023-03-19 17:58:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2023-03-19 17:58:15] [INFO ] [Real]Absence check using 6 positive place invariants in 34 ms returned sat
[2023-03-19 17:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:16] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2023-03-19 17:58:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:58:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 36 ms returned sat
[2023-03-19 17:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:58:17] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2023-03-19 17:58:19] [INFO ] Deduced a trap composed of 399 places in 1215 ms of which 2 ms to minimize.
[2023-03-19 17:58:20] [INFO ] Deduced a trap composed of 397 places in 1211 ms of which 1 ms to minimize.
[2023-03-19 17:58:21] [INFO ] Deduced a trap composed of 399 places in 1209 ms of which 1 ms to minimize.
[2023-03-19 17:58:21] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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 1534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Graph (trivial) has 1506 edges and 1534 vertex of which 105 / 1534 are part of one of the 15 SCC in 15 ms
Free SCC test removed 90 places
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Graph (complete) has 2161 edges and 1444 vertex of which 1434 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.11 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1140 transitions
Trivial Post-agglo rules discarded 1140 transitions
Performed 1140 trivial Post agglomeration. Transition count delta: 1140
Iterating post reduction 0 with 1144 rules applied. Total rules applied 1146 place count 1434 transition count 872
Reduce places removed 1140 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 1178 rules applied. Total rules applied 2324 place count 294 transition count 834
Reduce places removed 15 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 20 rules applied. Total rules applied 2344 place count 279 transition count 829
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2349 place count 274 transition count 829
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 2349 place count 274 transition count 782
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 2443 place count 227 transition count 782
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 2505 place count 165 transition count 720
Iterating global reduction 4 with 62 rules applied. Total rules applied 2567 place count 165 transition count 720
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2567 place count 165 transition count 719
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2569 place count 164 transition count 719
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 2604 place count 129 transition count 263
Iterating global reduction 4 with 35 rules applied. Total rules applied 2639 place count 129 transition count 263
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 2655 place count 129 transition count 247
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2661 place count 123 transition count 241
Iterating global reduction 5 with 6 rules applied. Total rules applied 2667 place count 123 transition count 241
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2673 place count 117 transition count 235
Iterating global reduction 5 with 6 rules applied. Total rules applied 2679 place count 117 transition count 235
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2684 place count 117 transition count 230
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 2716 place count 101 transition count 214
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2717 place count 101 transition count 213
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2722 place count 96 transition count 208
Iterating global reduction 7 with 5 rules applied. Total rules applied 2727 place count 96 transition count 208
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2732 place count 91 transition count 203
Iterating global reduction 7 with 5 rules applied. Total rules applied 2737 place count 91 transition count 203
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2742 place count 86 transition count 198
Iterating global reduction 7 with 5 rules applied. Total rules applied 2747 place count 86 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 2751 place count 84 transition count 208
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 2782 place count 84 transition count 177
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 64 rules applied. Total rules applied 2846 place count 53 transition count 144
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2851 place count 48 transition count 139
Iterating global reduction 8 with 5 rules applied. Total rules applied 2856 place count 48 transition count 139
Drop transitions removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 8 with 37 rules applied. Total rules applied 2893 place count 48 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2895 place count 47 transition count 101
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2896 place count 47 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2897 place count 46 transition count 100
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2901 place count 46 transition count 100
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2904 place count 46 transition count 97
Applied a total of 2904 rules in 279 ms. Remains 46 /1534 variables (removed 1488) and now considering 97/2136 (removed 2039) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 46/1534 places, 97/2136 transitions.
// Phase 1: matrix 97 rows 46 cols
[2023-03-19 17:58:21] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 4063 resets, run finished after 2094 ms. (steps per millisecond=477 ) properties (out of 9) seen :9
FORMULA StigmergyCommit-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 72905 ms.
ITS solved all properties within timeout

BK_STOP 1679248705088

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is StigmergyCommit-PT-04b, 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 r455-smll-167912647400437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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