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.r479-smll-167912664100062.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 gold2022
Input is StigmergyCommit-PT-08a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r479-smll-167912664100062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 6.7K Feb 26 11:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 11:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 11:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 11:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 11:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 11:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 11:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 11:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:12 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 17M 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-08a-UpperBounds-00
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-01
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-02
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-03
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-04
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-05
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-06
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-07
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-08
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-09
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-10
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-11
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-12
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-13
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-14
FORMULA_NAME StigmergyCommit-PT-08a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679416191056

Running Version 202205111006
[2023-03-21 16:29:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-21 16:29:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 16:29:55] [INFO ] Load time of PNML (sax parser for PT used): 1757 ms
[2023-03-21 16:29:55] [INFO ] Transformed 328 places.
[2023-03-21 16:29:55] [INFO ] Transformed 18744 transitions.
[2023-03-21 16:29:55] [INFO ] Found NUPN structural information;
[2023-03-21 16:29:55] [INFO ] Parsed PT model containing 328 places and 18744 transitions in 2148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Normalized transition count is 1422 out of 1449 initially.
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 16:29:55] [INFO ] Computed 10 place invariants in 68 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 660 ms. (steps per millisecond=15 ) properties (out of 16) seen :5
FORMULA StigmergyCommit-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
[2023-03-21 16:29:56] [INFO ] Flow matrix only has 1422 transitions (discarded 27 similar events)
// Phase 1: matrix 1422 rows 328 cols
[2023-03-21 16:29:56] [INFO ] Computed 10 place invariants in 26 ms
[2023-03-21 16:29:57] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2023-03-21 16:29:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:29:57] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2023-03-21 16:29:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:29:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-21 16:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:29:58] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-21 16:29:59] [INFO ] State equation strengthened by 1147 read => feed constraints.
[2023-03-21 16:29:59] [INFO ] [Nat]Added 1147 Read/Feed constraints in 416 ms returned sat
[2023-03-21 16:30:00] [INFO ] Deduced a trap composed of 19 places in 867 ms of which 8 ms to minimize.
[2023-03-21 16:30:01] [INFO ] Deduced a trap composed of 18 places in 1009 ms of which 2 ms to minimize.
[2023-03-21 16:30:02] [INFO ] Deduced a trap composed of 16 places in 738 ms of which 2 ms to minimize.
[2023-03-21 16:30:03] [INFO ] Deduced a trap composed of 16 places in 649 ms of which 4 ms to minimize.
[2023-03-21 16:30:03] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 3618 ms
[2023-03-21 16:30:03] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 16:30:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:03] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2023-03-21 16:30:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 16:30:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:04] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-21 16:30:04] [INFO ] [Nat]Added 1147 Read/Feed constraints in 334 ms returned sat
[2023-03-21 16:30:05] [INFO ] Deduced a trap composed of 16 places in 950 ms of which 1 ms to minimize.
[2023-03-21 16:30:06] [INFO ] Deduced a trap composed of 18 places in 956 ms of which 1 ms to minimize.
[2023-03-21 16:30:07] [INFO ] Deduced a trap composed of 17 places in 838 ms of which 1 ms to minimize.
[2023-03-21 16:30:08] [INFO ] Deduced a trap composed of 17 places in 827 ms of which 1 ms to minimize.
[2023-03-21 16:30:09] [INFO ] Deduced a trap composed of 18 places in 664 ms of which 1 ms to minimize.
[2023-03-21 16:30:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:09] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 16:30:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:10] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-21 16:30:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 16:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:10] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2023-03-21 16:30:11] [INFO ] [Nat]Added 1147 Read/Feed constraints in 497 ms returned sat
[2023-03-21 16:30:12] [INFO ] Deduced a trap composed of 17 places in 893 ms of which 1 ms to minimize.
[2023-03-21 16:30:12] [INFO ] Deduced a trap composed of 17 places in 769 ms of which 1 ms to minimize.
[2023-03-21 16:30:13] [INFO ] Deduced a trap composed of 17 places in 776 ms of which 1 ms to minimize.
[2023-03-21 16:30:14] [INFO ] Deduced a trap composed of 17 places in 561 ms of which 1 ms to minimize.
[2023-03-21 16:30:14] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 2 ms to minimize.
[2023-03-21 16:30:16] [INFO ] Deduced a trap composed of 2 places in 966 ms of which 1 ms to minimize.
[2023-03-21 16:30:16] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:16] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 16:30:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:16] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-21 16:30:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-21 16:30:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:17] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-21 16:30:17] [INFO ] [Nat]Added 1147 Read/Feed constraints in 367 ms returned sat
[2023-03-21 16:30:18] [INFO ] Deduced a trap composed of 19 places in 924 ms of which 1 ms to minimize.
[2023-03-21 16:30:19] [INFO ] Deduced a trap composed of 17 places in 709 ms of which 1 ms to minimize.
[2023-03-21 16:30:20] [INFO ] Deduced a trap composed of 16 places in 602 ms of which 1 ms to minimize.
[2023-03-21 16:30:20] [INFO ] Deduced a trap composed of 16 places in 438 ms of which 1 ms to minimize.
[2023-03-21 16:30:21] [INFO ] Deduced a trap composed of 19 places in 522 ms of which 1 ms to minimize.
[2023-03-21 16:30:22] [INFO ] Deduced a trap composed of 17 places in 524 ms of which 1 ms to minimize.
[2023-03-21 16:30:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:22] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 16:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:22] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2023-03-21 16:30:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 18 ms returned sat
[2023-03-21 16:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:23] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-21 16:30:23] [INFO ] [Nat]Added 1147 Read/Feed constraints in 446 ms returned sat
[2023-03-21 16:30:24] [INFO ] Deduced a trap composed of 18 places in 535 ms of which 1 ms to minimize.
[2023-03-21 16:30:25] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2023-03-21 16:30:25] [INFO ] Deduced a trap composed of 18 places in 543 ms of which 1 ms to minimize.
[2023-03-21 16:30:26] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 1 ms to minimize.
[2023-03-21 16:30:26] [INFO ] Deduced a trap composed of 18 places in 461 ms of which 1 ms to minimize.
[2023-03-21 16:30:27] [INFO ] Deduced a trap composed of 17 places in 457 ms of which 2 ms to minimize.
[2023-03-21 16:30:27] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 1 ms to minimize.
[2023-03-21 16:30:27] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 3816 ms
[2023-03-21 16:30:27] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-21 16:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:28] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2023-03-21 16:30:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2023-03-21 16:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:29] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2023-03-21 16:30:29] [INFO ] [Nat]Added 1147 Read/Feed constraints in 500 ms returned sat
[2023-03-21 16:30:30] [INFO ] Deduced a trap composed of 16 places in 653 ms of which 2 ms to minimize.
[2023-03-21 16:30:30] [INFO ] Deduced a trap composed of 18 places in 469 ms of which 1 ms to minimize.
[2023-03-21 16:30:31] [INFO ] Deduced a trap composed of 18 places in 601 ms of which 1 ms to minimize.
[2023-03-21 16:30:32] [INFO ] Deduced a trap composed of 17 places in 445 ms of which 1 ms to minimize.
[2023-03-21 16:30:32] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 1 ms to minimize.
[2023-03-21 16:30:32] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 2 ms to minimize.
[2023-03-21 16:30:33] [INFO ] Deduced a trap composed of 17 places in 357 ms of which 2 ms to minimize.
[2023-03-21 16:30:33] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 3860 ms
[2023-03-21 16:30:33] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2023-03-21 16:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:33] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-21 16:30:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 16:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:34] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-21 16:30:34] [INFO ] [Nat]Added 1147 Read/Feed constraints in 321 ms returned sat
[2023-03-21 16:30:35] [INFO ] Deduced a trap composed of 16 places in 588 ms of which 0 ms to minimize.
[2023-03-21 16:30:36] [INFO ] Deduced a trap composed of 16 places in 467 ms of which 0 ms to minimize.
[2023-03-21 16:30:36] [INFO ] Deduced a trap composed of 17 places in 380 ms of which 0 ms to minimize.
[2023-03-21 16:30:36] [INFO ] Deduced a trap composed of 16 places in 382 ms of which 1 ms to minimize.
[2023-03-21 16:30:37] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize.
[2023-03-21 16:30:37] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 0 ms to minimize.
[2023-03-21 16:30:37] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2023-03-21 16:30:38] [INFO ] Deduced a trap composed of 16 places in 231 ms of which 1 ms to minimize.
[2023-03-21 16:30:38] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 0 ms to minimize.
[2023-03-21 16:30:38] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-21 16:30:38] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3909 ms
[2023-03-21 16:30:39] [INFO ] Computed and/alt/rep : 371/470/371 causal constraints (skipped 1050 transitions) in 362 ms.
[2023-03-21 16:30:39] [INFO ] Added : 0 causal constraints over 0 iterations in 366 ms. Result :unknown
[2023-03-21 16:30:39] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-21 16:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:39] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-21 16:30:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 16:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:40] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2023-03-21 16:30:40] [INFO ] [Nat]Added 1147 Read/Feed constraints in 403 ms returned sat
[2023-03-21 16:30:41] [INFO ] Deduced a trap composed of 17 places in 559 ms of which 1 ms to minimize.
[2023-03-21 16:30:41] [INFO ] Deduced a trap composed of 17 places in 580 ms of which 1 ms to minimize.
[2023-03-21 16:30:42] [INFO ] Deduced a trap composed of 17 places in 743 ms of which 1 ms to minimize.
[2023-03-21 16:30:43] [INFO ] Deduced a trap composed of 17 places in 550 ms of which 1 ms to minimize.
[2023-03-21 16:30:43] [INFO ] Deduced a trap composed of 16 places in 423 ms of which 0 ms to minimize.
[2023-03-21 16:30:44] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 2 ms to minimize.
[2023-03-21 16:30:44] [INFO ] Deduced a trap composed of 17 places in 329 ms of which 1 ms to minimize.
[2023-03-21 16:30:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:45] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 16:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:45] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-03-21 16:30:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-21 16:30:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:46] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2023-03-21 16:30:46] [INFO ] [Nat]Added 1147 Read/Feed constraints in 408 ms returned sat
[2023-03-21 16:30:47] [INFO ] Deduced a trap composed of 17 places in 606 ms of which 2 ms to minimize.
[2023-03-21 16:30:48] [INFO ] Deduced a trap composed of 18 places in 855 ms of which 3 ms to minimize.
[2023-03-21 16:30:49] [INFO ] Deduced a trap composed of 19 places in 846 ms of which 1 ms to minimize.
[2023-03-21 16:30:49] [INFO ] Deduced a trap composed of 17 places in 611 ms of which 1 ms to minimize.
[2023-03-21 16:30:50] [INFO ] Deduced a trap composed of 16 places in 704 ms of which 44 ms to minimize.
[2023-03-21 16:30:51] [INFO ] Deduced a trap composed of 16 places in 528 ms of which 1 ms to minimize.
[2023-03-21 16:30:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:51] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 16:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:51] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-21 16:30:52] [INFO ] [Real]Added 1147 Read/Feed constraints in 381 ms returned sat
[2023-03-21 16:30:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-21 16:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:52] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-21 16:30:53] [INFO ] [Nat]Added 1147 Read/Feed constraints in 417 ms returned sat
[2023-03-21 16:30:54] [INFO ] Deduced a trap composed of 16 places in 719 ms of which 1 ms to minimize.
[2023-03-21 16:30:54] [INFO ] Deduced a trap composed of 17 places in 762 ms of which 1 ms to minimize.
[2023-03-21 16:30:55] [INFO ] Deduced a trap composed of 18 places in 646 ms of which 1 ms to minimize.
[2023-03-21 16:30:56] [INFO ] Deduced a trap composed of 16 places in 622 ms of which 1 ms to minimize.
[2023-03-21 16:30:57] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 1 ms to minimize.
[2023-03-21 16:30:57] [INFO ] Deduced a trap composed of 17 places in 406 ms of which 2 ms to minimize.
[2023-03-21 16:30:57] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 16:30:57] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-21 16:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:58] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-21 16:30:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 16:30:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-21 16:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 16:30:58] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-21 16:30:59] [INFO ] [Nat]Added 1147 Read/Feed constraints in 491 ms returned sat
[2023-03-21 16:31:00] [INFO ] Deduced a trap composed of 16 places in 622 ms of which 1 ms to minimize.
[2023-03-21 16:31:00] [INFO ] Deduced a trap composed of 17 places in 543 ms of which 3 ms to minimize.
[2023-03-21 16:31:01] [INFO ] Deduced a trap composed of 16 places in 508 ms of which 0 ms to minimize.
[2023-03-21 16:31:01] [INFO ] Deduced a trap composed of 17 places in 334 ms of which 3 ms to minimize.
[2023-03-21 16:31:02] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 1 ms to minimize.
[2023-03-21 16:31:02] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 0 ms to minimize.
[2023-03-21 16:31:02] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-21 16:31:03] [INFO ] Deduced a trap composed of 16 places in 293 ms of which 0 ms to minimize.
[2023-03-21 16:31:03] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 3810 ms
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA StigmergyCommit-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 328 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 328/328 places, 1449/1449 transitions.
Graph (complete) has 759 edges and 328 vertex of which 319 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.29 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 319 transition count 1361
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 94 rules applied. Total rules applied 174 place count 268 transition count 1318
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 183 place count 259 transition count 1318
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 183 place count 259 transition count 1259
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 301 place count 200 transition count 1259
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 345 place count 156 transition count 1215
Iterating global reduction 3 with 44 rules applied. Total rules applied 389 place count 156 transition count 1215
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 432 place count 113 transition count 1172
Iterating global reduction 3 with 43 rules applied. Total rules applied 475 place count 113 transition count 1172
Ensure Unique test removed 518 transitions
Reduce isomorphic transitions removed 518 transitions.
Iterating post reduction 3 with 518 rules applied. Total rules applied 993 place count 113 transition count 654
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1001 place count 105 transition count 646
Iterating global reduction 4 with 8 rules applied. Total rules applied 1009 place count 105 transition count 646
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1015 place count 99 transition count 640
Iterating global reduction 4 with 6 rules applied. Total rules applied 1021 place count 99 transition count 640
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 1026 place count 99 transition count 635
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 1058 place count 83 transition count 619
Drop transitions removed 7 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 1072 place count 83 transition count 605
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1080 place count 75 transition count 597
Iterating global reduction 6 with 8 rules applied. Total rules applied 1088 place count 75 transition count 597
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1095 place count 68 transition count 590
Iterating global reduction 6 with 7 rules applied. Total rules applied 1102 place count 68 transition count 590
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 1109 place count 61 transition count 583
Iterating global reduction 6 with 7 rules applied. Total rules applied 1116 place count 61 transition count 583
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 1118 place count 61 transition count 581
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1121 place count 61 transition count 578
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1124 place count 58 transition count 578
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1125 place count 58 transition count 577
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1128 place count 58 transition count 577
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1130 place count 58 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1131 place count 57 transition count 574
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 7 with 8 rules applied. Total rules applied 1139 place count 56 transition count 567
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 1146 place count 49 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1146 place count 49 transition count 566
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1148 place count 48 transition count 566
Performed 12 Post agglomeration using F-continuation condition with reduction of 500 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 24 rules applied. Total rules applied 1172 place count 36 transition count 54
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1181 place count 36 transition count 45
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 17 rules applied. Total rules applied 1198 place count 26 transition count 38
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1205 place count 26 transition count 31
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1207 place count 26 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1208 place count 26 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1209 place count 25 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1211 place count 23 transition count 26
Applied a total of 1211 rules in 954 ms. Remains 23 /328 variables (removed 305) and now considering 26/1449 (removed 1423) transitions.
Finished structural reductions, in 1 iterations. Remains : 23/328 places, 26/1449 transitions.
// Phase 1: matrix 26 rows 23 cols
[2023-03-21 16:31:04] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 10) seen :10
FORMULA StigmergyCommit-PT-08a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 72172 ms.

BK_STOP 1679416265549

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-08a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is StigmergyCommit-PT-08a, 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 r479-smll-167912664100062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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