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-177969020000237.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 MedleyA-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020000237
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 8.9K Mar 7 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Mar 7 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 7 18:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 7 18:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 11:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 7 18:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 18:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 7 18:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 158K 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 MedleyA-PT-18-UpperBounds-00
FORMULA_NAME MedleyA-PT-18-UpperBounds-01
FORMULA_NAME MedleyA-PT-18-UpperBounds-02
FORMULA_NAME MedleyA-PT-18-UpperBounds-03
FORMULA_NAME MedleyA-PT-18-UpperBounds-04
FORMULA_NAME MedleyA-PT-18-UpperBounds-05
FORMULA_NAME MedleyA-PT-18-UpperBounds-06
FORMULA_NAME MedleyA-PT-18-UpperBounds-07
FORMULA_NAME MedleyA-PT-18-UpperBounds-08
FORMULA_NAME MedleyA-PT-18-UpperBounds-09
FORMULA_NAME MedleyA-PT-18-UpperBounds-10
FORMULA_NAME MedleyA-PT-18-UpperBounds-11
FORMULA_NAME MedleyA-PT-18-UpperBounds-12
FORMULA_NAME MedleyA-PT-18-UpperBounds-13
FORMULA_NAME MedleyA-PT-18-UpperBounds-14
FORMULA_NAME MedleyA-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779701243069

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 09:27:25] [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 09:27:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 09:27:25] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-25 09:27:25] [INFO ] Transformed 252 places.
[2026-05-25 09:27:25] [INFO ] Transformed 543 transitions.
[2026-05-25 09:27:25] [INFO ] Found NUPN structural information;
[2026-05-25 09:27:25] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
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-879689843402393549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12150769221015075069.kers'
[2026-05-25 09:27:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-879689843402393549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12150769221015075069.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 541 rows 252 cols 2432 entries
Finished phase 1 with 244 SingleSign rule and 1 generalized
[2026-05-25 09:27:25] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12150769221015075069.kers
Total runtime 3 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 (384 resets) in 56 ms. (175 steps per ms)
FORMULA MedleyA-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120009 steps (1065 resets) in 103 ms. (1153 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2026-05-25 09:27:25] [INFO ] Invariant cache hit.
[2026-05-25 09:27:25] [INFO ] [Real]Absence check using 7 positive place invariants in 18 ms returned sat
[2026-05-25 09:27:26] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2026-05-25 09:27:26] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 27 ms returned sat
[2026-05-25 09:27:27] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2026-05-25 09:27:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1623 ms
[2026-05-25 09:27:28] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 41 ms.
[2026-05-25 09:27:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
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 09:27:31] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:27:32] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-25 09:27:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 15 ms returned sat
[2026-05-25 09:27:32] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2026-05-25 09:27:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1127 ms
[2026-05-25 09:27:33] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 42 ms.
[2026-05-25 09:27:36] [INFO ] Added : 237 causal constraints over 48 iterations in 2290 ms. Result :sat
Minimization took 179 ms.
[2026-05-25 09:27:36] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:36] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2026-05-25 09:27:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 09:27:37] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2026-05-25 09:27:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 530 ms
[2026-05-25 09:27:37] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 57 ms.
[2026-05-25 09:27:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 702 ms
[2026-05-25 09:27:40] [INFO ] Added : 253 causal constraints over 54 iterations in 3225 ms. Result :sat
Minimization took 176 ms.
[2026-05-25 09:27:41] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:41] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2026-05-25 09:27:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:41] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:41] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2026-05-25 09:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2026-05-25 09:27:42] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 53 ms.
[2026-05-25 09:27:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1641 ms
[2026-05-25 09:27:46] [INFO ] Added : 226 causal constraints over 46 iterations in 3904 ms. Result :sat
Minimization took 158 ms.
[2026-05-25 09:27:46] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:27:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2026-05-25 09:27:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:47] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2026-05-25 09:27:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1300 ms
[2026-05-25 09:27:48] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 47 ms.
[2026-05-25 09:27: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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
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 09:27:51] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:52] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2026-05-25 09:27:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:27:52] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2026-05-25 09:27:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4177 ms
[2026-05-25 09:27:56] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 46 ms.
[2026-05-25 09:27:57] [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 5
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 09:27:57] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2026-05-25 09:27:57] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-05-25 09:27:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:27:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2026-05-25 09:27:58] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2026-05-25 09:28:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3471 ms
[2026-05-25 09:28:01] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 41 ms.
[2026-05-25 09:28:02] [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 6
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 09:28:02] [INFO ] [Real]Absence check using 7 positive place invariants in 42 ms returned sat
[2026-05-25 09:28:03] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2026-05-25 09:28:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:28:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 71 ms returned sat
[2026-05-25 09:28:03] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2026-05-25 09:28:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 944 ms
[2026-05-25 09:28:04] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 41 ms.
[2026-05-25 09:28:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1071 ms
[2026-05-25 09:28:07] [INFO ] Added : 231 causal constraints over 47 iterations in 3274 ms. Result :sat
Minimization took 161 ms.
[2026-05-25 09:28:08] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-25 09:28:08] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-25 09:28:08] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 32 ms.
[2026-05-25 09:28:08] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:28:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2026-05-25 09:28:08] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2026-05-25 09:28:08] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 24 ms.
[2026-05-25 09:28:10] [INFO ] Added : 223 causal constraints over 45 iterations in 2384 ms. Result :sat
Minimization took 202 ms.
[2026-05-25 09:28:11] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2026-05-25 09:28:11] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-25 09:28:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:28:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:28:12] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2026-05-25 09:28:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1053 ms
[2026-05-25 09:28:13] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 36 ms.
[2026-05-25 09:28:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2026-05-25 09:28:15] [INFO ] Added : 219 causal constraints over 45 iterations in 2822 ms. Result :sat
Minimization took 181 ms.
[2026-05-25 09:28:16] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2026-05-25 09:28:16] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2026-05-25 09:28:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:28:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 10 ms returned sat
[2026-05-25 09:28:17] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2026-05-25 09:28:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2026-05-25 09:28:17] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 59 ms.
[2026-05-25 09:28:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2026-05-25 09:28:20] [INFO ] Added : 210 causal constraints over 42 iterations in 3325 ms. Result :sat
Minimization took 178 ms.
[2026-05-25 09:28:20] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2026-05-25 09:28:21] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2026-05-25 09:28:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 09:28:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-25 09:28:21] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2026-05-25 09:28:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 553 ms
[2026-05-25 09:28:22] [INFO ] Computed and/alt/rep : 311/768/311 causal constraints (skipped 229 transitions) in 51 ms.
[2026-05-25 09:28:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 919 ms
[2026-05-25 09:28:25] [INFO ] Added : 228 causal constraints over 46 iterations in 3052 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[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]
FORMULA MedleyA-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-18-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyA-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 272 edges and 252 vertex of which 13 / 252 are part of one of the 3 SCC in 11 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 242 transition count 479
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 193 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 107 place count 192 transition count 472
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 112 place count 187 transition count 472
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 112 place count 187 transition count 464
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 128 place count 179 transition count 464
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 168 place count 139 transition count 394
Iterating global reduction 4 with 40 rules applied. Total rules applied 208 place count 139 transition count 394
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 210 place count 139 transition count 392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 212 place count 137 transition count 392
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 212 place count 137 transition count 386
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 224 place count 131 transition count 386
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 228 place count 127 transition count 354
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 127 transition count 354
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 234 place count 125 transition count 350
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 125 transition count 350
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 276 place count 105 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 281 place count 105 transition count 325
Performed 18 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 317 place count 87 transition count 394
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 324 place count 87 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 334 place count 87 transition count 377
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 342 place count 83 transition count 373
Free-agglomeration rule applied 24 times.
Iterating global reduction 8 with 24 rules applied. Total rules applied 366 place count 83 transition count 349
Reduce places removed 24 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 8 with 49 rules applied. Total rules applied 415 place count 59 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 432 place count 59 transition count 307
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 433 place count 59 transition count 321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 434 place count 58 transition count 321
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 435 place count 57 transition count 320
Applied a total of 435 rules in 165 ms. Remains 57 /252 variables (removed 195) and now considering 320/541 (removed 221) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 57/252 places, 320/541 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14127202374099881707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11021974303495063837.kers'
[2026-05-25 09:28:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14127202374099881707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11021974303495063837.kers]
Normalized transition count is 275 out of 320 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 275 rows 56 cols 1262 entries
Finished phase 1 with 49 SingleSign rule and 1 generalized
[2026-05-25 09:28:27] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11021974303495063837.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (94699 resets) in 2546 ms. (392 steps per ms)
FORMULA MedleyA-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (21938 resets) in 716 ms. (1394 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 65159 ms.

BK_STOP 1779701310412

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-18"
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 MedleyA-PT-18, 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-177969020000237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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