Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903490500013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
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 r226-smll-174903490500013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 231K May 29 14:33 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

echo here is the order used to build the result vector(from xml 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 1749050789027

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-04 15:26:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 15:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 15:26:32] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2025-06-04 15:26:32] [INFO ] Transformed 928 places.
[2025-06-04 15:26:32] [INFO ] Transformed 1040 transitions.
[2025-06-04 15:26:32] [INFO ] Found NUPN structural information;
[2025-06-04 15:26:32] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 688 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1040 rows 928 cols
[2025-06-04 15:26:32] [INFO ] Computed 4 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (156 resets) in 98 ms. (101 steps per ms)
FORMULA StigmergyCommit-PT-02b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (285 resets) in 134 ms. (518 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-06-04 15:26:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:34] [INFO ] [Real]Absence check using 4 positive place invariants in 121 ms returned sat
[2025-06-04 15:26:34] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2025-06-04 15:26:35] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 156 ms.
[2025-06-04 15:26:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 40 ms returned sat
[2025-06-04 15:26:37] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2025-06-04 15:26:37] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 163 ms.
[2025-06-04 15:26:41] [INFO ] Added : 165 causal constraints over 33 iterations in 3707 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:41] [INFO ] [Real]Absence check using 4 positive place invariants in 32 ms returned sat
[2025-06-04 15:26:42] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:44] [INFO ] Deduced a trap composed of 397 places in 1480 ms of which 487 ms to minimize.
[2025-06-04 15:26:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 39 ms returned sat
[2025-06-04 15:26:45] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:47] [INFO ] Deduced a trap composed of 397 places in 1197 ms of which 452 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:47] [INFO ] Deduced a trap composed of 397 places in 562 ms of which 33 ms to minimize.
[2025-06-04 15:26:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1973 ms
[2025-06-04 15:26:47] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 119 ms.
[2025-06-04 15:26:49] [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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:50] [INFO ] [Real]Absence check using 4 positive place invariants in 34 ms returned sat
[2025-06-04 15:26:50] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2025-06-04 15:26:51] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 153 ms.
[2025-06-04 15:26:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 42 ms returned sat
[2025-06-04 15:26:52] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:54] [INFO ] Deduced a trap composed of 397 places in 1405 ms of which 424 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:55] [INFO ] Deduced a trap composed of 397 places in 590 ms of which 33 ms to minimize.
[2025-06-04 15:26:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2201 ms
[2025-06-04 15:26:55] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 129 ms.
[2025-06-04 15:26: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: 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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:57] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2025-06-04 15:26:57] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:26:58] [INFO ] Deduced a trap composed of 397 places in 982 ms of which 294 ms to minimize.
[2025-06-04 15:26:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:26:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 37 ms returned sat
[2025-06-04 15:26:59] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2025-06-04 15:26:59] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 75 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:04] [INFO ] [Real]Absence check using 4 positive place invariants in 31 ms returned sat
[2025-06-04 15:27:04] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2025-06-04 15:27:05] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 102 ms.
[2025-06-04 15:27:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 37 ms returned sat
[2025-06-04 15:27:06] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2025-06-04 15:27:06] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 89 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:10] [INFO ] [Real]Absence check using 4 positive place invariants in 33 ms returned sat
[2025-06-04 15:27:11] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:12] [INFO ] Deduced a trap composed of 397 places in 1088 ms of which 397 ms to minimize.
[2025-06-04 15:27:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 29 ms returned sat
[2025-06-04 15:27:13] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:15] [INFO ] Deduced a trap composed of 397 places in 1254 ms of which 470 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:15] [INFO ] Deduced a trap composed of 397 places in 652 ms of which 35 ms to minimize.
[2025-06-04 15:27:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2112 ms
[2025-06-04 15:27:16] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 107 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:18] [INFO ] [Real]Absence check using 4 positive place invariants in 35 ms returned sat
[2025-06-04 15:27:19] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2025-06-04 15:27:19] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 107 ms.
[2025-06-04 15:27:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-04 15:27:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 24 ms returned sat
[2025-06-04 15:27:21] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 15:27:22] [INFO ] Deduced a trap composed of 397 places in 1214 ms of which 399 ms to minimize.
[2025-06-04 15:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1327 ms
[2025-06-04 15:27:22] [INFO ] Computed and/alt/rep : 998/1454/998 causal constraints (skipped 41 transitions) in 73 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 928 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 909 edges and 928 vertex of which 60 / 928 are part of one of the 9 SCC in 11 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 1177 edges and 877 vertex of which 871 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.10 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 688 transitions
Trivial Post-agglo rules discarded 688 transitions
Performed 688 trivial Post agglomeration. Transition count delta: 688
Iterating post reduction 0 with 691 rules applied. Total rules applied 693 place count 871 transition count 281
Reduce places removed 688 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 708 rules applied. Total rules applied 1401 place count 183 transition count 261
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 1413 place count 175 transition count 257
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1417 place count 171 transition count 257
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1417 place count 171 transition count 227
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1477 place count 141 transition count 227
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 1513 place count 105 transition count 191
Iterating global reduction 4 with 36 rules applied. Total rules applied 1549 place count 105 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1549 place count 105 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1551 place count 104 transition count 190
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1571 place count 84 transition count 133
Iterating global reduction 4 with 20 rules applied. Total rules applied 1591 place count 84 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1600 place count 84 transition count 124
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1604 place count 80 transition count 120
Iterating global reduction 5 with 4 rules applied. Total rules applied 1608 place count 80 transition count 120
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1612 place count 76 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 1616 place count 76 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1620 place count 76 transition count 112
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 1640 place count 66 transition count 102
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1643 place count 63 transition count 99
Iterating global reduction 6 with 3 rules applied. Total rules applied 1646 place count 63 transition count 99
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1649 place count 60 transition count 96
Iterating global reduction 6 with 3 rules applied. Total rules applied 1652 place count 60 transition count 96
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 1655 place count 57 transition count 93
Iterating global reduction 6 with 3 rules applied. Total rules applied 1658 place count 57 transition count 93
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1668 place count 52 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1669 place count 52 transition count 122
Free-agglomeration rule applied 19 times with reduction of 7 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1688 place count 52 transition count 96
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 1721 place count 33 transition count 82
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1724 place count 30 transition count 79
Iterating global reduction 8 with 3 rules applied. Total rules applied 1727 place count 30 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1735 place count 30 transition count 71
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1737 place count 30 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1738 place count 30 transition count 70
Applied a total of 1738 rules in 260 ms. Remains 30 /928 variables (removed 898) and now considering 70/1040 (removed 970) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 30/928 places, 70/1040 transitions.
// Phase 1: matrix 70 rows 30 cols
[2025-06-04 15:27:25] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1718 ms. (581 steps per ms)
FORMULA StigmergyCommit-PT-02b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA StigmergyCommit-PT-02b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 458 ms. (2178 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 15:27:28] [INFO ] Flatten gal took : 66 ms
[2025-06-04 15:27:28] [INFO ] Flatten gal took : 24 ms
[2025-06-04 15:27:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5460370118774814228.gal : 15 ms
[2025-06-04 15:27:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17300263349508323222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5460370118774814228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17300263349508323222.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 56771 ms.

BK_STOP 1749050848498

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
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 r226-smll-174903490500013"
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.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 ;