fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r354-tall-178024402900229
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for SupplyChain-PT-01000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2038.892 146015.00 171404.00 327.00 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402900229.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is SupplyChain-PT-01000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402900229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.2K May 27 07:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 27 07:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 27 07:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 27 07:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 27 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.6K May 27 07:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 27 07:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 27 07:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 27 07:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 11:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 4.1M May 26 18:17 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 SupplyChain-PT-01000-UpperBounds-00
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-01
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-02
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-03
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-04
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-05
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-06
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-07
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-08
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-09
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-10
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-11
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-12
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-13
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-14
FORMULA_NAME SupplyChain-PT-01000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780261374626

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-01000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-31 21:02:56] [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-31 21:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-31 21:02:56] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2026-05-31 21:02:56] [INFO ] Transformed 13004 places.
[2026-05-31 21:02:56] [INFO ] Transformed 8003 transitions.
[2026-05-31 21:02:56] [INFO ] Parsed PT model containing 13004 places and 8003 transitions and 36006 arcs in 610 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12543324010660645060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14743058959873008850.kers'
[2026-05-31 21:02:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12543324010660645060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14743058959873008850.kers]
Normalized transition count is 8002 out of 8003 initially.
Culling duplicate invariants (modulo rational): removing 3090 columns.
Culled 3090 columns in 11 ms.
// Phase 1: matrix 8002 rows 9914 cols 26004 entries
Finished phase 1 with 5912 SingleSign rule and 1000 generalized
[2026-05-31 21:02:57] [INFO ] Computed 6092 invariants in 76 ms
Computed 6092 P flows in 77 ms.
Exported basis to /tmp/petrispot-output-14743058959873008850.kers
Total runtime 87 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0] Max Struct:[2, 2, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1]
RANDOM walk for 10000 steps (2 resets) in 1896 ms. (5 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 4393 ms. (36 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0] Max Struct:[2, 2, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1]
[2026-05-31 21:03:03] [INFO ] Invariant cache hit.
[2026-05-31 21:03:06] [INFO ] [Real]Absence check using 2002 positive place invariants in 921 ms returned sat
[2026-05-31 21:03:07] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1213 ms returned sat
[2026-05-31 21:03:08] [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 0
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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:03:11] [INFO ] [Real]Absence check using 2002 positive place invariants in 860 ms returned sat
[2026-05-31 21:03:12] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1291 ms returned sat
[2026-05-31 21:03:13] [INFO ] [Real]Absence check using state equation in 1061 ms returned unknown
[2026-05-31 21:03:16] [INFO ] [Real]Absence check using 2002 positive place invariants in 808 ms returned sat
[2026-05-31 21:03:17] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1298 ms returned sat
[2026-05-31 21:03:18] [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 2
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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:03:20] [INFO ] [Real]Absence check using 2002 positive place invariants in 809 ms returned sat
[2026-05-31 21:03:22] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1224 ms returned sat
[2026-05-31 21:03:23] [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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:03:26] [INFO ] [Real]Absence check using 2002 positive place invariants in 784 ms returned sat
[2026-05-31 21:03:27] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1246 ms returned sat
[2026-05-31 21:03:28] [INFO ] [Real]Absence check using state equation in 1362 ms returned unknown
[2026-05-31 21:03:31] [INFO ] [Real]Absence check using 2002 positive place invariants in 887 ms returned sat
[2026-05-31 21:03:32] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1316 ms returned sat
[2026-05-31 21:03:33] [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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:03:36] [INFO ] [Real]Absence check using 2002 positive place invariants in 829 ms returned sat
[2026-05-31 21:03:37] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1221 ms returned sat
[2026-05-31 21:03:38] [INFO ] [Real]Absence check using state equation in 1222 ms returned unknown
[2026-05-31 21:03:41] [INFO ] [Real]Absence check using 2002 positive place invariants in 822 ms returned sat
[2026-05-31 21:03:42] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1198 ms returned sat
[2026-05-31 21:03:43] [INFO ] [Real]Absence check using state equation in 1327 ms returned unknown
[2026-05-31 21:03:46] [INFO ] [Real]Absence check using 2002 positive place invariants in 843 ms returned sat
[2026-05-31 21:03:47] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1299 ms returned sat
[2026-05-31 21:03:48] [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 8
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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:03:51] [INFO ] [Real]Absence check using 2002 positive place invariants in 849 ms returned sat
[2026-05-31 21:03:52] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1269 ms returned sat
[2026-05-31 21:03:53] [INFO ] [Real]Absence check using state equation in 1037 ms returned unknown
[2026-05-31 21:03:56] [INFO ] [Real]Absence check using 2002 positive place invariants in 846 ms returned sat
[2026-05-31 21:03:57] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1299 ms returned sat
[2026-05-31 21:03:58] [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 10
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.verifyPossible(DeadlockTester.java:857)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2278)
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-31 21:04:00] [INFO ] [Real]Absence check using 2002 positive place invariants in 811 ms returned sat
[2026-05-31 21:04:02] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1242 ms returned sat
[2026-05-31 21:04:03] [INFO ] [Real]Absence check using state equation in 1537 ms returned unknown
[2026-05-31 21:04:06] [INFO ] [Real]Absence check using 2002 positive place invariants in 825 ms returned sat
[2026-05-31 21:04:07] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1264 ms returned sat
[2026-05-31 21:04:08] [INFO ] [Real]Absence check using state equation in 1295 ms returned unknown
[2026-05-31 21:04:11] [INFO ] [Real]Absence check using 2002 positive place invariants in 850 ms returned sat
[2026-05-31 21:04:12] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1299 ms returned sat
[2026-05-31 21:04:13] [INFO ] [Real]Absence check using state equation in 1105 ms returned unknown
[2026-05-31 21:04:16] [INFO ] [Real]Absence check using 2002 positive place invariants in 835 ms returned sat
[2026-05-31 21:04:17] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1265 ms returned sat
[2026-05-31 21:04:18] [INFO ] [Real]Absence check using state equation in 1204 ms returned unknown
[2026-05-31 21:04:21] [INFO ] [Real]Absence check using 2002 positive place invariants in 845 ms returned sat
[2026-05-31 21:04:22] [INFO ] [Real]Absence check using 2002 positive and 4090 generalized place invariants in 1315 ms returned sat
[2026-05-31 21:04:23] [INFO ] [Real]Absence check using state equation in 1191 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0] Max Struct:[2, 2, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0] Max Struct:[2, 2, 1, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1]
Support contains 16 out of 13004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13004/13004 places, 8003/8003 transitions.
Graph (complete) has 34362 edges and 13004 vertex of which 13002 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.40 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 3090 places
Iterating post reduction 0 with 3090 rules applied. Total rules applied 3091 place count 9912 transition count 8001
Performed 1000 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1000 Pre rules applied. Total rules applied 3091 place count 9912 transition count 7001
Deduced a syphon composed of 1000 places in 5 ms
Ensure Unique test removed 1000 places
Reduce places removed 2000 places and 0 transitions.
Iterating global reduction 1 with 3000 rules applied. Total rules applied 6091 place count 7912 transition count 7001
Free-agglomeration rule applied 1905 times.
Iterating global reduction 1 with 1905 rules applied. Total rules applied 7996 place count 7912 transition count 5096
Ensure Unique test removed 998 places
Reduce places removed 2903 places and 0 transitions.
Ensure Unique test removed 998 transitions
Reduce isomorphic transitions removed 998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 990 transitions
Trivial Post-agglo rules discarded 990 transitions
Performed 990 trivial Post agglomeration. Transition count delta: 990
Iterating post reduction 1 with 4891 rules applied. Total rules applied 12887 place count 5009 transition count 3108
Reduce places removed 990 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 995 rules applied. Total rules applied 13882 place count 4019 transition count 3103
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 13887 place count 4014 transition count 3103
Performed 990 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 990 Pre rules applied. Total rules applied 13887 place count 4014 transition count 2113
Deduced a syphon composed of 990 places in 3 ms
Reduce places removed 990 places and 0 transitions.
Iterating global reduction 4 with 1980 rules applied. Total rules applied 15867 place count 3024 transition count 2113
Free-agglomeration rule (complex) applied 90 times.
Iterating global reduction 4 with 90 rules applied. Total rules applied 15957 place count 3024 transition count 2023
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 4 with 90 rules applied. Total rules applied 16047 place count 2934 transition count 2023
Applied a total of 16047 rules in 4265 ms. Remains 2934 /13004 variables (removed 10070) and now considering 2023/8003 (removed 5980) transitions.
Running 1020 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3760283480262427561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12231953895768545106.kers'
[2026-05-31 21:04:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3760283480262427561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12231953895768545106.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 2023 rows 2934 cols 7051 entries
Finished phase 1 with 1930 SingleSign rule and 1 generalized
[2026-05-31 21:04:28] [INFO ] Computed 1003 invariants in 13 ms
Computed 1003 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12231953895768545106.kers
Total runtime 16 ms.
[2026-05-31 21:04:28] [INFO ] State equation strengthened by 90 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Problem TDEAD5 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD927 is UNSAT
Problem TDEAD928 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD947 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1359 is UNSAT
Problem TDEAD1365 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1372 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1380 is UNSAT
Problem TDEAD1382 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1391 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1409 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1414 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1453 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1484 is UNSAT
Problem TDEAD1487 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1493 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1777 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1784 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1795 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2921 variables, 1/1 constraints. Problems are: Problem set: 910 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2921 variables, 987/988 constraints. Problems are: Problem set: 910 solved, 110 unsolved
Problem TDEAD42 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1407 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1494 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1840 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2921 variables, 1/989 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2921 variables, 0/989 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 13/2934 variables, 15/1004 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2934 variables, 0/1004 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2023/4957 variables, 2934/3938 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4957 variables, 90/4028 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4957/4957 variables, and 4028 constraints, problems are : Problem set: 1000 solved, 20 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1002/1002 constraints, State Equation: 2934/2934 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1020/1019 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1000 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1021 variables, 1/1 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1021 variables, 0/1 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 910/1931 variables, 1/2 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1931 variables, 0/2 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1003/2934 variables, 1002/1004 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2934 variables, 0/1004 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2023/4957 variables, 2934/3938 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4957 variables, 90/4028 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4957 variables, 19/4047 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4957 variables, 0/4047 constraints. Problems are: Problem set: 1000 solved, 20 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4957/4957 variables, and 4047 constraints, problems are : Problem set: 1000 solved, 20 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1002/1002 constraints, State Equation: 2934/2934 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 20/1019 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41470ms problems are : Problem set: 1000 solved, 20 unsolved
Search for dead transitions found 1000 dead transitions in 41499ms
Found 1000 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1000 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2934/13004 places, 1023/8003 transitions.
Graph (complete) has 2026 edges and 2934 vertex of which 2026 are kept as prefixes of interest. Removing 908 places using SCC suffix rule.2 ms
Discarding 908 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 2025 transition count 1015
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 2017 transition count 1015
Performed 988 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 988 Pre rules applied. Total rules applied 18 place count 2017 transition count 27
Renaming transitions due to excessive name length > 1024 char.
Deduced a syphon composed of 990 places in 0 ms
Ensure Unique test removed 986 places
Reduce places removed 1974 places and 0 transitions.
Iterating global reduction 2 with 2962 rules applied. Total rules applied 2980 place count 43 transition count 27
Deduced a syphon composed of 2 places in 0 ms
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 2983 place count 43 transition count 24
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 2986 place count 40 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 2988 place count 40 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2988 rules in 242 ms. Remains 40 /2934 variables (removed 2894) and now considering 24/1023 (removed 999) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46044 ms. Remains : 40/13004 places, 24/8003 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SupplyChain-PT-01000-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SupplyChain-PT-01000-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0] Max Struct:[2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13789113870534657056.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6376889108548945464.kers'
[2026-05-31 21:05:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13789113870534657056.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6376889108548945464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 38 cols 93 entries
Finished phase 1 with 21 SingleSign rule and 1 generalized
[2026-05-31 21:05:09] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6376889108548945464.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0] Max Struct:[2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2]
RANDOM walk for 1000000 steps (50000 resets) in 2650 ms. (377 steps per ms)
BEST_FIRST walk for 14000013 steps (78911 resets) in 7490 ms. (1868 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2]
[2026-05-31 21:05:20] [INFO ] Invariant cache hit.
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 7 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 2 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 3 ms returned sat
[2026-05-31 21:05:20] [INFO ] [Real]Absence check using state equation in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SupplyChain-PT-01000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-01000-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 144496 ms.

BK_STOP 1780261520641

--------------------
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="SupplyChain-PT-01000"
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 SupplyChain-PT-01000, 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 r354-tall-178024402900229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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