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-174854075800018.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-d2m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 4.0K 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-d2m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748602871143

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-d2m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:01:13] [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 11:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:01:14] [INFO ] Load time of PNML (sax parser for PT used): 420 ms
[2025-05-30 11:01:14] [INFO ] Transformed 4763 places.
[2025-05-30 11:01:14] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:01:14] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 822 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Deduced a syphon composed of 3580 places in 36 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2025-05-30 11:01:15] [INFO ] Computed 6 invariants in 265 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 2664, 7]
RANDOM walk for 10000 steps (2301 resets) in 624 ms. (16 steps per ms)
BEST_FIRST walk for 30001 steps (2800 resets) in 301 ms. (99 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 0, 0] Max Struct:[7, 2664, 7]
[2025-05-30 11:01:16] [INFO ] Invariant cache hit.
[2025-05-30 11:01:16] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2025-05-30 11:01:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 11:01:18] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2025-05-30 11:01:18] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2025-05-30 11:01:19] [INFO ] [Real]Added 1588 Read/Feed constraints in 1199 ms returned sat
[2025-05-30 11:01:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 19 ms returned sat
[2025-05-30 11:01:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2025-05-30 11:01:21] [INFO ] [Nat]Absence check using state equation in 1295 ms returned sat
[2025-05-30 11:01:22] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1187 ms returned sat
[2025-05-30 11:01:23] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 946 ms.
[2025-05-30 11:01:24] [INFO ] Added : 1 causal constraints over 1 iterations in 1607 ms. Result :sat
Minimization took 478 ms.
[2025-05-30 11:01:25] [INFO ] [Real]Absence check using 2 positive place invariants in 25 ms returned sat
[2025-05-30 11:01:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2025-05-30 11:01:26] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2025-05-30 11:01:27] [INFO ] [Real]Added 1588 Read/Feed constraints in 1383 ms returned sat
[2025-05-30 11:01:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2025-05-30 11:01:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2025-05-30 11:01:29] [INFO ] [Nat]Absence check using state equation in 1049 ms returned sat
[2025-05-30 11:01:31] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 11:01:31] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2210 ms returned sat
[2025-05-30 11:01:32] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 703 ms.
[2025-05-30 11:01:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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 11:01:33] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2025-05-30 11:01:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2025-05-30 11:01:34] [INFO ] [Real]Absence check using state equation in 1217 ms returned sat
[2025-05-30 11:01:36] [INFO ] [Real]Added 1588 Read/Feed constraints in 1727 ms returned sat
[2025-05-30 11:01:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2025-05-30 11:01:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2025-05-30 11:01:38] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2025-05-30 11:01:40] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1830 ms returned sat
[2025-05-30 11:01:42] [INFO ] Deduced a trap composed of 556 places in 2159 ms of which 184 ms to minimize.
[2025-05-30 11:01:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[2, 0, 0] Max Struct:[7, 2664, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 0, 0] Max Struct:[7, 2664, 7]
Support contains 3 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.18 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 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1322 place count 431 transition count 877
Iterating global reduction 2 with 315 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1889 place count 191 transition count 524
Iterating global reduction 3 with 240 rules applied. Total rules applied 2129 place count 191 transition count 524
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2340 place count 191 transition count 313
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2364 place count 167 transition count 275
Iterating global reduction 4 with 24 rules applied. Total rules applied 2388 place count 167 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2394 place count 167 transition count 269
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2411 place count 150 transition count 252
Iterating global reduction 5 with 17 rules applied. Total rules applied 2428 place count 150 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2432 place count 150 transition count 248
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2446 place count 136 transition count 234
Iterating global reduction 6 with 14 rules applied. Total rules applied 2460 place count 136 transition count 234
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2473 place count 136 transition count 221
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2480 place count 129 transition count 184
Iterating global reduction 7 with 7 rules applied. Total rules applied 2487 place count 129 transition count 184
Applied a total of 2487 rules in 514 ms. Remains 129 /1183 variables (removed 1054) and now considering 184/2478 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 535 ms. Remains : 129/1183 places, 184/2478 transitions.
// Phase 1: matrix 184 rows 129 cols
[2025-05-30 11:01:42] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 0] Max Struct:[7, 2664, 7]
RANDOM walk for 1000000 steps (230244 resets) in 1842 ms. (542 steps per ms)
BEST_FIRST walk for 3000001 steps (287883 resets) in 2510 ms. (1194 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0, 1] Max Struct:[7, 2664, 7]
[2025-05-30 11:01:47] [INFO ] Invariant cache hit.
[2025-05-30 11:01:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:01:47] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2025-05-30 11:01:47] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 11:01:47] [INFO ] [Real]Added 61 Read/Feed constraints in 14 ms returned sat
[2025-05-30 11:01:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:01:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-30 11:01:47] [INFO ] [Nat]Added 61 Read/Feed constraints in 12 ms returned sat
[2025-05-30 11:01:47] [INFO ] Computed and/alt/rep : 50/121/50 causal constraints (skipped 133 transitions) in 19 ms.
[2025-05-30 11:01:47] [INFO ] Added : 1 causal constraints over 1 iterations in 51 ms. Result :sat
Minimization took 134 ms.
[2025-05-30 11:01:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:01:47] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-30 11:01:48] [INFO ] [Real]Added 61 Read/Feed constraints in 31 ms returned sat
[2025-05-30 11:01:48] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:01:48] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2025-05-30 11:01:48] [INFO ] [Nat]Added 61 Read/Feed constraints in 38 ms returned sat
[2025-05-30 11:01:48] [INFO ] Computed and/alt/rep : 50/121/50 causal constraints (skipped 133 transitions) in 20 ms.
[2025-05-30 11:01:48] [INFO ] Added : 10 causal constraints over 2 iterations in 102 ms. Result :sat
Minimization took 146 ms.
[2025-05-30 11:01:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:01:48] [INFO ] [Real]Absence check using state equation in 79 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0, 1] Max Struct:[7, 2664, 1]
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0] Max Struct:[7, 2664]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 126 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 125 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 125 transition count 178
Applied a total of 9 rules in 46 ms. Remains 125 /129 variables (removed 4) and now considering 178/184 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 125/129 places, 178/184 transitions.
// Phase 1: matrix 178 rows 125 cols
[2025-05-30 11:01:48] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 0] Max Struct:[7, 2664]
RANDOM walk for 1000000 steps (230213 resets) in 1647 ms. (606 steps per ms)
BEST_FIRST walk for 2000002 steps (192049 resets) in 1517 ms. (1317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 0] Max Struct:[7, 2664]
[2025-05-30 11:01:51] [INFO ] Invariant cache hit.
[2025-05-30 11:01:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:01:51] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2025-05-30 11:01:51] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:01:52] [INFO ] [Real]Added 57 Read/Feed constraints in 14 ms returned sat
[2025-05-30 11:01:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Nat]Added 57 Read/Feed constraints in 15 ms returned sat
[2025-05-30 11:01:52] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 17 ms.
[2025-05-30 11:01:52] [INFO ] Added : 1 causal constraints over 1 iterations in 47 ms. Result :sat
Minimization took 83 ms.
[2025-05-30 11:01:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Real]Added 57 Read/Feed constraints in 24 ms returned sat
[2025-05-30 11:01:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:01:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2025-05-30 11:01:52] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2025-05-30 11:01:52] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 26 ms.
[2025-05-30 11:01:52] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 3 ms to minimize.
[2025-05-30 11:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2025-05-30 11:01:52] [INFO ] Added : 16 causal constraints over 5 iterations in 264 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 0] Max Struct:[7, 2664]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 0] Max Struct:[7, 2664]
Support contains 2 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 7 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 8 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 9 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 11:01:53] [INFO ] Invariant cache hit.
[2025-05-30 11:01:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-05-30 11:01:53] [INFO ] Invariant cache hit.
[2025-05-30 11:01:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:01:53] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2025-05-30 11:01:53] [INFO ] Redundant transitions in 6 ms returned []
Running 177 sub problems to find dead transitions.
[2025-05-30 11:01:53] [INFO ] Invariant cache hit.
[2025-05-30 11:01:53] [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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 8167 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 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, 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
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 18386 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 27142ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 27157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27798 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9240 resets) in 1811 ms. (22 steps per ms) remains 4/4 properties
[2025-05-30 11:02:21] [INFO ] Flatten gal took : 206 ms
BEST_FIRST walk for 40003 steps (3755 resets) in 639 ms. (62 steps per ms) remains 4/4 properties
[2025-05-30 11:02:21] [INFO ] Flatten gal took : 109 ms
[2025-05-30 11:02:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12857034895866382051.gal : 29 ms
BEST_FIRST walk for 40002 steps (3894 resets) in 557 ms. (71 steps per ms) remains 4/4 properties
[2025-05-30 11:02:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12936635480717316709.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/ReachabilityCardinality12857034895866382051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12936635480717316709.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 ...330
Loading property file /tmp/ReachabilityCardinality12936635480717316709.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40003 steps (3832 resets) in 404 ms. (98 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :294 after 522
BEST_FIRST walk for 40002 steps (4006 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :522 after 1188
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1188 after 4034
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :4034 after 13985
Invariant property MIN0 does not hold.
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :13985 after 96562
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :96562 after 146894
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :146894 after 862102
Interrupted probabilistic random walk after 546142 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :1 out of 4
Probabilistic random walk after 546142 steps, saw 230530 distinct states, run finished after 3009 ms. (steps per millisecond=181 ) properties seen :1
[2025-05-30 11:02:25] [INFO ] Invariant cache hit.
[2025-05-30 11:02:25] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 140/147 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 69/216 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 50/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 15/231 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX1 is UNSAT
At refinement iteration 12 (OVERLAPS) 72/303 variables, 54/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 41/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2025-05-30 11:02:25] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 15 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 185 constraints, problems are : Problem set: 2 solved, 0 unsolved in 468 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 479ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[4, 0] Max Struct:[7, 2664]
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11
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]
[2025-05-30 11:02:25] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2286 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (956 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[7]
[2025-05-30 11:02:25] [INFO ] Invariant cache hit.
[2025-05-30 11:02:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:02:25] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2025-05-30 11:02:25] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:02:25] [INFO ] [Real]Added 57 Read/Feed constraints in 20 ms returned sat
[2025-05-30 11:02:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:02:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:02:26] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2025-05-30 11:02:26] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2025-05-30 11:02:26] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 25 ms.
[2025-05-30 11:02:26] [INFO ] Added : 1 causal constraints over 1 iterations in 89 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[7]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 124 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 124 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 123 transition count 168
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 123 transition count 168
Applied a total of 5 rules in 27 ms. Remains 123 /125 variables (removed 2) and now considering 168/178 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 123/125 places, 168/178 transitions.
// Phase 1: matrix 168 rows 123 cols
[2025-05-30 11:02:26] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[7]
RANDOM walk for 1000000 steps (229524 resets) in 1576 ms. (634 steps per ms)
BEST_FIRST walk for 1000001 steps (96295 resets) in 671 ms. (1488 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2025-05-30 11:02:28] [INFO ] Invariant cache hit.
[2025-05-30 11:02:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:02:28] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-30 11:02:28] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 11:02:28] [INFO ] [Real]Added 49 Read/Feed constraints in 10 ms returned sat
[2025-05-30 11:02:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:02:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:02:28] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-05-30 11:02:28] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2025-05-30 11:02:28] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 13 ms.
[2025-05-30 11:02:28] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] 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 6 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 7 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 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2025-05-30 11:02:29] [INFO ] Invariant cache hit.
[2025-05-30 11:02:29] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-30 11:02:29] [INFO ] Invariant cache hit.
[2025-05-30 11:02:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 11:02:29] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2025-05-30 11:02:29] [INFO ] Redundant transitions in 9 ms returned []
Running 167 sub problems to find dead transitions.
[2025-05-30 11:02:29] [INFO ] Invariant cache hit.
[2025-05-30 11:02:29] [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
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10403 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 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, 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
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 15429 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 26272ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 26277ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27028 ms. Remains : 123/123 places, 168/168 transitions.
[2025-05-30 11:02:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (229703 resets) in 1415 ms. (706 steps per ms)
BEST_FIRST walk for 1000000 steps (96065 resets) in 650 ms. (1536 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2025-05-30 11:02:58] [INFO ] Invariant cache hit.
[2025-05-30 11:02:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:02:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-05-30 11:02:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 11:02:58] [INFO ] [Real]Added 49 Read/Feed constraints in 13 ms returned sat
[2025-05-30 11:02:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:02:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:02:58] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2025-05-30 11:02:58] [INFO ] [Nat]Added 49 Read/Feed constraints in 14 ms returned sat
[2025-05-30 11:02:58] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 15 ms.
[2025-05-30 11:02:58] [INFO ] Added : 1 causal constraints over 1 iterations in 50 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] 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 6 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 6 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 11:02:58] [INFO ] Invariant cache hit.
[2025-05-30 11:02:58] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-30 11:02:58] [INFO ] Invariant cache hit.
[2025-05-30 11:02:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 11:02:59] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2025-05-30 11:02:59] [INFO ] Redundant transitions in 13 ms returned []
Running 167 sub problems to find dead transitions.
[2025-05-30 11:02:59] [INFO ] Invariant cache hit.
[2025-05-30 11:02:59] [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
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/291 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 174 constraints, problems are : Problem set: 0 solved, 167 unsolved in 10160 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 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, 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
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 167/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/291 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 341 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14762 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
After SMT, in 25354ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 25360ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25971 ms. Remains : 123/123 places, 168/168 transitions.
[2025-05-30 11:03:24] [INFO ] Flatten gal took : 38 ms
RANDOM walk for 40000 steps (9206 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
[2025-05-30 11:03:24] [INFO ] Flatten gal took : 36 ms
BEST_FIRST walk for 40003 steps (3816 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
[2025-05-30 11:03:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8262304567028967702.gal : 24 ms
[2025-05-30 11:03:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10463935824045826930.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/ReachabilityCardinality8262304567028967702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10463935824045826930.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40003 steps (3918 resets) in 98 ms. (404 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 ...329
Loading property file /tmp/ReachabilityCardinality10463935824045826930.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 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 522
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :522 after 1188
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1188 after 4066
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4066 after 19142
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :19142 after 80492
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :80492 after 465718
Interrupted probabilistic random walk after 682480 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 2
Probabilistic random walk after 682480 steps, saw 287914 distinct states, run finished after 3002 ms. (steps per millisecond=227 ) properties seen :0
[2025-05-30 11:03:27] [INFO ] Invariant cache hit.
[2025-05-30 11:03:27] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/132 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 72/204 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/219 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/291 variables, 54/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 41/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-30 11:03:28] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 3 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 291/291 variables, and 175 constraints, problems are : Problem set: 1 solved, 0 unsolved in 259 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/123 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 268ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[4] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 62448 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12
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:[2664]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[2664]
// Phase 1: matrix 178 rows 125 cols
[2025-05-30 11:03:28] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2664]
RANDOM walk for 10000 steps (2289 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10000 steps (944 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2664]
[2025-05-30 11:03:28] [INFO ] Invariant cache hit.
[2025-05-30 11:03:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:03:28] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 11:03:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:03:28] [INFO ] [Real]Added 57 Read/Feed constraints in 28 ms returned sat
[2025-05-30 11:03:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:03:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:03:28] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-30 11:03:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 19 ms returned sat
[2025-05-30 11:03:28] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 14 ms.
[2025-05-30 11:03:28] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 3 ms to minimize.
[2025-05-30 11:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2025-05-30 11:03:28] [INFO ] Added : 16 causal constraints over 5 iterations in 247 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2664]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2664]
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 6 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 7 ms. Remains : 125/125 places, 178/178 transitions.
[2025-05-30 11:03:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[2664]
RANDOM walk for 1000000 steps (229793 resets) in 2056 ms. (486 steps per ms)
BEST_FIRST walk for 1000001 steps (95897 resets) in 711 ms. (1404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[2664]
[2025-05-30 11:03:31] [INFO ] Invariant cache hit.
[2025-05-30 11:03:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 11:03:31] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2025-05-30 11:03:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:03:31] [INFO ] [Real]Added 57 Read/Feed constraints in 20 ms returned sat
[2025-05-30 11:03:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:03:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:03:31] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2025-05-30 11:03:31] [INFO ] [Nat]Added 57 Read/Feed constraints in 28 ms returned sat
[2025-05-30 11:03:31] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 18 ms.
[2025-05-30 11:03:32] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-05-30 11:03:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-05-30 11:03:32] [INFO ] Added : 16 causal constraints over 5 iterations in 270 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[2664]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[2664]
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 9 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 9 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 9 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 11:03:32] [INFO ] Invariant cache hit.
[2025-05-30 11:03:32] [INFO ] Implicit Places using invariants in 236 ms returned []
[2025-05-30 11:03:32] [INFO ] Invariant cache hit.
[2025-05-30 11:03:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 11:03:33] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2025-05-30 11:03:33] [INFO ] Redundant transitions in 3 ms returned []
Running 177 sub problems to find dead transitions.
[2025-05-30 11:03:33] [INFO ] Invariant cache hit.
[2025-05-30 11:03:33] [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
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9145 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 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, 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
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 18197 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 27761ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 27765ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28680 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9186 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
[2025-05-30 11:04:01] [INFO ] Flatten gal took : 69 ms
BEST_FIRST walk for 40003 steps (3878 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2025-05-30 11:04:01] [INFO ] Flatten gal took : 61 ms
[2025-05-30 11:04:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8370920095460038182.gal : 21 ms
[2025-05-30 11:04:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5101244953829491540.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/ReachabilityCardinality8370920095460038182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5101244953829491540.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
BEST_FIRST walk for 40003 steps (3875 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality5101244953829491540.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 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 522
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :522 after 1188
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1188 after 4034
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4034 after 13985
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :13985 after 96562
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :96562 after 478465
Interrupted probabilistic random walk after 1693498 steps, run timeout after 3001 ms. (steps per millisecond=564 ) properties seen :1 out of 2
Probabilistic random walk after 1693498 steps, saw 706849 distinct states, run finished after 3001 ms. (steps per millisecond=564 ) properties seen :1
[2025-05-30 11:04:04] [INFO ] Invariant cache hit.
[2025-05-30 11:04:04] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/135 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 71/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 131 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 144ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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:[2664]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12 in 36423 ms.
[2025-05-30 11:04:04] [INFO ] Flatten gal took : 16 ms
[2025-05-30 11:04:04] [INFO ] Applying decomposition
[2025-05-30 11:04:04] [INFO ] Flatten gal took : 15 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/graph5263376101752735924.txt' '-o' '/tmp/graph5263376101752735924.bin' '-w' '/tmp/graph5263376101752735924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5263376101752735924.bin' '-l' '-1' '-v' '-w' '/tmp/graph5263376101752735924.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:04:04] [INFO ] Decomposing Gal with order
[2025-05-30 11:04:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:04:04] [INFO ] Removed a total of 175 redundant transitions.
[2025-05-30 11:04:04] [INFO ] Flatten gal took : 123 ms
[2025-05-30 11:04:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 133 labels/synchronizations in 26 ms.
[2025-05-30 11:04:05] [INFO ] Time to serialize gal into /tmp/UpperBounds5727783020424363982.gal : 10 ms
[2025-05-30 11:04:05] [INFO ] Time to serialize properties into /tmp/UpperBounds1221603515095850801.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/UpperBounds5727783020424363982.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1221603515095850801.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 ...283
Loading property file /tmp/UpperBounds1221603515095850801.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,9.93367e+06,4.64052,83072,1707,1410,77154,10106,497,404704,224,181788,0
Total reachable state count : 9933674

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-11 :0 <= i1.u6.l3686 <= 5
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 5 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-d2m07-UpperBounds-11,0,4.93013,83072,1,0,77154,10106,613,404704,263,181788,1237
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-12 :0 <= i4.u7.l1628 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 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-d2m07-UpperBounds-12,0,4.94477,83072,1,0,77154,10106,643,404704,280,181788,1372
Total runtime 176178 ms.

BK_STOP 1748603050140

--------------------
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-d2m07"
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-d2m07, 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-174854075800018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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