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.r457-smll-167912649300421.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 ltsminxred
Input is StigmergyCommit-PT-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300421
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:52 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 359K 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-03b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679436169557

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:02:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:02:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:02:52] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2023-03-21 22:02:52] [INFO ] Transformed 1231 places.
[2023-03-21 22:02:52] [INFO ] Transformed 1476 transitions.
[2023-03-21 22:02:52] [INFO ] Found NUPN structural information;
[2023-03-21 22:02:52] [INFO ] Parsed PT model containing 1231 places and 1476 transitions and 4168 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 1476 rows 1231 cols
[2023-03-21 22:02:52] [INFO ] Computed 5 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 130 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :7
FORMULA StigmergyCommit-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 27 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 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 25 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 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-21 22:02:52] [INFO ] Invariant cache hit.
[2023-03-21 22:02:53] [INFO ] [Real]Absence check using 5 positive place invariants in 47 ms returned sat
[2023-03-21 22:02:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:02:54] [INFO ] [Real]Absence check using state equation in 796 ms returned sat
[2023-03-21 22:02:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:02:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 37 ms returned sat
[2023-03-21 22:02:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:02:55] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2023-03-21 22:02:56] [INFO ] Deduced a trap composed of 397 places in 847 ms of which 10 ms to minimize.
[2023-03-21 22:02:57] [INFO ] Deduced a trap composed of 397 places in 918 ms of which 2 ms to minimize.
[2023-03-21 22:02:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2068 ms
[2023-03-21 22:02:57] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 136 ms.
[2023-03-21 22:03:00] [INFO ] Deduced a trap composed of 20 places in 801 ms of which 2 ms to minimize.
[2023-03-21 22:03: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 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.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-21 22:03:00] [INFO ] [Real]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:01] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2023-03-21 22:03:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:02] [INFO ] [Nat]Absence check using state equation in 750 ms returned sat
[2023-03-21 22:03:03] [INFO ] Deduced a trap composed of 398 places in 868 ms of which 2 ms to minimize.
[2023-03-21 22:03:04] [INFO ] Deduced a trap composed of 396 places in 829 ms of which 2 ms to minimize.
[2023-03-21 22:03:05] [INFO ] Deduced a trap composed of 398 places in 616 ms of which 4 ms to minimize.
[2023-03-21 22:03:06] [INFO ] Deduced a trap composed of 398 places in 802 ms of which 2 ms to minimize.
[2023-03-21 22:03:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3517 ms
[2023-03-21 22:03:06] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 123 ms.
[2023-03-21 22:03:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1186)
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-21 22:03:06] [INFO ] [Real]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:07] [INFO ] [Real]Absence check using state equation in 732 ms returned sat
[2023-03-21 22:03:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:08] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2023-03-21 22:03:09] [INFO ] Deduced a trap composed of 397 places in 947 ms of which 3 ms to minimize.
[2023-03-21 22:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1117 ms
[2023-03-21 22:03:09] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 105 ms.
[2023-03-21 22:03:13] [INFO ] Deduced a trap composed of 20 places in 894 ms of which 2 ms to minimize.
[2023-03-21 22:03:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-21 22:03:13] [INFO ] [Real]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:14] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2023-03-21 22:03:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:15] [INFO ] [Nat]Absence check using state equation in 770 ms returned sat
[2023-03-21 22:03:16] [INFO ] Deduced a trap composed of 398 places in 875 ms of which 1 ms to minimize.
[2023-03-21 22:03:17] [INFO ] Deduced a trap composed of 396 places in 692 ms of which 1 ms to minimize.
[2023-03-21 22:03:18] [INFO ] Deduced a trap composed of 489 places in 666 ms of which 1 ms to minimize.
[2023-03-21 22:03:18] [INFO ] Deduced a trap composed of 398 places in 520 ms of which 1 ms to minimize.
[2023-03-21 22:03:19] [INFO ] Deduced a trap composed of 396 places in 634 ms of which 1 ms to minimize.
[2023-03-21 22:03:20] [INFO ] Deduced a trap composed of 398 places in 493 ms of which 1 ms to minimize.
[2023-03-21 22:03:20] [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-21 22:03:20] [INFO ] [Real]Absence check using 5 positive place invariants in 34 ms returned sat
[2023-03-21 22:03:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:21] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-21 22:03:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:22] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2023-03-21 22:03:23] [INFO ] Deduced a trap composed of 400 places in 815 ms of which 1 ms to minimize.
[2023-03-21 22:03:23] [INFO ] Deduced a trap composed of 396 places in 808 ms of which 1 ms to minimize.
[2023-03-21 22:03:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1858 ms
[2023-03-21 22:03:24] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 125 ms.
[2023-03-21 22:03:27] [INFO ] Deduced a trap composed of 20 places in 876 ms of which 2 ms to minimize.
[2023-03-21 22:03:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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-21 22:03:27] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-21 22:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:28] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-21 22:03:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 32 ms returned sat
[2023-03-21 22:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:29] [INFO ] [Nat]Absence check using state equation in 733 ms returned sat
[2023-03-21 22:03:29] [INFO ] Deduced a trap composed of 397 places in 775 ms of which 1 ms to minimize.
[2023-03-21 22:03:30] [INFO ] Deduced a trap composed of 418 places in 628 ms of which 2 ms to minimize.
[2023-03-21 22:03:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1636 ms
[2023-03-21 22:03:30] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 100 ms.
[2023-03-21 22:03:33] [INFO ] Deduced a trap composed of 20 places in 875 ms of which 2 ms to minimize.
[2023-03-21 22:03:33] [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.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-21 22:03:34] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-21 22:03:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:34] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2023-03-21 22:03:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 35 ms returned sat
[2023-03-21 22:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:36] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-21 22:03:36] [INFO ] Deduced a trap composed of 399 places in 755 ms of which 2 ms to minimize.
[2023-03-21 22:03:37] [INFO ] Deduced a trap composed of 397 places in 641 ms of which 1 ms to minimize.
[2023-03-21 22:03:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1617 ms
[2023-03-21 22:03:37] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 109 ms.
[2023-03-21 22:03:40] [INFO ] Deduced a trap composed of 20 places in 889 ms of which 2 ms to minimize.
[2023-03-21 22:03:40] [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-21 22:03:41] [INFO ] [Real]Absence check using 5 positive place invariants in 29 ms returned sat
[2023-03-21 22:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:41] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2023-03-21 22:03:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:42] [INFO ] [Nat]Absence check using state equation in 736 ms returned sat
[2023-03-21 22:03:43] [INFO ] Deduced a trap composed of 297 places in 854 ms of which 1 ms to minimize.
[2023-03-21 22:03:44] [INFO ] Deduced a trap composed of 398 places in 787 ms of which 2 ms to minimize.
[2023-03-21 22:03:45] [INFO ] Deduced a trap composed of 396 places in 630 ms of which 1 ms to minimize.
[2023-03-21 22:03:46] [INFO ] Deduced a trap composed of 207 places in 729 ms of which 2 ms to minimize.
[2023-03-21 22:03:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3380 ms
[2023-03-21 22:03:46] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 105 ms.
[2023-03-21 22:03:46] [INFO ] Added : 30 causal constraints over 6 iterations in 584 ms. Result :unknown
[2023-03-21 22:03:47] [INFO ] [Real]Absence check using 5 positive place invariants in 30 ms returned sat
[2023-03-21 22:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:48] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2023-03-21 22:03:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:03:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 31 ms returned sat
[2023-03-21 22:03:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:03:49] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2023-03-21 22:03:49] [INFO ] Deduced a trap composed of 398 places in 807 ms of which 2 ms to minimize.
[2023-03-21 22:03:50] [INFO ] Deduced a trap composed of 401 places in 871 ms of which 3 ms to minimize.
[2023-03-21 22:03:51] [INFO ] Deduced a trap composed of 398 places in 807 ms of which 1 ms to minimize.
[2023-03-21 22:03:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2808 ms
[2023-03-21 22:03:51] [INFO ] Computed and/alt/rep : 1399/2268/1399 causal constraints (skipped 76 transitions) in 95 ms.
[2023-03-21 22:03:53] [INFO ] Deduced a trap composed of 20 places in 779 ms of which 2 ms to minimize.
[2023-03-21 22:03:53] [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.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)
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]
FORMULA StigmergyCommit-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 1231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1231/1231 places, 1476/1476 transitions.
Graph (trivial) has 1207 edges and 1231 vertex of which 84 / 1231 are part of one of the 12 SCC in 10 ms
Free SCC test removed 72 places
Drop transitions removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Graph (complete) has 1645 edges and 1159 vertex of which 1151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 909 transitions
Trivial Post-agglo rules discarded 909 transitions
Performed 909 trivial Post agglomeration. Transition count delta: 909
Iterating post reduction 0 with 913 rules applied. Total rules applied 915 place count 1151 transition count 467
Reduce places removed 909 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 936 rules applied. Total rules applied 1851 place count 242 transition count 440
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 1869 place count 231 transition count 433
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1877 place count 224 transition count 432
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1877 place count 224 transition count 390
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1961 place count 182 transition count 390
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2009 place count 134 transition count 342
Iterating global reduction 4 with 48 rules applied. Total rules applied 2057 place count 134 transition count 342
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2057 place count 134 transition count 341
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 2059 place count 133 transition count 341
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2085 place count 107 transition count 186
Iterating global reduction 4 with 26 rules applied. Total rules applied 2111 place count 107 transition count 186
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2123 place count 107 transition count 174
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2130 place count 100 transition count 167
Iterating global reduction 5 with 7 rules applied. Total rules applied 2137 place count 100 transition count 167
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2144 place count 93 transition count 160
Iterating global reduction 5 with 7 rules applied. Total rules applied 2151 place count 93 transition count 160
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 2158 place count 93 transition count 153
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 2182 place count 81 transition count 141
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2183 place count 81 transition count 140
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2187 place count 77 transition count 136
Iterating global reduction 7 with 4 rules applied. Total rules applied 2191 place count 77 transition count 136
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2195 place count 73 transition count 132
Iterating global reduction 7 with 4 rules applied. Total rules applied 2199 place count 73 transition count 132
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2203 place count 69 transition count 128
Iterating global reduction 7 with 4 rules applied. Total rules applied 2207 place count 69 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2215 place count 65 transition count 149
Free-agglomeration rule applied 27 times with reduction of 6 identical transitions.
Iterating global reduction 7 with 27 rules applied. Total rules applied 2242 place count 65 transition count 116
Reduce places removed 27 places and 0 transitions.
Drop transitions removed 3 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 38 rules applied. Total rules applied 2280 place count 38 transition count 105
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2284 place count 34 transition count 101
Iterating global reduction 8 with 4 rules applied. Total rules applied 2288 place count 34 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2289 place count 34 transition count 100
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 2315 place count 34 transition count 74
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2320 place count 34 transition count 74
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2322 place count 34 transition count 72
Applied a total of 2322 rules in 196 ms. Remains 34 /1231 variables (removed 1197) and now considering 72/1476 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 34/1231 places, 72/1476 transitions.
// Phase 1: matrix 72 rows 34 cols
[2023-03-21 22:03:54] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 7) seen :7
FORMULA StigmergyCommit-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 63715 ms.
ITS solved all properties within timeout

BK_STOP 1679436236744

--------------------
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-03b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is StigmergyCommit-PT-03b, 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 r457-smll-167912649300421"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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