Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r178-oct2-177969020100309.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is MedleyB-PT-B04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.1K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 11:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 3 18:30 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 MedleyB-PT-B04-UpperBounds-00
FORMULA_NAME MedleyB-PT-B04-UpperBounds-01
FORMULA_NAME MedleyB-PT-B04-UpperBounds-02
FORMULA_NAME MedleyB-PT-B04-UpperBounds-03
FORMULA_NAME MedleyB-PT-B04-UpperBounds-04
FORMULA_NAME MedleyB-PT-B04-UpperBounds-05
FORMULA_NAME MedleyB-PT-B04-UpperBounds-06
FORMULA_NAME MedleyB-PT-B04-UpperBounds-07
FORMULA_NAME MedleyB-PT-B04-UpperBounds-08
FORMULA_NAME MedleyB-PT-B04-UpperBounds-09
FORMULA_NAME MedleyB-PT-B04-UpperBounds-10
FORMULA_NAME MedleyB-PT-B04-UpperBounds-11
FORMULA_NAME MedleyB-PT-B04-UpperBounds-12
FORMULA_NAME MedleyB-PT-B04-UpperBounds-13
FORMULA_NAME MedleyB-PT-B04-UpperBounds-14
FORMULA_NAME MedleyB-PT-B04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779705784019

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 10:43:05] [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]
[2026-05-25 10:43:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:43:05] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2026-05-25 10:43:05] [INFO ] Transformed 829 places.
[2026-05-25 10:43:05] [INFO ] Transformed 2410 transitions.
[2026-05-25 10:43:05] [INFO ] Found NUPN structural information;
[2026-05-25 10:43:05] [INFO ] Parsed PT model containing 829 places and 2410 transitions and 20118 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17212019813140881216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4169809828561195994.kers'
[2026-05-25 10:43:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17212019813140881216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4169809828561195994.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2410 rows 829 cols 20118 entries
Finished phase 1 with 822 SingleSign rule and 0 generalized
[2026-05-25 10:43:06] [INFO ] Computed 7 invariants in 25 ms
Computed 7 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-4169809828561195994.kers
Total runtime 29 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 (95 resets) in 69 ms. (142 steps per ms)
FORMULA MedleyB-PT-B04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60003 steps (87 resets) in 62 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-25 10:43:06] [INFO ] Invariant cache hit.
[2026-05-25 10:43:06] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2026-05-25 10:43:07] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2026-05-25 10:43:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2026-05-25 10:43:09] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2026-05-25 10:43:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1086 ms
[2026-05-25 10:43:11] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 209 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2026-05-25 10:43:14] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2026-05-25 10:43:14] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2026-05-25 10:43:15] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 277 ms.
[2026-05-25 10:43:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 20 ms returned sat
[2026-05-25 10:43:17] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2026-05-25 10:43:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1375 ms
[2026-05-25 10:43:19] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 217 ms.
[2026-05-25 10:43:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:43:22] [INFO ] [Real]Absence check using 7 positive place invariants in 47 ms returned sat
[2026-05-25 10:43:23] [INFO ] [Real]Absence check using state equation in 1088 ms returned sat
[2026-05-25 10:43:23] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 185 ms.
[2026-05-25 10:43:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2026-05-25 10:43:25] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2026-05-25 10:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1491 ms
[2026-05-25 10:43:27] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 202 ms.
[2026-05-25 10:43:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:43:30] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2026-05-25 10:43:30] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2026-05-25 10:43:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 21 ms returned sat
[2026-05-25 10:43:32] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2026-05-25 10:43:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 894 ms
[2026-05-25 10:43:33] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 146 ms.
[2026-05-25 10:43:36] [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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:43:37] [INFO ] [Real]Absence check using 7 positive place invariants in 17 ms returned sat
[2026-05-25 10:43:37] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2026-05-25 10:43:38] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 190 ms.
[2026-05-25 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 19 ms returned sat
[2026-05-25 10:43:40] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2026-05-25 10:43:41] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 209 ms.
[2026-05-25 10:43:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:43:44] [INFO ] [Real]Absence check using 7 positive place invariants in 29 ms returned sat
[2026-05-25 10:43:45] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2026-05-25 10:43:45] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 126 ms.
[2026-05-25 10:43:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:43:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 39 ms returned sat
[2026-05-25 10:43:47] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2026-05-25 10:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1551 ms
[2026-05-25 10:43:49] [INFO ] Computed and/alt/rep : 2235/9656/2235 causal constraints (skipped 174 transitions) in 161 ms.
[2026-05-25 10:43:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 829/829 places, 2410/2410 transitions.
Graph (trivial) has 833 edges and 829 vertex of which 109 / 829 are part of one of the 17 SCC in 13 ms
Free SCC test removed 92 places
Drop transitions (Empty/Sink Transition effects.) removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Graph (complete) has 1546 edges and 737 vertex of which 725 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.12 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 530 transitions
Trivial Post-agglo rules discarded 530 transitions
Performed 530 trivial Post agglomeration. Transition count delta: 530
Iterating post reduction 0 with 536 rules applied. Total rules applied 538 place count 725 transition count 1749
Reduce places removed 530 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 560 rules applied. Total rules applied 1098 place count 195 transition count 1719
Reduce places removed 15 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 18 rules applied. Total rules applied 1116 place count 180 transition count 1716
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1119 place count 177 transition count 1716
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 1119 place count 177 transition count 1701
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 1149 place count 162 transition count 1701
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 1197 place count 114 transition count 1653
Iterating global reduction 4 with 48 rules applied. Total rules applied 1245 place count 114 transition count 1653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 1247 place count 114 transition count 1651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1248 place count 113 transition count 1651
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 1248 place count 113 transition count 1647
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1256 place count 109 transition count 1647
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1271 place count 94 transition count 334
Iterating global reduction 6 with 15 rules applied. Total rules applied 1286 place count 94 transition count 334
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1298 place count 94 transition count 322
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 34 rules applied. Total rules applied 1332 place count 77 transition count 305
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1333 place count 77 transition count 304
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1338 place count 72 transition count 299
Iterating global reduction 8 with 5 rules applied. Total rules applied 1343 place count 72 transition count 299
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1351 place count 68 transition count 307
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1352 place count 68 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 1361 place count 68 transition count 297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1363 place count 67 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1371 place count 67 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1373 place count 66 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 1381 place count 66 transition count 293
Free-agglomeration rule applied 32 times.
Iterating global reduction 9 with 32 rules applied. Total rules applied 1413 place count 66 transition count 261
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 41 rules applied. Total rules applied 1454 place count 34 transition count 252
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 1460 place count 28 transition count 246
Iterating global reduction 10 with 6 rules applied. Total rules applied 1466 place count 28 transition count 246
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 10 with 23 rules applied. Total rules applied 1489 place count 28 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 11 with 31 rules applied. Total rules applied 1520 place count 28 transition count 192
Applied a total of 1520 rules in 321 ms. Remains 28 /829 variables (removed 801) and now considering 192/2410 (removed 2218) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 28/829 places, 192/2410 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2795755907502754926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2941384958409931083.kers'
[2026-05-25 10:43:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2795755907502754926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2941384958409931083.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 192 rows 27 cols 1192 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-25 10:43:52] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2941384958409931083.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 6233 ms. (160 steps per ms)
FORMULA MedleyB-PT-B04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 406 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 53684 ms.

BK_STOP 1779705839158

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="MedleyB-PT-B04"
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-5973"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B04, 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 r178-oct2-177969020100309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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