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-167912649300405.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-02b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r457-smll-167912649300405
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 10:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 17:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:59 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 231K 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-02b-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-02b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679435566803

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-02b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:52:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 21:52:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:52:49] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-21 21:52:49] [INFO ] Transformed 928 places.
[2023-03-21 21:52:49] [INFO ] Transformed 1040 transitions.
[2023-03-21 21:52:49] [INFO ] Found NUPN structural information;
[2023-03-21 21:52:49] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 293 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA StigmergyCommit-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1040 rows 928 cols
[2023-03-21 21:52:49] [INFO ] Computed 4 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 165 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 15) seen :9
FORMULA StigmergyCommit-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
[2023-03-21 21:52:50] [INFO ] Invariant cache hit.
[2023-03-21 21:52:50] [INFO ] [Real]Absence check using 4 positive place invariants in 27 ms returned sat
[2023-03-21 21:52:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:52:51] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2023-03-21 21:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:52:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2023-03-21 21:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:52:52] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-21 21:52:52] [INFO ] Deduced a trap composed of 397 places in 510 ms of which 7 ms to minimize.
[2023-03-21 21:52:53] [INFO ] Deduced a trap composed of 397 places in 367 ms of which 2 ms to minimize.
[2023-03-21 21:52:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1086 ms
[2023-03-21 21:52:53] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 109 ms.
[2023-03-21 21:52:56] [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: Broken pipe ... 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: Broken pipe ...
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 21:52:56] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-21 21:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:52:57] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-21 21:52:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:52:57] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-21 21:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:52:57] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-21 21:52:58] [INFO ] Deduced a trap composed of 397 places in 557 ms of which 2 ms to minimize.
[2023-03-21 21:52:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 646 ms
[2023-03-21 21:52:58] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 82 ms.
[2023-03-21 21:53:02] [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 21:53:02] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-21 21:53:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:03] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2023-03-21 21:53:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-21 21:53:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:03] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-21 21:53:04] [INFO ] Deduced a trap composed of 396 places in 645 ms of which 6 ms to minimize.
[2023-03-21 21:53:04] [INFO ] Deduced a trap composed of 396 places in 396 ms of which 1 ms to minimize.
[2023-03-21 21:53:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1186 ms
[2023-03-21 21:53:05] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 81 ms.
[2023-03-21 21:53:08] [INFO ] Deduced a trap composed of 20 places in 615 ms of which 1 ms to minimize.
[2023-03-21 21:53: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 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 21:53:08] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-21 21:53:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:09] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2023-03-21 21:53:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-21 21:53:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:10] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-21 21:53:10] [INFO ] Deduced a trap composed of 397 places in 568 ms of which 1 ms to minimize.
[2023-03-21 21:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 674 ms
[2023-03-21 21:53:10] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 84 ms.
[2023-03-21 21:53:15] [INFO ] Deduced a trap composed of 20 places in 538 ms of which 2 ms to minimize.
[2023-03-21 21:53:15] [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.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 21:53:15] [INFO ] [Real]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-21 21:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:15] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2023-03-21 21:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 23 ms returned sat
[2023-03-21 21:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:16] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-21 21:53:17] [INFO ] Deduced a trap composed of 398 places in 531 ms of which 1 ms to minimize.
[2023-03-21 21:53:17] [INFO ] Deduced a trap composed of 396 places in 539 ms of which 2 ms to minimize.
[2023-03-21 21:53:18] [INFO ] Deduced a trap composed of 397 places in 480 ms of which 1 ms to minimize.
[2023-03-21 21:53:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1775 ms
[2023-03-21 21:53:18] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 79 ms.
[2023-03-21 21:53:21] [INFO ] Deduced a trap composed of 20 places in 600 ms of which 1 ms to minimize.
[2023-03-21 21:53: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 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 21:53:21] [INFO ] [Real]Absence check using 4 positive place invariants in 21 ms returned sat
[2023-03-21 21:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:22] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-21 21:53:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:53:22] [INFO ] [Nat]Absence check using 4 positive place invariants in 22 ms returned sat
[2023-03-21 21:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:53:23] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2023-03-21 21:53:23] [INFO ] Deduced a trap composed of 397 places in 547 ms of which 1 ms to minimize.
[2023-03-21 21:53:24] [INFO ] Deduced a trap composed of 397 places in 409 ms of which 1 ms to minimize.
[2023-03-21 21:53:24] [INFO ] Deduced a trap composed of 396 places in 418 ms of which 2 ms to minimize.
[2023-03-21 21:53:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1600 ms
[2023-03-21 21:53:24] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 91 ms.
[2023-03-21 21:53:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 911 edges and 928 vertex of which 63 / 928 are part of one of the 9 SCC in 9 ms
Free SCC test removed 54 places
Drop transitions removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Graph (complete) has 1173 edges and 874 vertex of which 868 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 691 transitions
Trivial Post-agglo rules discarded 691 transitions
Performed 691 trivial Post agglomeration. Transition count delta: 691
Iterating post reduction 0 with 694 rules applied. Total rules applied 696 place count 868 transition count 274
Reduce places removed 691 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 713 rules applied. Total rules applied 1409 place count 177 transition count 252
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 1421 place count 169 transition count 248
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1425 place count 165 transition count 248
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 1425 place count 165 transition count 219
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 1483 place count 136 transition count 219
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1518 place count 101 transition count 184
Iterating global reduction 4 with 35 rules applied. Total rules applied 1553 place count 101 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1553 place count 101 transition count 183
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 1555 place count 100 transition count 183
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1573 place count 82 transition count 136
Iterating global reduction 4 with 18 rules applied. Total rules applied 1591 place count 82 transition count 136
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1599 place count 82 transition count 128
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1604 place count 77 transition count 123
Iterating global reduction 5 with 5 rules applied. Total rules applied 1609 place count 77 transition count 123
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1612 place count 74 transition count 120
Iterating global reduction 5 with 3 rules applied. Total rules applied 1615 place count 74 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1618 place count 74 transition count 117
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1636 place count 65 transition count 108
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1637 place count 65 transition count 107
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1640 place count 62 transition count 104
Iterating global reduction 7 with 3 rules applied. Total rules applied 1643 place count 62 transition count 104
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1646 place count 59 transition count 101
Iterating global reduction 7 with 3 rules applied. Total rules applied 1649 place count 59 transition count 101
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1652 place count 56 transition count 98
Iterating global reduction 7 with 3 rules applied. Total rules applied 1655 place count 56 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1663 place count 52 transition count 126
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1664 place count 52 transition count 125
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1683 place count 52 transition count 99
Reduce places removed 19 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1714 place count 33 transition count 87
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1717 place count 30 transition count 84
Iterating global reduction 8 with 3 rules applied. Total rules applied 1720 place count 30 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 1723 place count 30 transition count 81
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 1735 place count 30 transition count 69
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1737 place count 30 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1738 place count 30 transition count 68
Applied a total of 1738 rules in 157 ms. Remains 30 /928 variables (removed 898) and now considering 68/1040 (removed 972) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 30/928 places, 68/1040 transitions.
// Phase 1: matrix 68 rows 30 cols
[2023-03-21 21:53:27] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1513 ms. (steps per millisecond=660 ) properties (out of 6) seen :5
FORMULA StigmergyCommit-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=2512 ) properties (out of 1) seen :1
FORMULA StigmergyCommit-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 40113 ms.
ITS solved all properties within timeout

BK_STOP 1679435610494

--------------------
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-02b"
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-02b, 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-167912649300405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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