Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075800015.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DBSingleClientW-PT-d2m04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 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 DBSingleClientW-PT-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602159275

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:49:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:49:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:49:21] [INFO ] Load time of PNML (sax parser for PT used): 384 ms
[2025-05-30 10:49:21] [INFO ] Transformed 4763 places.
[2025-05-30 10:49:22] [INFO ] Transformed 2478 transitions.
[2025-05-30 10:49:22] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 574 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 3580 places in 38 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2025-05-30 10:49:22] [INFO ] Computed 6 invariants in 232 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
RANDOM walk for 10000 steps (2311 resets) in 570 ms. (17 steps per ms)
BEST_FIRST walk for 60004 steps (5644 resets) in 548 ms. (109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
[2025-05-30 10:49:23] [INFO ] Invariant cache hit.
[2025-05-30 10:49:24] [INFO ] [Real]Absence check using 2 positive place invariants in 38 ms returned sat
[2025-05-30 10:49:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2025-05-30 10:49:25] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2025-05-30 10:49:26] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2025-05-30 10:49:27] [INFO ] [Real]Added 1588 Read/Feed constraints in 1326 ms returned sat
[2025-05-30 10:49:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:49:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2025-05-30 10:49:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2025-05-30 10:49:29] [INFO ] [Nat]Absence check using state equation in 1032 ms returned sat
[2025-05-30 10:49:30] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:49:30] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1858 ms returned sat
[2025-05-30 10:49:32] [INFO ] Deduced a trap composed of 194 places in 1372 ms of which 114 ms to minimize.
[2025-05-30 10:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1740 ms
[2025-05-30 10:49:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-30 10:49:33] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2025-05-30 10:49:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 10:49:34] [INFO ] [Real]Absence check using state equation in 1140 ms returned sat
[2025-05-30 10:49:35] [INFO ] [Real]Added 1588 Read/Feed constraints in 1091 ms returned sat
[2025-05-30 10:49:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:49:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2025-05-30 10:49:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2025-05-30 10:49:36] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2025-05-30 10:49:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1494 ms returned sat
[2025-05-30 10:49:40] [INFO ] Deduced a trap composed of 48 places in 1686 ms of which 16 ms to minimize.
[2025-05-30 10:49:40] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2256 ms
[2025-05-30 10:49:40] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2025-05-30 10:49:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 10:49:42] [INFO ] [Real]Absence check using state equation in 1230 ms returned sat
[2025-05-30 10:49:43] [INFO ] [Real]Added 1588 Read/Feed constraints in 1468 ms returned sat
[2025-05-30 10:49:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:49:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2025-05-30 10:49:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 10:49:45] [INFO ] [Nat]Absence check using state equation in 1204 ms returned sat
[2025-05-30 10:49:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:49:47] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1828 ms returned sat
[2025-05-30 10:49:48] [INFO ] Deduced a trap composed of 73 places in 1589 ms of which 18 ms to minimize.
[2025-05-30 10:49:48] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1709 ms
[2025-05-30 10:49:49] [INFO ] [Real]Absence check using 2 positive place invariants in 23 ms returned sat
[2025-05-30 10:49:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2025-05-30 10:49:50] [INFO ] [Real]Absence check using state equation in 1101 ms returned sat
[2025-05-30 10:49:51] [INFO ] [Real]Added 1588 Read/Feed constraints in 1101 ms returned sat
[2025-05-30 10:49:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:49:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2025-05-30 10:49:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2025-05-30 10:49:52] [INFO ] [Nat]Absence check using state equation in 986 ms returned sat
[2025-05-30 10:49:54] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:49:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1742 ms returned sat
[2025-05-30 10:49:55] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1043 ms.
[2025-05-30 10:49:56] [INFO ] Added : 9 causal constraints over 2 iterations in 1807 ms. Result :sat
Minimization took 60 ms.
[2025-05-30 10:49:56] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2025-05-30 10:49:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2025-05-30 10:49:57] [INFO ] [Real]Absence check using state equation in 1208 ms returned sat
[2025-05-30 10:49:59] [INFO ] [Real]Added 1588 Read/Feed constraints in 1164 ms returned sat
[2025-05-30 10:49:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:49:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2025-05-30 10:49:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 27 ms returned sat
[2025-05-30 10:50:00] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2025-05-30 10:50:02] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:50:03] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2132 ms returned unknown
[2025-05-30 10:50:03] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2025-05-30 10:50:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2025-05-30 10:50:04] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2025-05-30 10:50:05] [INFO ] [Real]Added 1588 Read/Feed constraints in 1351 ms returned sat
[2025-05-30 10:50:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 22 ms returned sat
[2025-05-30 10:50:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2025-05-30 10:50:07] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2025-05-30 10:50:08] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 10:50:09] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1918 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
Support contains 6 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.17 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1316 place count 435 transition count 881
Iterating global reduction 2 with 313 rules applied. Total rules applied 1629 place count 435 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1641 place count 435 transition count 869
Discarding 237 places :
Symmetric choice reduction at 3 with 237 rule applications. Total rules 1878 place count 198 transition count 535
Iterating global reduction 3 with 237 rules applied. Total rules applied 2115 place count 198 transition count 535
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2324 place count 198 transition count 326
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2348 place count 174 transition count 287
Iterating global reduction 4 with 24 rules applied. Total rules applied 2372 place count 174 transition count 287
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2378 place count 174 transition count 281
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2394 place count 158 transition count 265
Iterating global reduction 5 with 16 rules applied. Total rules applied 2410 place count 158 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2414 place count 158 transition count 261
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2427 place count 145 transition count 248
Iterating global reduction 6 with 13 rules applied. Total rules applied 2440 place count 145 transition count 248
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2453 place count 145 transition count 235
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2456 place count 142 transition count 221
Iterating global reduction 7 with 3 rules applied. Total rules applied 2459 place count 142 transition count 221
Applied a total of 2459 rules in 512 ms. Remains 142 /1183 variables (removed 1041) and now considering 221/2478 (removed 2257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 142/1183 places, 221/2478 transitions.
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:50:10] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
RANDOM walk for 1000000 steps (230094 resets) in 1924 ms. (519 steps per ms)
BEST_FIRST walk for 6000002 steps (575445 resets) in 5313 ms. (1129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
[2025-05-30 10:50:17] [INFO ] Invariant cache hit.
[2025-05-30 10:50:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 9 ms returned sat
[2025-05-30 10:50:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-30 10:50:17] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:50:17] [INFO ] [Real]Added 86 Read/Feed constraints in 29 ms returned sat
[2025-05-30 10:50:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:17] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2025-05-30 10:50:17] [INFO ] [Nat]Added 86 Read/Feed constraints in 35 ms returned sat
[2025-05-30 10:50:17] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 22 ms.
[2025-05-30 10:50:17] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 3 ms to minimize.
[2025-05-30 10:50:18] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2025-05-30 10:50:18] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2025-05-30 10:50:18] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
[2025-05-30 10:50:18] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2025-05-30 10:50:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 589 ms
[2025-05-30 10:50:18] [INFO ] Added : 13 causal constraints over 4 iterations in 726 ms. Result :sat
Minimization took 179 ms.
[2025-05-30 10:50:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:18] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:50:18] [INFO ] [Real]Added 86 Read/Feed constraints in 21 ms returned sat
[2025-05-30 10:50:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:50:18] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2025-05-30 10:50:18] [INFO ] [Nat]Added 86 Read/Feed constraints in 20 ms returned sat
[2025-05-30 10:50:19] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 20 ms.
[2025-05-30 10:50:19] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 3 ms to minimize.
[2025-05-30 10:50:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-05-30 10:50:19] [INFO ] Added : 13 causal constraints over 4 iterations in 313 ms. Result :sat
Minimization took 254 ms.
[2025-05-30 10:50:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:19] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2025-05-30 10:50:19] [INFO ] [Real]Added 86 Read/Feed constraints in 27 ms returned sat
[2025-05-30 10:50:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:19] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2025-05-30 10:50:19] [INFO ] [Nat]Added 86 Read/Feed constraints in 23 ms returned sat
[2025-05-30 10:50:19] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 19 ms.
[2025-05-30 10:50:20] [INFO ] Added : 12 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 166 ms.
[2025-05-30 10:50:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:20] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:50:20] [INFO ] [Real]Added 86 Read/Feed constraints in 23 ms returned sat
[2025-05-30 10:50:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:50:20] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-30 10:50:20] [INFO ] [Nat]Added 86 Read/Feed constraints in 30 ms returned sat
[2025-05-30 10:50:20] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 18 ms.
[2025-05-30 10:50:20] [INFO ] Added : 10 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 160 ms.
[2025-05-30 10:50:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:50:20] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 10:50:21] [INFO ] [Real]Added 86 Read/Feed constraints in 32 ms returned sat
[2025-05-30 10:50:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:50:21] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2025-05-30 10:50:21] [INFO ] [Nat]Added 86 Read/Feed constraints in 78 ms returned sat
[2025-05-30 10:50:21] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 34 ms.
[2025-05-30 10:50:21] [INFO ] Added : 15 causal constraints over 4 iterations in 195 ms. Result :sat
Minimization took 253 ms.
[2025-05-30 10:50:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:50:21] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-05-30 10:50:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:50:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:50:22] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-05-30 10:50:22] [INFO ] [Nat]Added 86 Read/Feed constraints in 46 ms returned sat
[2025-05-30 10:50:22] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 17 ms.
[2025-05-30 10:50:22] [INFO ] Added : 14 causal constraints over 3 iterations in 131 ms. Result :sat
Minimization took 254 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
Support contains 6 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Applied a total of 0 rules in 18 ms. Remains 142 /142 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 142/142 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Applied a total of 0 rules in 10 ms. Remains 142 /142 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2025-05-30 10:50:22] [INFO ] Invariant cache hit.
[2025-05-30 10:50:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-30 10:50:23] [INFO ] Invariant cache hit.
[2025-05-30 10:50:23] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:50:23] [INFO ] Implicit Places using invariants and state equation in 798 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2025-05-30 10:50:23] [INFO ] Redundant transitions in 10 ms returned []
Running 220 sub problems to find dead transitions.
[2025-05-30 10:50:23] [INFO ] Invariant cache hit.
[2025-05-30 10:50:23] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/363 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 86/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (OVERLAPS) 0/363 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 230 constraints, problems are : Problem set: 0 solved, 220 unsolved in 12727 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 142/142 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/363 variables, 142/144 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 86/230 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 220/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/363 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 450 constraints, problems are : Problem set: 0 solved, 220 unsolved in 25243 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 142/142 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 38708ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 38728ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39721 ms. Remains : 142/142 places, 221/221 transitions.
RANDOM walk for 40000 steps (9158 resets) in 3062 ms. (13 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3820 resets) in 904 ms. (44 steps per ms) remains 12/12 properties
[2025-05-30 10:51:03] [INFO ] Flatten gal took : 146 ms
[2025-05-30 10:51:03] [INFO ] Flatten gal took : 89 ms
[2025-05-30 10:51:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12517191253793089129.gal : 25 ms
[2025-05-30 10:51:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6481306582929546455.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12517191253793089129.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6481306582929546455.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (3850 resets) in 873 ms. (45 steps per ms) remains 12/12 properties
Loading property file /tmp/ReachabilityCardinality6481306582929546455.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :30 after 68
BEST_FIRST walk for 40002 steps (3929 resets) in 522 ms. (76 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :106 after 170
BEST_FIRST walk for 40004 steps (3879 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :170 after 276
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :276 after 624
BEST_FIRST walk for 40003 steps (3842 resets) in 267 ms. (149 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3832 resets) in 265 ms. (150 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (3801 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3814 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :624 after 1832
BEST_FIRST walk for 40003 steps (3956 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3888 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :1832 after 3754
BEST_FIRST walk for 40002 steps (3914 resets) in 175 ms. (227 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3900 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
Invariant property MIN0 does not hold.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :3754 after 7679
Invariant property MIN2 does not hold.
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :7679 after 12652
Probably explored full state space saw : 29877 states, properties seen :6
Probabilistic random walk after 73974 steps, saw 29877 distinct states, run finished after 856 ms. (steps per millisecond=86 ) properties seen :6
Explored full state space saw : 29964 states, properties seen :0
Exhaustive walk after 74145 steps, saw 29964 distinct states, run finished after 203 ms. (steps per millisecond=365 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1597, 4, 7, 7, 7, 4]
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1597]
[2025-05-30 10:51:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1597]
RANDOM walk for 10000 steps (2373 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10000 steps (942 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1597]
[2025-05-30 10:51:06] [INFO ] Invariant cache hit.
[2025-05-30 10:51:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:51:06] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-30 10:51:06] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:51:06] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2025-05-30 10:51:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:51:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:51:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-30 10:51:06] [INFO ] [Nat]Added 86 Read/Feed constraints in 33 ms returned sat
[2025-05-30 10:51:06] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 19 ms.
[2025-05-30 10:51:06] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2025-05-30 10:51:06] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 2 ms to minimize.
[2025-05-30 10:51:06] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2025-05-30 10:51:07] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2025-05-30 10:51:07] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2025-05-30 10:51:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 765 ms
[2025-05-30 10:51:07] [INFO ] Added : 13 causal constraints over 4 iterations in 900 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1597]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 217
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 134 transition count 212
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 134 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 134 transition count 210
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 130 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 130 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 130 transition count 191
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 128 transition count 182
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 127 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 127 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 126 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 125 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 125 transition count 178
Applied a total of 37 rules in 55 ms. Remains 125 /142 variables (removed 17) and now considering 178/221 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 125/142 places, 178/221 transitions.
// Phase 1: matrix 178 rows 125 cols
[2025-05-30 10:51:07] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1597]
RANDOM walk for 1000000 steps (230140 resets) in 1787 ms. (559 steps per ms)
BEST_FIRST walk for 1000001 steps (95671 resets) in 911 ms. (1096 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1597]
[2025-05-30 10:51:10] [INFO ] Invariant cache hit.
[2025-05-30 10:51:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:51:10] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-05-30 10:51:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 10:51:10] [INFO ] [Real]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-05-30 10:51:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:51:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:51:10] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2025-05-30 10:51:10] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-05-30 10:51:10] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 13 ms.
[2025-05-30 10:51:10] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2025-05-30 10:51:10] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2025-05-30 10:51:11] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2025-05-30 10:51:11] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2025-05-30 10:51:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 427 ms
[2025-05-30 10:51:11] [INFO ] Added : 18 causal constraints over 5 iterations in 556 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1597]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 12 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 10:51:11] [INFO ] Invariant cache hit.
[2025-05-30 10:51:11] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-30 10:51:11] [INFO ] Invariant cache hit.
[2025-05-30 10:51:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 10:51:12] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
[2025-05-30 10:51:12] [INFO ] Redundant transitions in 14 ms returned []
Running 177 sub problems to find dead transitions.
[2025-05-30 10:51:12] [INFO ] Invariant cache hit.
[2025-05-30 10:51:12] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2025-05-30 10:51:18] [INFO ] Deduced a trap composed of 11 places in 186 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10409 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/303 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17826 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
After SMT, in 28745ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 28763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29591 ms. Remains : 125/125 places, 178/178 transitions.
[2025-05-30 10:51:41] [INFO ] Flatten gal took : 72 ms
[2025-05-30 10:51:41] [INFO ] Flatten gal took : 19 ms
[2025-05-30 10:51:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8103033775415713494.gal : 7 ms
[2025-05-30 10:51:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15055521693431390418.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8103033775415713494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15055521693431390418.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15055521693431390418.prop.
RANDOM walk for 40000 steps (9258 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
BEST_FIRST walk for 40002 steps (3870 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 276
BEST_FIRST walk for 40002 steps (3724 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276 after 575
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :575 after 1470
Probably explored full state space saw : 24028 states, properties seen :1
Probabilistic random walk after 56508 steps, saw 24028 distinct states, run finished after 126 ms. (steps per millisecond=448 ) properties seen :1
Explored full state space saw : 24063 states, properties seen :0
Exhaustive walk after 56543 steps, saw 24063 distinct states, run finished after 73 ms. (steps per millisecond=774 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1597]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00 in 35576 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:51:41] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2289 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (982 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:51:41] [INFO ] Invariant cache hit.
[2025-05-30 10:51:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:51:41] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-30 10:51:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:51:41] [INFO ] [Real]Added 86 Read/Feed constraints in 28 ms returned sat
[2025-05-30 10:51:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:51:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:51:42] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-05-30 10:51:42] [INFO ] [Nat]Added 86 Read/Feed constraints in 28 ms returned sat
[2025-05-30 10:51:42] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 31 ms.
[2025-05-30 10:51:42] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2025-05-30 10:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-05-30 10:51:42] [INFO ] Added : 13 causal constraints over 4 iterations in 319 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 134 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 134 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 134 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 131 transition count 188
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 131 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 131 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 27 place count 130 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 130 transition count 179
Applied a total of 28 rules in 42 ms. Remains 130 /142 variables (removed 12) and now considering 179/221 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 130/142 places, 179/221 transitions.
// Phase 1: matrix 179 rows 130 cols
[2025-05-30 10:51:42] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (230310 resets) in 1849 ms. (540 steps per ms)
BEST_FIRST walk for 1000000 steps (96058 resets) in 697 ms. (1432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:51:45] [INFO ] Invariant cache hit.
[2025-05-30 10:51:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:51:45] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-30 10:51:45] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 10:51:45] [INFO ] [Real]Added 53 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:51:45] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 127 transitions) in 15 ms.
[2025-05-30 10:51:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:51:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:51:45] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2025-05-30 10:51:45] [INFO ] [Nat]Added 53 Read/Feed constraints in 20 ms returned sat
[2025-05-30 10:51:45] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 127 transitions) in 24 ms.
[2025-05-30 10:51:45] [INFO ] Added : 9 causal constraints over 3 iterations in 124 ms. Result :sat
Minimization took 168 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 10 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 130/130 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 8 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2025-05-30 10:51:45] [INFO ] Invariant cache hit.
[2025-05-30 10:51:46] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-05-30 10:51:46] [INFO ] Invariant cache hit.
[2025-05-30 10:51:46] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 10:51:46] [INFO ] Implicit Places using invariants and state equation in 752 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2025-05-30 10:51:46] [INFO ] Redundant transitions in 4 ms returned []
Running 178 sub problems to find dead transitions.
[2025-05-30 10:51:46] [INFO ] Invariant cache hit.
[2025-05-30 10:51:46] [INFO ] State equation strengthened by 53 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/309 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 53/185 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2025-05-30 10:51:53] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/309 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 186 constraints, problems are : Problem set: 0 solved, 178 unsolved in 11120 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/309 variables, 130/133 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 53/186 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 178/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/309 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 364 constraints, problems are : Problem set: 0 solved, 178 unsolved in 16149 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 1/1 constraints]
After SMT, in 27810ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 27815ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28844 ms. Remains : 130/130 places, 179/179 transitions.
[2025-05-30 10:52:14] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:52:14] [INFO ] Flatten gal took : 17 ms
[2025-05-30 10:52:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5468138196603348793.gal : 5 ms
[2025-05-30 10:52:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1038145979311639318.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5468138196603348793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1038145979311639318.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1038145979311639318.prop.
RANDOM walk for 40000 steps (9187 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40004 steps (3744 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 202
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :202 after 428
BEST_FIRST walk for 40004 steps (3705 resets) in 187 ms. (212 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :428 after 694
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :694 after 2875
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2875 after 7206
Probably explored full state space saw : 26332 states, properties seen :1
Probabilistic random walk after 62900 steps, saw 26332 distinct states, run finished after 436 ms. (steps per millisecond=144 ) properties seen :1
Explored full state space saw : 26384 states, properties seen :0
Exhaustive walk after 62954 steps, saw 26384 distinct states, run finished after 123 ms. (steps per millisecond=511 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-02 in 33985 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:52:15] [INFO ] Computed 2 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2309 resets) in 31 ms. (312 steps per ms)
BEST_FIRST walk for 10000 steps (972 resets) in 14 ms. (666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:52:15] [INFO ] Invariant cache hit.
[2025-05-30 10:52:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:52:15] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2025-05-30 10:52:15] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:52:15] [INFO ] [Real]Added 86 Read/Feed constraints in 25 ms returned sat
[2025-05-30 10:52:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:52:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:52:15] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-30 10:52:15] [INFO ] [Nat]Added 86 Read/Feed constraints in 25 ms returned sat
[2025-05-30 10:52:16] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 22 ms.
[2025-05-30 10:52:16] [INFO ] Added : 12 causal constraints over 3 iterations in 115 ms. Result :sat
Minimization took 162 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 137 transition count 215
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 137 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 137 transition count 214
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 132 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 132 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 132 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 128 transition count 182
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 128 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 128 transition count 181
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 126 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 126 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 125 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 125 transition count 171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 124 transition count 170
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 124 transition count 170
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 123 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 123 transition count 168
Applied a total of 42 rules in 39 ms. Remains 123 /142 variables (removed 19) and now considering 168/221 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 123/142 places, 168/221 transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-05-30 10:52:16] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230029 resets) in 1718 ms. (581 steps per ms)
BEST_FIRST walk for 1000000 steps (95416 resets) in 705 ms. (1416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:52:18] [INFO ] Invariant cache hit.
[2025-05-30 10:52:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:52:18] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:52:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 10:52:18] [INFO ] [Real]Added 49 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:52:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:52:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:52:19] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2025-05-30 10:52:19] [INFO ] [Nat]Added 49 Read/Feed constraints in 33 ms returned sat
[2025-05-30 10:52:19] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 21 ms.
[2025-05-30 10:52:19] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2025-05-30 10:52:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2025-05-30 10:52:19] [INFO ] Added : 16 causal constraints over 4 iterations in 306 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-05-30 10:52:19] [INFO ] Invariant cache hit.
[2025-05-30 10:52:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 10:52:19] [INFO ] Invariant cache hit.
[2025-05-30 10:52:19] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 10:52:20] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2025-05-30 10:52:20] [INFO ] Redundant transitions in 2 ms returned []
Running 167 sub problems to find dead transitions.
[2025-05-30 10:52:20] [INFO ] Invariant cache hit.
[2025-05-30 10:52:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (OVERLAPS) 168/291 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 49/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2025-05-30 10:52:25] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 175 constraints, problems are : Problem set: 0 solved, 167 unsolved in 9401 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 1/123 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/291 variables, 123/126 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 49/175 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 167/342 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/291 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 342 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14724 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 1/1 constraints]
After SMT, in 24540ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 24545ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25210 ms. Remains : 123/123 places, 168/168 transitions.
[2025-05-30 10:52:44] [INFO ] Flatten gal took : 23 ms
[2025-05-30 10:52:44] [INFO ] Flatten gal took : 22 ms
[2025-05-30 10:52:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6100859046594537502.gal : 5 ms
[2025-05-30 10:52:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6620153058114148769.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6100859046594537502.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6620153058114148769.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (9167 resets) in 258 ms. (154 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality6620153058114148769.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40002 steps (3767 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 170
BEST_FIRST walk for 40004 steps (3858 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 276
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276 after 584
Probably explored full state space saw : 23520 states, properties seen :1
Probabilistic random walk after 54832 steps, saw 23520 distinct states, run finished after 104 ms. (steps per millisecond=527 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :584 after 1635
Explored full state space saw : 23541 states, properties seen :0
Exhaustive walk after 54853 steps, saw 23541 distinct states, run finished after 61 ms. (steps per millisecond=899 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 29681 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:52:45] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2303 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (937 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:52:45] [INFO ] Invariant cache hit.
[2025-05-30 10:52:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:52:45] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 10:52:45] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:52:45] [INFO ] [Real]Added 86 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:52:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:52:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:52:45] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-30 10:52:45] [INFO ] [Nat]Added 86 Read/Feed constraints in 32 ms returned sat
[2025-05-30 10:52:45] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 29 ms.
[2025-05-30 10:52:45] [INFO ] Added : 10 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 134 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 134 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 134 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 131 transition count 190
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 131 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 131 transition count 189
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 129 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 129 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 128 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 128 transition count 179
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 127 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 127 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 126 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 126 transition count 176
Applied a total of 35 rules in 33 ms. Remains 126 /142 variables (removed 16) and now considering 176/221 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 126/142 places, 176/221 transitions.
// Phase 1: matrix 176 rows 126 cols
[2025-05-30 10:52:46] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230179 resets) in 1712 ms. (583 steps per ms)
BEST_FIRST walk for 1000001 steps (95542 resets) in 681 ms. (1466 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:52:48] [INFO ] Invariant cache hit.
[2025-05-30 10:52:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:52:48] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:52:48] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-30 10:52:48] [INFO ] [Real]Added 55 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:52:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:52:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:52:48] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2025-05-30 10:52:48] [INFO ] [Nat]Added 55 Read/Feed constraints in 29 ms returned sat
[2025-05-30 10:52:48] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 125 transitions) in 22 ms.
[2025-05-30 10:52:48] [INFO ] Added : 16 causal constraints over 4 iterations in 152 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 126/126 places, 176/176 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-05-30 10:52:49] [INFO ] Invariant cache hit.
[2025-05-30 10:52:49] [INFO ] Implicit Places using invariants in 145 ms returned []
[2025-05-30 10:52:49] [INFO ] Invariant cache hit.
[2025-05-30 10:52:49] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-05-30 10:52:49] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2025-05-30 10:52:49] [INFO ] Redundant transitions in 2 ms returned []
Running 175 sub problems to find dead transitions.
[2025-05-30 10:52:49] [INFO ] Invariant cache hit.
[2025-05-30 10:52:49] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 183 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9401 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/302 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 55/183 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 175/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/302 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 358 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16430 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 26256ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 26259ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26931 ms. Remains : 126/126 places, 176/176 transitions.
[2025-05-30 10:53:16] [INFO ] Flatten gal took : 13 ms
RANDOM walk for 40000 steps (9283 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
[2025-05-30 10:53:16] [INFO ] Flatten gal took : 13 ms
[2025-05-30 10:53:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5458736014351669576.gal : 8 ms
[2025-05-30 10:53:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1213756456467686462.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5458736014351669576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1213756456467686462.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (3890 resets) in 65 ms. (606 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1213756456467686462.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 136
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :136 after 202
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :202 after 441
BEST_FIRST walk for 40002 steps (3846 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :441 after 886
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :886 after 4563
Probably explored full state space saw : 23927 states, properties seen :1
Probabilistic random walk after 56089 steps, saw 23927 distinct states, run finished after 358 ms. (steps per millisecond=156 ) properties seen :1
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4563 after 6693
Explored full state space saw : 23955 states, properties seen :0
Exhaustive walk after 56117 steps, saw 23955 distinct states, run finished after 64 ms. (steps per millisecond=876 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-08 in 31423 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:53:16] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2310 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (967 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:53:16] [INFO ] Invariant cache hit.
[2025-05-30 10:53:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:53:16] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-30 10:53:16] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:53:16] [INFO ] [Real]Added 86 Read/Feed constraints in 22 ms returned sat
[2025-05-30 10:53:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:53:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:53:17] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2025-05-30 10:53:17] [INFO ] [Nat]Added 86 Read/Feed constraints in 49 ms returned sat
[2025-05-30 10:53:17] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 23 ms.
[2025-05-30 10:53:17] [INFO ] Added : 15 causal constraints over 4 iterations in 143 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 134 transition count 205
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 134 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 134 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 131 transition count 194
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 131 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 131 transition count 193
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 27 place count 129 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 129 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 128 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 127 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 126 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 126 transition count 180
Applied a total of 35 rules in 40 ms. Remains 126 /142 variables (removed 16) and now considering 180/221 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 126/142 places, 180/221 transitions.
// Phase 1: matrix 180 rows 126 cols
[2025-05-30 10:53:17] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229553 resets) in 1929 ms. (518 steps per ms)
BEST_FIRST walk for 1000000 steps (95837 resets) in 698 ms. (1430 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-30 10:53:20] [INFO ] Invariant cache hit.
[2025-05-30 10:53:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:53:20] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:53:20] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 10:53:20] [INFO ] [Real]Added 58 Read/Feed constraints in 18 ms returned sat
[2025-05-30 10:53:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:53:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:53:20] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-30 10:53:20] [INFO ] [Nat]Added 58 Read/Feed constraints in 23 ms returned sat
[2025-05-30 10:53:20] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 13 ms.
[2025-05-30 10:53:20] [INFO ] Added : 14 causal constraints over 4 iterations in 88 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-05-30 10:53:20] [INFO ] Invariant cache hit.
[2025-05-30 10:53:20] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-05-30 10:53:20] [INFO ] Invariant cache hit.
[2025-05-30 10:53:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-05-30 10:53:21] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2025-05-30 10:53:21] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 10:53:21] [INFO ] Invariant cache hit.
[2025-05-30 10:53:21] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 9522 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 16760 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 26558ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 26560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27351 ms. Remains : 126/126 places, 180/180 transitions.
[2025-05-30 10:53:48] [INFO ] Flatten gal took : 37 ms
[2025-05-30 10:53:48] [INFO ] Flatten gal took : 58 ms
[2025-05-30 10:53:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10670142585767191954.gal : 4 ms
[2025-05-30 10:53:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5486808922736712802.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10670142585767191954.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5486808922736712802.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (9224 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5486808922736712802.prop.
BEST_FIRST walk for 40000 steps (3829 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3819 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 170
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 300
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :300 after 542
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :542 after 1485
Probably explored full state space saw : 24496 states, properties seen :1
Probabilistic random walk after 58102 steps, saw 24496 distinct states, run finished after 245 ms. (steps per millisecond=237 ) properties seen :1
Explored full state space saw : 24531 states, properties seen :0
Exhaustive walk after 58137 steps, saw 24531 distinct states, run finished after 113 ms. (steps per millisecond=514 ) properties seen :0
ITS runner timed out or was interrupted.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1485 after 4933
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 32047 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[4]
// Phase 1: matrix 221 rows 142 cols
[2025-05-30 10:53:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2314 resets) in 33 ms. (294 steps per ms)
BEST_FIRST walk for 10000 steps (969 resets) in 16 ms. (588 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:53:48] [INFO ] Invariant cache hit.
[2025-05-30 10:53:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:53:48] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-05-30 10:53:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:53:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:53:49] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-05-30 10:53:49] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 10:53:49] [INFO ] [Nat]Added 86 Read/Feed constraints in 71 ms returned sat
[2025-05-30 10:53:49] [INFO ] Computed and/alt/rep : 54/134/54 causal constraints (skipped 166 transitions) in 24 ms.
[2025-05-30 10:53:49] [INFO ] Added : 14 causal constraints over 3 iterations in 121 ms. Result :sat
Minimization took 175 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 221/221 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 138 transition count 216
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 138 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 138 transition count 215
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 134 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 134 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 134 transition count 202
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 22 place count 131 transition count 185
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 131 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 130 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 129 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 129 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 128 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 127 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 127 transition count 180
Applied a total of 33 rules in 37 ms. Remains 127 /142 variables (removed 15) and now considering 180/221 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 127/142 places, 180/221 transitions.
// Phase 1: matrix 180 rows 127 cols
[2025-05-30 10:53:49] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (230155 resets) in 1699 ms. (588 steps per ms)
BEST_FIRST walk for 1000000 steps (95608 resets) in 698 ms. (1430 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 10:53:52] [INFO ] Invariant cache hit.
[2025-05-30 10:53:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:53:52] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-30 10:53:52] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-30 10:53:52] [INFO ] [Real]Added 59 Read/Feed constraints in 25 ms returned sat
[2025-05-30 10:53:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:53:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:53:52] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-30 10:53:52] [INFO ] [Nat]Added 59 Read/Feed constraints in 29 ms returned sat
[2025-05-30 10:53:52] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 14 ms.
[2025-05-30 10:53:52] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2025-05-30 10:53:52] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 2 ms to minimize.
[2025-05-30 10:53:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2025-05-30 10:53:52] [INFO ] Added : 17 causal constraints over 5 iterations in 352 ms. Result :sat
Minimization took 108 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-05-30 10:53:52] [INFO ] Invariant cache hit.
[2025-05-30 10:53:53] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-30 10:53:53] [INFO ] Invariant cache hit.
[2025-05-30 10:53:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-30 10:53:53] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2025-05-30 10:53:53] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2025-05-30 10:53:53] [INFO ] Invariant cache hit.
[2025-05-30 10:53:53] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 59/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 188 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7472 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 59/188 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 179/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 367 constraints, problems are : Problem set: 0 solved, 179 unsolved in 18069 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 25810ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 25812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26441 ms. Remains : 127/127 places, 180/180 transitions.
[2025-05-30 10:54:19] [INFO ] Flatten gal took : 25 ms
[2025-05-30 10:54:19] [INFO ] Flatten gal took : 12 ms
[2025-05-30 10:54:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality870950757844068320.gal : 2 ms
[2025-05-30 10:54:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3414985414615476846.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality870950757844068320.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3414985414615476846.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
RANDOM walk for 40000 steps (9216 resets) in 136 ms. (291 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3414985414615476846.prop.
BEST_FIRST walk for 40001 steps (3950 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 170
BEST_FIRST walk for 40003 steps (3857 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :170 after 276
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :276 after 554
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :554 after 1458
Probably explored full state space saw : 25155 states, properties seen :1
Probabilistic random walk after 59766 steps, saw 25155 distinct states, run finished after 155 ms. (steps per millisecond=385 ) properties seen :1
Explored full state space saw : 25195 states, properties seen :0
Exhaustive walk after 59806 steps, saw 25195 distinct states, run finished after 68 ms. (steps per millisecond=879 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[4]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-13 in 30992 ms.
[2025-05-30 10:54:19] [INFO ] Flatten gal took : 12 ms
[2025-05-30 10:54:19] [INFO ] Applying decomposition
[2025-05-30 10:54:19] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9665308513976587126.txt' '-o' '/tmp/graph9665308513976587126.bin' '-w' '/tmp/graph9665308513976587126.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9665308513976587126.bin' '-l' '-1' '-v' '-w' '/tmp/graph9665308513976587126.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:54:20] [INFO ] Decomposing Gal with order
[2025-05-30 10:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:54:20] [INFO ] Removed a total of 259 redundant transitions.
[2025-05-30 10:54:20] [INFO ] Flatten gal took : 86 ms
[2025-05-30 10:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 18 ms.
[2025-05-30 10:54:20] [INFO ] Time to serialize gal into /tmp/UpperBounds5783368866722756488.gal : 7 ms
[2025-05-30 10:54:20] [INFO ] Time to serialize properties into /tmp/UpperBounds14228658386237247066.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds5783368866722756488.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14228658386237247066.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds14228658386237247066.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,29964,0.617782,16512,916,667,18162,7835,578,34277,198,25122,0
Total reachable state count : 29964

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-00 :0 <= u5.l1628 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-00,0,0.657486,16512,1,0,18162,7835,708,34277,239,25122,873
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-02 :0 <= i3.u11.l2331 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-02,0,0.658655,16512,1,0,18162,7835,735,34277,246,25122,1031
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-05 :0 <= i1.u14.p329 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-05,0,0.659207,16512,1,0,18162,7835,757,34277,257,25122,1070
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-08 :0 <= i3.u15.p260 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-08,0,0.661211,16512,1,0,18162,7835,778,34277,271,25122,1165
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-10 :0 <= i1.u14.p242 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-10,0,0.661674,16512,1,0,18162,7835,796,34277,271,25122,1199
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-13 :0 <= i1.u12.l2532 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m04-UpperBounds-13,0,0.662149,16512,1,0,18162,7835,817,34277,276,25122,1242
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 299569 ms.

BK_STOP 1748602461061

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="DBSingleClientW-PT-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DBSingleClientW-PT-d2m04, 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 r069-smll-174854075800015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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