Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189600573.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
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 r092-tall-171624189600573
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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

here is the order used to build the result vector(from text 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 1716328070202

Invoking MCC driver with
BK_TOOL=itstools
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
[2024-05-21 21:47:51] [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]
[2024-05-21 21:47:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:47:51] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-05-21 21:47:51] [INFO ] Transformed 4763 places.
[2024-05-21 21:47:51] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:47:51] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 24 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-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-12 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, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:47:51] [INFO ] Computed 6 invariants in 151 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 10000 steps (2320 resets) in 368 ms. (27 steps per ms)
BEST_FIRST walk for 40003 steps (3846 resets) in 230 ms. (173 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 21:47:52] [INFO ] Invariant cache hit.
[2024-05-21 21:47:52] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2024-05-21 21:47:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 43 ms returned sat
[2024-05-21 21:47:53] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2024-05-21 21:47:54] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:47:54] [INFO ] [Real]Added 1588 Read/Feed constraints in 693 ms returned sat
[2024-05-21 21:47:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:47:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:47:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:47:55] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2024-05-21 21:47:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 976 ms returned sat
[2024-05-21 21:47:57] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 645 ms.
[2024-05-21 21:47:59] [INFO ] Deduced a trap composed of 48 places in 803 ms of which 69 ms to minimize.
[2024-05-21 21:48:00] [INFO ] Deduced a trap composed of 51 places in 708 ms of which 12 ms to minimize.
[2024-05-21 21:48:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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)
[2024-05-21 21:48:00] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:48:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:48:01] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2024-05-21 21:48:01] [INFO ] [Real]Added 1588 Read/Feed constraints in 795 ms returned sat
[2024-05-21 21:48:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 21:48:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:48:02] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2024-05-21 21:48:03] [INFO ] [Nat]Added 1588 Read/Feed constraints in 777 ms returned sat
[2024-05-21 21:48:04] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 646 ms.
[2024-05-21 21:48:04] [INFO ] Added : 1 causal constraints over 1 iterations in 927 ms. Result :sat
Minimization took 654 ms.
[2024-05-21 21:48:05] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 21:48:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:48:05] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2024-05-21 21:48:06] [INFO ] [Real]Added 1588 Read/Feed constraints in 769 ms returned sat
[2024-05-21 21:48:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:48:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:48:07] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-21 21:48:08] [INFO ] [Nat]Added 1588 Read/Feed constraints in 885 ms returned sat
[2024-05-21 21:48:08] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 384 ms.
[2024-05-21 21:48:10] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 8 ms to minimize.
[2024-05-21 21:48:11] [INFO ] Deduced a trap composed of 56 places in 686 ms of which 8 ms to minimize.
[2024-05-21 21:48:12] [INFO ] Deduced a trap composed of 31 places in 717 ms of which 8 ms to minimize.
[2024-05-21 21:48:12] [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.refineWithCausalOrder(DeadlockTester.java:1128)
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)
[2024-05-21 21:48:12] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:48:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:48:13] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2024-05-21 21:48:14] [INFO ] [Real]Added 1588 Read/Feed constraints in 736 ms returned sat
[2024-05-21 21:48:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:48:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 21:48:14] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2024-05-21 21:48:16] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1102 ms returned sat
[2024-05-21 21:48:16] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 403 ms.
[2024-05-21 21:48:17] [INFO ] Deduced a trap composed of 41 places in 672 ms of which 8 ms to minimize.
[2024-05-21 21:48:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 874 ms
[2024-05-21 21:48:18] [INFO ] Added : 15 causal constraints over 3 iterations in 2051 ms. Result :sat
Minimization took 657 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 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.8 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 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1319 place count 433 transition count 879
Iterating global reduction 2 with 314 rules applied. Total rules applied 1633 place count 433 transition count 879
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1645 place count 433 transition count 867
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1884 place count 194 transition count 531
Iterating global reduction 3 with 239 rules applied. Total rules applied 2123 place count 194 transition count 531
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2334 place count 194 transition count 320
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2358 place count 170 transition count 281
Iterating global reduction 4 with 24 rules applied. Total rules applied 2382 place count 170 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2388 place count 170 transition count 275
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2404 place count 154 transition count 259
Iterating global reduction 5 with 16 rules applied. Total rules applied 2420 place count 154 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2424 place count 154 transition count 255
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2437 place count 141 transition count 242
Iterating global reduction 6 with 13 rules applied. Total rules applied 2450 place count 141 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2460 place count 141 transition count 232
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2463 place count 138 transition count 223
Iterating global reduction 7 with 3 rules applied. Total rules applied 2466 place count 138 transition count 223
Applied a total of 2466 rules in 263 ms. Remains 138 /1183 variables (removed 1045) and now considering 223/2478 (removed 2255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 275 ms. Remains : 138/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:48:19] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (229585 resets) in 1467 ms. (681 steps per ms)
BEST_FIRST walk for 4000001 steps (383289 resets) in 2760 ms. (1448 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 21:48:23] [INFO ] Invariant cache hit.
[2024-05-21 21:48:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:48:23] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:48:23] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Nat]Added 91 Read/Feed constraints in 21 ms returned sat
[2024-05-21 21:48:23] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 12 ms.
[2024-05-21 21:48:23] [INFO ] Added : 12 causal constraints over 3 iterations in 82 ms. Result :sat
Minimization took 149 ms.
[2024-05-21 21:48:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:23] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:48:24] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:48:24] [INFO ] Added : 1 causal constraints over 1 iterations in 43 ms. Result :sat
Minimization took 139 ms.
[2024-05-21 21:48:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Real]Added 91 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:48:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:48:24] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 17 ms.
[2024-05-21 21:48:24] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 21:48:24] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:48:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-21 21:48:24] [INFO ] Added : 14 causal constraints over 4 iterations in 282 ms. Result :sat
Minimization took 155 ms.
[2024-05-21 21:48:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:48:24] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:48:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:25] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:48:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:48:25] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 16 ms.
[2024-05-21 21:48:25] [INFO ] Added : 15 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 156 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 22 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 138/138 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-21 21:48:25] [INFO ] Invariant cache hit.
[2024-05-21 21:48:25] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:48:25] [INFO ] Invariant cache hit.
[2024-05-21 21:48:25] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:48:25] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2024-05-21 21:48:25] [INFO ] Redundant transitions in 9 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 21:48:25] [INFO ] Invariant cache hit.
[2024-05-21 21:48:26] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 231 constraints, problems are : Problem set: 0 solved, 222 unsolved in 8108 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 453 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14509 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 23039ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 23050ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23533 ms. Remains : 138/138 places, 223/223 transitions.
[2024-05-21 21:48:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
RANDOM walk for 1000000 steps (229899 resets) in 1412 ms. (707 steps per ms)
BEST_FIRST walk for 4000001 steps (382689 resets) in 2575 ms. (1552 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
[2024-05-21 21:48:53] [INFO ] Invariant cache hit.
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:48:53] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:48:53] [INFO ] [Real]Added 91 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 23 ms returned sat
[2024-05-21 21:48:53] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 21:48:53] [INFO ] Added : 12 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 146 ms.
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:48:53] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 16 ms.
[2024-05-21 21:48:53] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 130 ms.
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:48:53] [INFO ] [Real]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:48:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:48:54] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 16 ms.
[2024-05-21 21:48:54] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 21:48:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-21 21:48:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 184 ms
[2024-05-21 21:48:54] [INFO ] Added : 14 causal constraints over 4 iterations in 283 ms. Result :sat
Minimization took 150 ms.
[2024-05-21 21:48:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Real]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:48:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:48:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:48:54] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:48:54] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 15 ms.
[2024-05-21 21:48:54] [INFO ] Added : 15 causal constraints over 4 iterations in 84 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 8 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 138/138 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 7 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-21 21:48:55] [INFO ] Invariant cache hit.
[2024-05-21 21:48:55] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 21:48:55] [INFO ] Invariant cache hit.
[2024-05-21 21:48:55] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:48:55] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-21 21:48:55] [INFO ] Redundant transitions in 9 ms returned []
Running 222 sub problems to find dead transitions.
[2024-05-21 21:48:55] [INFO ] Invariant cache hit.
[2024-05-21 21:48:55] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 231 constraints, problems are : Problem set: 0 solved, 222 unsolved in 7892 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/137 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/138 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (OVERLAPS) 223/361 variables, 138/140 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 91/231 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 222/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 0/361 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 453 constraints, problems are : Problem set: 0 solved, 222 unsolved in 14346 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 0/0 constraints]
After SMT, in 22606ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 22609ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23072 ms. Remains : 138/138 places, 223/223 transitions.
RANDOM walk for 40000 steps (9212 resets) in 1784 ms. (22 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3756 resets) in 299 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (3755 resets) in 358 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3908 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3930 resets) in 281 ms. (141 steps per ms) remains 8/8 properties
[2024-05-21 21:49:19] [INFO ] Flatten gal took : 146 ms
BEST_FIRST walk for 40003 steps (3843 resets) in 191 ms. (208 steps per ms) remains 8/8 properties
[2024-05-21 21:49:19] [INFO ] Flatten gal took : 115 ms
[2024-05-21 21:49:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7901782019464391269.gal : 10 ms
BEST_FIRST walk for 40002 steps (3773 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
[2024-05-21 21:49:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12099613915327851527.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/ReachabilityCardinality7901782019464391269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12099613915327851527.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40000 steps (3777 resets) in 144 ms. (275 steps per ms) remains 8/8 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/ReachabilityCardinality12099613915327851527.prop.
BEST_FIRST walk for 40001 steps (3689 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :68 after 122
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :122 after 218
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :218 after 408
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :408 after 722
Invariant property MIN1 does not hold.
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :722 after 8814
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :8814 after 32048
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :32048 after 47094
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :47094 after 109454
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :109454 after 225056
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :225056 after 869678
Interrupted probabilistic random walk after 717418 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :3 out of 8
Probabilistic random walk after 717418 steps, saw 288691 distinct states, run finished after 3004 ms. (steps per millisecond=238 ) properties seen :3
[2024-05-21 21:49:22] [INFO ] Invariant cache hit.
[2024-05-21 21:49:22] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 93/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 144/241 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
At refinement iteration 5 (OVERLAPS) 113/354 variables, 37/136 constraints. Problems are: Problem set: 3 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 88/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/224 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/361 variables, 4/228 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 3/231 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-21 21:49:23] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 361/361 variables, and 232 constraints, problems are : Problem set: 4 solved, 0 unsolved in 1142 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 138/138 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 1161ms problems are : Problem set: 4 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, 4, 0, 0] Max Struct:[7, 7, 7, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04
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]
[2024-05-21 21:49:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2302 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (905 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:49:23] [INFO ] Invariant cache hit.
[2024-05-21 21:49:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:24] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-21 21:49:24] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:49:24] [INFO ] [Real]Added 91 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:49:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:49:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:24] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-21 21:49:24] [INFO ] [Nat]Added 91 Read/Feed constraints in 38 ms returned sat
[2024-05-21 21:49:24] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 20 ms.
[2024-05-21 21:49:24] [INFO ] Added : 12 causal constraints over 3 iterations in 107 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 132 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 130 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 129 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 129 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 126 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 126 transition count 180
Applied a total of 28 rules in 23 ms. Remains 126 /138 variables (removed 12) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 21:49:24] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230004 resets) in 1241 ms. (805 steps per ms)
BEST_FIRST walk for 1000001 steps (95630 resets) in 509 ms. (1960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:49:26] [INFO ] Invariant cache hit.
[2024-05-21 21:49:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:26] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:49:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:49:26] [INFO ] [Real]Added 58 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:49:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:49:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:49:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:49:26] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:49:26] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 14 ms.
[2024-05-21 21:49:26] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-05-21 21:49:26] [INFO ] Added : 19 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 21:49:27] [INFO ] Invariant cache hit.
[2024-05-21 21:49:27] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:49:27] [INFO ] Invariant cache hit.
[2024-05-21 21:49:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:49:27] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-21 21:49:27] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 21:49:27] [INFO ] Invariant cache hit.
[2024-05-21 21:49:27] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4457 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 12081 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 16838ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 16840ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17227 ms. Remains : 126/126 places, 180/180 transitions.
[2024-05-21 21:49:44] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:49:44] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:49:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5721896527312092736.gal : 40 ms
[2024-05-21 21:49:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10160787929894802626.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/ReachabilityCardinality5721896527312092736.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10160787929894802626.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9081 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3817 resets) in 30 ms. (1290 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
BEST_FIRST walk for 40003 steps (3890 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10160787929894802626.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 492
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :492 after 990
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :990 after 3821
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3821 after 9572
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9572 after 59186
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :59186 after 191800
Interrupted probabilistic random walk after 2094908 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :1 out of 2
Probabilistic random walk after 2094908 steps, saw 864245 distinct states, run finished after 3001 ms. (steps per millisecond=698 ) properties seen :1
[2024-05-21 21:49:47] [INFO ] Invariant cache hit.
[2024-05-21 21:49:47] [INFO ] State equation strengthened by 58 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) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 131/221 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 297/306 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 189 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms 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:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04 in 23770 ms.
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]
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:49:47] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2291 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (1008 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[7]
[2024-05-21 21:49:47] [INFO ] Invariant cache hit.
[2024-05-21 21:49:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:47] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:49:47] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:49:47] [INFO ] [Real]Added 91 Read/Feed constraints in 14 ms returned sat
[2024-05-21 21:49:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:49:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:47] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-21 21:49:48] [INFO ] [Nat]Added 91 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:49:48] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:49:48] [INFO ] Added : 1 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 137 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 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 135 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 132 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 129 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 127 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 126 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 123 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 123 transition count 168
Applied a total of 35 rules in 18 ms. Remains 123 /138 variables (removed 15) and now considering 168/223 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 123/138 places, 168/223 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 21:49:48] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[7]
RANDOM walk for 1000000 steps (230284 resets) in 1031 ms. (968 steps per ms)
BEST_FIRST walk for 1000001 steps (96570 resets) in 487 ms. (2049 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-21 21:49:49] [INFO ] Invariant cache hit.
[2024-05-21 21:49:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:49:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:49:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:49:49] [INFO ] [Real]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:49:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:49:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:49:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:49:49] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:49:49] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 14 ms.
[2024-05-21 21:49:49] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 54 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 11 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 11 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 8 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 21:49:50] [INFO ] Invariant cache hit.
[2024-05-21 21:49:50] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-21 21:49:50] [INFO ] Invariant cache hit.
[2024-05-21 21:49:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:49:50] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-21 21:49:50] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 21:49:50] [INFO ] Invariant cache hit.
[2024-05-21 21:49:50] [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 5924 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 9348 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 15483ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15491ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15893 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 21:50:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[7]
RANDOM walk for 1000000 steps (229683 resets) in 1034 ms. (966 steps per ms)
BEST_FIRST walk for 1000000 steps (96229 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[7]
[2024-05-21 21:50:07] [INFO ] Invariant cache hit.
[2024-05-21 21:50:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:50:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:50:07] [INFO ] [Real]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:50:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:07] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:50:07] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:50:07] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 21:50:07] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 54 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 16 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 17 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.
[2024-05-21 21:50:07] [INFO ] Invariant cache hit.
[2024-05-21 21:50:07] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-21 21:50:07] [INFO ] Invariant cache hit.
[2024-05-21 21:50:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:50:08] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 21:50:08] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-21 21:50:08] [INFO ] Invariant cache hit.
[2024-05-21 21:50:08] [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 5834 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 9180 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 15270ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 15271ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15649 ms. Remains : 123/123 places, 168/168 transitions.
RANDOM walk for 40000 steps (9219 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
[2024-05-21 21:50:23] [INFO ] Flatten gal took : 31 ms
[2024-05-21 21:50:23] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:50:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11307368934745145817.gal : 5 ms
[2024-05-21 21:50:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12585755594127692842.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/ReachabilityCardinality11307368934745145817.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12585755594127692842.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
BEST_FIRST walk for 40003 steps (3835 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12585755594127692842.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40003 steps (3902 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 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 686736 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :0 out of 2
Probabilistic random walk after 686736 steps, saw 289481 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
[2024-05-21 21:50:26] [INFO ] Invariant cache hit.
[2024-05-21 21:50:26] [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
[2024-05-21 21:50:27] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 13 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 512 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 571ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :465718 after 1.0285e+06
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 39520 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:50:27] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2313 resets) in 15 ms. (625 steps per ms)
BEST_FIRST walk for 10000 steps (927 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:50:27] [INFO ] Invariant cache hit.
[2024-05-21 21:50:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:27] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-05-21 21:50:27] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:50:27] [INFO ] [Real]Added 91 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:50:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:27] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:50:27] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:50:27] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:50:27] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 2 ms to minimize.
[2024-05-21 21:50:27] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-21 21:50:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
[2024-05-21 21:50:27] [INFO ] Added : 14 causal constraints over 4 iterations in 279 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 132 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 131 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 131 transition count 199
Applied a total of 16 rules in 23 ms. Remains 131 /138 variables (removed 7) and now considering 199/223 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 131/138 places, 199/223 transitions.
// Phase 1: matrix 199 rows 131 cols
[2024-05-21 21:50:28] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229720 resets) in 1235 ms. (809 steps per ms)
BEST_FIRST walk for 1000000 steps (95329 resets) in 571 ms. (1748 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:50:29] [INFO ] Invariant cache hit.
[2024-05-21 21:50:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:29] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:50:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:50:29] [INFO ] [Real]Added 73 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:30] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 13 ms returned sat
[2024-05-21 21:50:30] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 11 ms.
[2024-05-21 21:50:30] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:50:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-21 21:50:30] [INFO ] Added : 11 causal constraints over 3 iterations in 148 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 21:50:30] [INFO ] Invariant cache hit.
[2024-05-21 21:50:30] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:50:30] [INFO ] Invariant cache hit.
[2024-05-21 21:50:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:50:30] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 21:50:30] [INFO ] Redundant transitions in 1 ms returned []
Running 198 sub problems to find dead transitions.
[2024-05-21 21:50:30] [INFO ] Invariant cache hit.
[2024-05-21 21:50:30] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/330 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 73/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/330 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 330/330 variables, and 206 constraints, problems are : Problem set: 0 solved, 198 unsolved in 5353 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/330 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 73/206 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 198/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/330 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/330 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 330/330 variables, and 404 constraints, problems are : Problem set: 0 solved, 198 unsolved in 12764 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 131/131 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints]
After SMT, in 18384ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 18386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18750 ms. Remains : 131/131 places, 199/199 transitions.
[2024-05-21 21:50:49] [INFO ] Flatten gal took : 55 ms
RANDOM walk for 40000 steps (9174 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
[2024-05-21 21:50:49] [INFO ] Flatten gal took : 41 ms
BEST_FIRST walk for 40003 steps (3791 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
[2024-05-21 21:50:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12502477997943844601.gal : 22 ms
[2024-05-21 21:50:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8317936566104654136.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/ReachabilityCardinality12502477997943844601.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8317936566104654136.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8317936566104654136.prop.
BEST_FIRST walk for 40002 steps (3865 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 108
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :108 after 184
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :184 after 348
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :348 after 664
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :664 after 3070
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3070 after 9035
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :9035 after 64890
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :64890 after 146218
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :146218 after 876672
Interrupted probabilistic random walk after 2153784 steps, run timeout after 3001 ms. (steps per millisecond=717 ) properties seen :1 out of 2
Probabilistic random walk after 2153784 steps, saw 867499 distinct states, run finished after 3001 ms. (steps per millisecond=717 ) properties seen :1
[2024-05-21 21:50:52] [INFO ] Invariant cache hit.
[2024-05-21 21:50:52] [INFO ] State equation strengthened by 73 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) 29/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 63/93 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/229 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 321/330 variables, and 128 constraints, problems are : Problem set: 1 solved, 0 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/131 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms 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:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13 in 25215 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:50:52] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2284 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (941 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:50:52] [INFO ] Invariant cache hit.
[2024-05-21 21:50:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:52] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:50:52] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:50:52] [INFO ] [Real]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:52] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:50:52] [INFO ] [Nat]Added 91 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:50:52] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:50:52] [INFO ] Added : 15 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 149 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 131 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 127 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 127 transition count 180
Applied a total of 26 rules in 14 ms. Remains 127 /138 variables (removed 11) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 127/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 127 cols
[2024-05-21 21:50:53] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229799 resets) in 1110 ms. (900 steps per ms)
BEST_FIRST walk for 1000001 steps (95201 resets) in 515 ms. (1937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 21:50:54] [INFO ] Invariant cache hit.
[2024-05-21 21:50:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:50:54] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:50:54] [INFO ] [Real]Added 58 Read/Feed constraints in 9 ms returned sat
[2024-05-21 21:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Nat]Added 58 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:50:54] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 21:50:54] [INFO ] Added : 11 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 21:50:55] [INFO ] Invariant cache hit.
[2024-05-21 21:50:55] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:50:55] [INFO ] Invariant cache hit.
[2024-05-21 21:50:55] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:50:55] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-21 21:50:55] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 21:50:55] [INFO ] Invariant cache hit.
[2024-05-21 21:50:55] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/307 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 187 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4305 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/307 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 58/187 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 179/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 366 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10847 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 15374ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15748 ms. Remains : 127/127 places, 180/180 transitions.
[2024-05-21 21:51:10] [INFO ] Flatten gal took : 26 ms
RANDOM walk for 40000 steps (9145 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
[2024-05-21 21:51:10] [INFO ] Flatten gal took : 25 ms
BEST_FIRST walk for 40001 steps (3798 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2024-05-21 21:51:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13391641577786627582.gal : 12 ms
[2024-05-21 21:51:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13099943990191427729.prop : 18 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/ReachabilityCardinality13391641577786627582.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13099943990191427729.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (3833 resets) in 75 ms. (526 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 ...330
Loading property file /tmp/ReachabilityCardinality13099943990191427729.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 492
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :492 after 990
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :990 after 3932
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3932 after 12925
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :12925 after 62297
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :62297 after 234356
Interrupted probabilistic random walk after 2488140 steps, run timeout after 3001 ms. (steps per millisecond=829 ) properties seen :1 out of 2
Probabilistic random walk after 2488140 steps, saw 1010677 distinct states, run finished after 3001 ms. (steps per millisecond=829 ) properties seen :1
[2024-05-21 21:51:13] [INFO ] Invariant cache hit.
[2024-05-21 21:51:13] [INFO ] State equation strengthened by 58 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) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/223 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 298/307 variables, and 124 constraints, problems are : Problem set: 1 solved, 0 unsolved in 608 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/127 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 642ms 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:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15 in 22096 ms.
[2024-05-21 21:51:14] [INFO ] Flatten gal took : 14 ms
[2024-05-21 21:51:14] [INFO ] Applying decomposition
[2024-05-21 21:51:14] [INFO ] Flatten gal took : 17 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/graph3259776798728734685.txt' '-o' '/tmp/graph3259776798728734685.bin' '-w' '/tmp/graph3259776798728734685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3259776798728734685.bin' '-l' '-1' '-v' '-w' '/tmp/graph3259776798728734685.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:51:14] [INFO ] Decomposing Gal with order
[2024-05-21 21:51:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:51:14] [INFO ] Removed a total of 233 redundant transitions.
[2024-05-21 21:51:15] [INFO ] Flatten gal took : 97 ms
[2024-05-21 21:51:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 166 labels/synchronizations in 25 ms.
[2024-05-21 21:51:15] [INFO ] Time to serialize gal into /tmp/UpperBounds16229000737007779361.gal : 11 ms
[2024-05-21 21:51:15] [INFO ] Time to serialize properties into /tmp/UpperBounds5848938514959707518.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/UpperBounds16229000737007779361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5848938514959707518.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds5848938514959707518.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,1.32013e+07,29.077,715332,4603,6145,389460,384681,605,4.66453e+06,232,3.54454e+06,0
Total reachable state count : 13201298

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-04 :0 <= i4.u8.p68 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 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-04,0,29.6654,715332,1,0,389460,384681,745,4.66453e+06,271,3.54454e+06,1894
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-11 :0 <= i6.u4.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,29.9244,715332,1,0,389460,384681,774,4.66453e+06,282,3.54454e+06,2925
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-13 :0 <= i4.u12.p301 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-13,0,29.9248,715332,1,0,389460,384681,793,4.66453e+06,293,3.54454e+06,2964
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-15 :0 <= i5.u13.l2872 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 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-15,0,29.9266,715332,1,0,389460,384681,815,4.66453e+06,298,3.54454e+06,3108
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 233805 ms.

BK_STOP 1716328305222

--------------------
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r092-tall-171624189600573"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;