Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 14K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 5.7M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748899033322

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:17:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 21:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:17:16] [INFO ] Load time of PNML (sax parser for PT used): 622 ms
[2025-06-02 21:17:16] [INFO ] Transformed 6222 places.
[2025-06-02 21:17:16] [INFO ] Transformed 8685 transitions.
[2025-06-02 21:17:16] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 891 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-06-02 21:17:16] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2025-06-02 21:17:17] [INFO ] Computed 611 invariants in 817 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 51, 51, 1, 17, 17, 51, 17, 17, 17, 17, 51, 51, 51, 51]
RANDOM walk for 10000 steps (137 resets) in 209 ms. (47 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150012 steps (570 resets) in 675 ms. (221 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0] Max Struct:[1, 51, 51, 1, 17, 17, 51, 17, 17, 17, 17, 51, 51, 51, 51]
[2025-06-02 21:17:18] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
[2025-06-02 21:17:18] [INFO ] Invariant cache hit.
[2025-06-02 21:17:20] [INFO ] [Real]Absence check using 52 positive place invariants in 160 ms returned sat
[2025-06-02 21:17:21] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 415 ms returned sat
[2025-06-02 21:17:23] [INFO ] [Real]Absence check using state equation in 2761 ms returned unknown
[2025-06-02 21:17:25] [INFO ] [Real]Absence check using 52 positive place invariants in 136 ms returned sat
[2025-06-02 21:17:25] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 156 ms returned unsat
[2025-06-02 21:17:26] [INFO ] [Real]Absence check using 52 positive place invariants in 134 ms returned sat
[2025-06-02 21:17:26] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 301 ms returned sat
[2025-06-02 21:17:30] [INFO ] [Real]Absence check using state equation in 3511 ms returned unknown
[2025-06-02 21:17:31] [INFO ] [Real]Absence check using 52 positive place invariants in 140 ms returned sat
[2025-06-02 21:17:31] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 274 ms returned sat
[2025-06-02 21:17:35] [INFO ] [Real]Absence check using state equation in 3394 ms returned unknown
[2025-06-02 21:17:36] [INFO ] [Real]Absence check using 52 positive place invariants in 132 ms returned sat
[2025-06-02 21:17:36] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 166 ms returned unsat
[2025-06-02 21:17:37] [INFO ] [Real]Absence check using 52 positive place invariants in 133 ms returned sat
[2025-06-02 21:17:37] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 317 ms returned sat
[2025-06-02 21:17:41] [INFO ] [Real]Absence check using state equation in 3612 ms returned unknown
[2025-06-02 21:17:42] [INFO ] [Real]Absence check using 52 positive place invariants in 133 ms returned sat
[2025-06-02 21:17:42] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 335 ms returned sat
[2025-06-02 21:17:46] [INFO ] [Real]Absence check using state equation in 3581 ms returned unknown
[2025-06-02 21:17:47] [INFO ] [Real]Absence check using 52 positive place invariants in 132 ms returned sat
[2025-06-02 21:17:47] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 314 ms returned sat
[2025-06-02 21:17:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-02 21:17:52] [INFO ] [Real]Absence check using 52 positive place invariants in 132 ms returned sat
[2025-06-02 21:17:52] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 174 ms returned unsat
[2025-06-02 21:17:54] [INFO ] [Real]Absence check using 52 positive place invariants in 132 ms returned sat
[2025-06-02 21:17:54] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 190 ms returned unsat
[2025-06-02 21:17:55] [INFO ] [Real]Absence check using 52 positive place invariants in 131 ms returned sat
[2025-06-02 21:17:55] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 175 ms returned unsat
[2025-06-02 21:17:56] [INFO ] [Real]Absence check using 52 positive place invariants in 133 ms returned sat
[2025-06-02 21:17:56] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 320 ms returned sat
[2025-06-02 21:18:00] [INFO ] [Real]Absence check using state equation in 3614 ms returned unknown
[2025-06-02 21:18:01] [INFO ] [Real]Absence check using 52 positive place invariants in 131 ms returned sat
[2025-06-02 21:18:01] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 314 ms returned sat
[2025-06-02 21:18:05] [INFO ] [Real]Absence check using state equation in 3617 ms returned unknown
[2025-06-02 21:18:06] [INFO ] [Real]Absence check using 52 positive place invariants in 131 ms returned sat
[2025-06-02 21:18:06] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 203 ms returned unsat
[2025-06-02 21:18:07] [INFO ] [Real]Absence check using 52 positive place invariants in 133 ms returned sat
[2025-06-02 21:18:08] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 329 ms returned sat
[2025-06-02 21:18:11] [INFO ] [Real]Absence check using state equation in 3603 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0] Max Struct:[1, 1, 51, 1, 1, 17, 51, 17, 1, 1, 1, 51, 51, 1, 51]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 51, 1, 17, 51, 17, 51, 51, 51]
Support contains 9 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.32 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1897 transitions
Trivial Post-agglo rules discarded 1897 transitions
Performed 1897 trivial Post agglomeration. Transition count delta: 1897
Iterating post reduction 0 with 1897 rules applied. Total rules applied 1898 place count 6188 transition count 6788
Reduce places removed 1897 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 1902 rules applied. Total rules applied 3800 place count 4291 transition count 6783
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 3805 place count 4286 transition count 6783
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 3805 place count 4286 transition count 6545
Deduced a syphon composed of 238 places in 6 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 4281 place count 4048 transition count 6545
Discarding 1659 places :
Symmetric choice reduction at 3 with 1659 rule applications. Total rules 5940 place count 2389 transition count 4886
Iterating global reduction 3 with 1659 rules applied. Total rules applied 7599 place count 2389 transition count 4886
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 7599 place count 2389 transition count 4876
Deduced a syphon composed of 10 places in 10 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 7619 place count 2379 transition count 4876
Discarding 231 places :
Symmetric choice reduction at 3 with 231 rule applications. Total rules 7850 place count 2148 transition count 3259
Iterating global reduction 3 with 231 rules applied. Total rules applied 8081 place count 2148 transition count 3259
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 7 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 8115 place count 2131 transition count 3242
Free-agglomeration rule (complex) applied 167 times.
Iterating global reduction 3 with 167 rules applied. Total rules applied 8282 place count 2131 transition count 4461
Reduce places removed 167 places and 0 transitions.
Iterating post reduction 3 with 167 rules applied. Total rules applied 8449 place count 1964 transition count 4461
Partial Free-agglomeration rule applied 68 times.
Drop transitions (Partial Free agglomeration) removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 8517 place count 1964 transition count 4461
Applied a total of 8517 rules in 3484 ms. Remains 1964 /6222 variables (removed 4258) and now considering 4461/8685 (removed 4224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3502 ms. Remains : 1964/6222 places, 4461/8685 transitions.
[2025-06-02 21:18:15] [INFO ] Flow matrix only has 4063 transitions (discarded 398 similar events)
// Phase 1: matrix 4063 rows 1964 cols
[2025-06-02 21:18:15] [INFO ] Computed 577 invariants in 108 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 2, 1, 1, 2, 1, 2, 2, 2]
RANDOM walk for 1000000 steps (22914 resets) in 24203 ms. (41 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 8270520 steps (35543 resets) in 45009 ms. (183 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 1, 1, 0, 1] Max Struct:[1, 2, 1, 1, 2, 2, 2, 2]
[2025-06-02 21:19:24] [INFO ] Flow matrix only has 4063 transitions (discarded 398 similar events)
[2025-06-02 21:19:24] [INFO ] Invariant cache hit.
[2025-06-02 21:19:24] [INFO ] [Real]Absence check using 33 positive place invariants in 59 ms returned sat
[2025-06-02 21:19:25] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 170 ms returned sat
[2025-06-02 21:19:27] [INFO ] [Real]Absence check using state equation in 1888 ms returned sat
[2025-06-02 21:19:27] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:19:28] [INFO ] [Real]Added 2450 Read/Feed constraints in 1005 ms returned sat
[2025-06-02 21:19:28] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:19:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 56 ms returned sat
[2025-06-02 21:19:29] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 137 ms returned sat
[2025-06-02 21:19:31] [INFO ] [Nat]Absence check using state equation in 2062 ms returned sat
[2025-06-02 21:19:35] [INFO ] [Nat]Added 2450 Read/Feed constraints in 3921 ms returned sat
[2025-06-02 21:19:38] [INFO ] Deduced a trap composed of 267 places in 3004 ms of which 173 ms to minimize.
[2025-06-02 21:19:40] [INFO ] Deduced a trap composed of 397 places in 2589 ms of which 18 ms to minimize.
[2025-06-02 21:19:43] [INFO ] Deduced a trap composed of 293 places in 2640 ms of which 17 ms to minimize.
[2025-06-02 21:19:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 8934 ms
[2025-06-02 21:19:44] [INFO ] Computed and/alt/rep : 1651/4172/1651 causal constraints (skipped 2395 transitions) in 634 ms.
[2025-06-02 21:19:50] [INFO ] Deduced a trap composed of 271 places in 2929 ms of which 18 ms to minimize.
[2025-06-02 21:19:53] [INFO ] Deduced a trap composed of 279 places in 2783 ms of which 17 ms to minimize.
[2025-06-02 21:19:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 6539 ms
[2025-06-02 21:19:54] [INFO ] Added : 21 causal constraints over 5 iterations in 10066 ms. Result :sat
Minimization took 6658 ms.
[2025-06-02 21:20:01] [INFO ] [Real]Absence check using 33 positive place invariants in 82 ms returned sat
[2025-06-02 21:20:01] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 26 ms returned unsat
[2025-06-02 21:20:01] [INFO ] [Real]Absence check using 33 positive place invariants in 73 ms returned sat
[2025-06-02 21:20:01] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 173 ms returned sat
[2025-06-02 21:20:03] [INFO ] [Real]Absence check using state equation in 1813 ms returned sat
[2025-06-02 21:20:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:20:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 73 ms returned sat
[2025-06-02 21:20:04] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 216 ms returned sat
[2025-06-02 21:20:06] [INFO ] [Nat]Absence check using state equation in 1845 ms returned sat
[2025-06-02 21:20:08] [INFO ] [Nat]Added 2450 Read/Feed constraints in 2492 ms returned unsat
[2025-06-02 21:20:09] [INFO ] [Real]Absence check using 33 positive place invariants in 79 ms returned sat
[2025-06-02 21:20:09] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 240 ms returned sat
[2025-06-02 21:20:11] [INFO ] [Real]Absence check using state equation in 1949 ms returned sat
[2025-06-02 21:20:11] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:20:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 53 ms returned sat
[2025-06-02 21:20:12] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 165 ms returned sat
[2025-06-02 21:20:13] [INFO ] [Nat]Absence check using state equation in 1839 ms returned sat
[2025-06-02 21:20:15] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1366 ms returned sat
[2025-06-02 21:20:17] [INFO ] Deduced a trap composed of 326 places in 2394 ms of which 20 ms to minimize.
[2025-06-02 21:20:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3257 ms
[2025-06-02 21:20:19] [INFO ] Computed and/alt/rep : 1651/4172/1651 causal constraints (skipped 2395 transitions) in 1385 ms.
[2025-06-02 21:20:22] [INFO ] Added : 16 causal constraints over 4 iterations in 3634 ms. Result :sat
Minimization took 5118 ms.
[2025-06-02 21:20:27] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:20:27] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 66 ms returned unsat
[2025-06-02 21:20:28] [INFO ] [Real]Absence check using 33 positive place invariants in 80 ms returned sat
[2025-06-02 21:20:28] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 10 ms returned unsat
[2025-06-02 21:20:28] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2025-06-02 21:20:28] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 156 ms returned sat
[2025-06-02 21:20:30] [INFO ] [Real]Absence check using state equation in 1851 ms returned sat
[2025-06-02 21:20:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:20:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2025-06-02 21:20:31] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 208 ms returned sat
[2025-06-02 21:20:33] [INFO ] [Nat]Absence check using state equation in 1904 ms returned sat
[2025-06-02 21:20:35] [INFO ] [Nat]Added 2450 Read/Feed constraints in 2138 ms returned sat
[2025-06-02 21:20:38] [INFO ] Deduced a trap composed of 218 places in 2684 ms of which 17 ms to minimize.
[2025-06-02 21:20:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3910 ms
[2025-06-02 21:20:39] [INFO ] Computed and/alt/rep : 1651/4172/1651 causal constraints (skipped 2395 transitions) in 439 ms.
[2025-06-02 21:20:41] [INFO ] Added : 14 causal constraints over 3 iterations in 2096 ms. Result :sat
Minimization took 5037 ms.
[2025-06-02 21:20:46] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:20:46] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 139 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 1, 1, 0, 1] Max Struct:[1, 1, 0, 1, 1, 1, 2, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
Support contains 3 out of 1964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1964/1964 places, 4461/4461 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1964 transition count 4460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1963 transition count 4460
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 1963 transition count 4457
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 1960 transition count 4457
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 12 place count 1956 transition count 4453
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 1956 transition count 4453
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 1956 transition count 4453
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 1955 transition count 4452
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 1955 transition count 4452
Applied a total of 19 rules in 1149 ms. Remains 1955 /1964 variables (removed 9) and now considering 4452/4461 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1149 ms. Remains : 1955/1964 places, 4452/4461 transitions.
[2025-06-02 21:20:47] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
// Phase 1: matrix 4054 rows 1955 cols
[2025-06-02 21:20:48] [INFO ] Computed 577 invariants in 90 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 2]
RANDOM walk for 1000000 steps (22911 resets) in 24385 ms. (41 steps per ms)
BEST_FIRST walk for 2743707 steps (11792 resets) in 15003 ms. (182 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 2]
[2025-06-02 21:21:27] [INFO ] Flow matrix only has 4054 transitions (discarded 398 similar events)
[2025-06-02 21:21:27] [INFO ] Invariant cache hit.
[2025-06-02 21:21:27] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:21:27] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 140 ms returned sat
[2025-06-02 21:21:29] [INFO ] [Real]Absence check using state equation in 1995 ms returned sat
[2025-06-02 21:21:30] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:21:30] [INFO ] [Real]Added 2450 Read/Feed constraints in 634 ms returned sat
[2025-06-02 21:21:30] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:21:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 49 ms returned sat
[2025-06-02 21:21:31] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 165 ms returned sat
[2025-06-02 21:21:33] [INFO ] [Nat]Absence check using state equation in 1968 ms returned sat
[2025-06-02 21:21:38] [INFO ] [Nat]Added 2450 Read/Feed constraints in 4668 ms returned sat
[2025-06-02 21:21:38] [INFO ] Computed and/alt/rep : 1645/4161/1645 causal constraints (skipped 2392 transitions) in 374 ms.
[2025-06-02 21:21:40] [INFO ] Added : 18 causal constraints over 4 iterations in 1941 ms. Result :sat
Minimization took 5562 ms.
[2025-06-02 21:21:46] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:21:46] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 151 ms returned sat
[2025-06-02 21:21:48] [INFO ] [Real]Absence check using state equation in 2126 ms returned sat
[2025-06-02 21:21:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:21:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2025-06-02 21:21:49] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 165 ms returned sat
[2025-06-02 21:21:51] [INFO ] [Nat]Absence check using state equation in 2090 ms returned sat
[2025-06-02 21:21:52] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1854 ms returned sat
[2025-06-02 21:21:55] [INFO ] Deduced a trap composed of 341 places in 2862 ms of which 19 ms to minimize.
[2025-06-02 21:21:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3654 ms
[2025-06-02 21:21:56] [INFO ] Computed and/alt/rep : 1645/4161/1645 causal constraints (skipped 2392 transitions) in 335 ms.
[2025-06-02 21:21:58] [INFO ] Added : 16 causal constraints over 4 iterations in 2013 ms. Result :sat
Minimization took 5540 ms.
[2025-06-02 21:22:04] [INFO ] [Real]Absence check using 33 positive place invariants in 50 ms returned sat
[2025-06-02 21:22:04] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 145 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1955 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1955/1955 places, 4452/4452 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1955 transition count 4452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 1954 transition count 4451
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 1954 transition count 4451
Applied a total of 3 rules in 419 ms. Remains 1954 /1955 variables (removed 1) and now considering 4451/4452 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 1954/1955 places, 4451/4452 transitions.
[2025-06-02 21:22:05] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
// Phase 1: matrix 4053 rows 1954 cols
[2025-06-02 21:22:05] [INFO ] Computed 577 invariants in 75 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (22914 resets) in 24152 ms. (41 steps per ms)
BEST_FIRST walk for 1854765 steps (7972 resets) in 10002 ms. (185 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 21:22:39] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
[2025-06-02 21:22:39] [INFO ] Invariant cache hit.
[2025-06-02 21:22:39] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 21:22:39] [INFO ] [Real]Absence check using 31 positive and 546 generalized place invariants in 177 ms returned sat
[2025-06-02 21:22:41] [INFO ] [Real]Absence check using state equation in 1715 ms returned sat
[2025-06-02 21:22:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:22:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 37 ms returned sat
[2025-06-02 21:22:42] [INFO ] [Nat]Absence check using 31 positive and 546 generalized place invariants in 176 ms returned sat
[2025-06-02 21:22:43] [INFO ] [Nat]Absence check using state equation in 1742 ms returned sat
[2025-06-02 21:22:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:22:47] [INFO ] [Nat]Added 2450 Read/Feed constraints in 3527 ms returned sat
[2025-06-02 21:22:49] [INFO ] Deduced a trap composed of 366 places in 2325 ms of which 18 ms to minimize.
[2025-06-02 21:22:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2705 ms
[2025-06-02 21:22:50] [INFO ] Computed and/alt/rep : 1644/4159/1644 causal constraints (skipped 2392 transitions) in 436 ms.
[2025-06-02 21:22:53] [INFO ] Added : 20 causal constraints over 4 iterations in 2820 ms. Result :sat
Minimization took 6948 ms.
[2025-06-02 21:23:00] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 21:23:00] [INFO ] [Real]Absence check using 31 positive and 546 generalized place invariants in 184 ms returned sat
[2025-06-02 21:23:02] [INFO ] [Real]Absence check using state equation in 1798 ms returned sat
[2025-06-02 21:23:03] [INFO ] [Real]Added 2450 Read/Feed constraints in 683 ms returned sat
[2025-06-02 21:23:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:23:03] [INFO ] [Nat]Absence check using 31 positive place invariants in 39 ms returned sat
[2025-06-02 21:23:03] [INFO ] [Nat]Absence check using 31 positive and 546 generalized place invariants in 180 ms returned sat
[2025-06-02 21:23:05] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2025-06-02 21:23:08] [INFO ] [Nat]Added 2450 Read/Feed constraints in 3102 ms returned sat
[2025-06-02 21:23:11] [INFO ] Deduced a trap composed of 354 places in 2849 ms of which 17 ms to minimize.
[2025-06-02 21:23:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3657 ms
[2025-06-02 21:23:12] [INFO ] Computed and/alt/rep : 1644/4159/1644 causal constraints (skipped 2392 transitions) in 374 ms.
[2025-06-02 21:23:14] [INFO ] Added : 16 causal constraints over 4 iterations in 1857 ms. Result :sat
Minimization took 6477 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 226 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1954/1954 places, 4451/4451 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 4451/4451 transitions.
Applied a total of 0 rules in 164 ms. Remains 1954 /1954 variables (removed 0) and now considering 4451/4451 (removed 0) transitions.
[2025-06-02 21:23:21] [INFO ] Flow matrix only has 4053 transitions (discarded 398 similar events)
[2025-06-02 21:23:21] [INFO ] Invariant cache hit.
[2025-06-02 21:23:28] [INFO ] Implicit Places using invariants in 7737 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 20, 26, 34, 44, 56, 70, 85, 99, 100, 101, 102, 103, 104, 105, 106, 118, 128, 136, 142, 146, 148, 165, 171, 173, 174, 175, 176, 177, 178, 179, 180, 182, 186, 192, 200, 210, 222, 235, 247, 248, 249, 250, 251, 252, 253, 254, 264, 272, 278, 282, 284, 286, 303, 309, 311, 312, 313, 314, 315, 316, 319, 322, 324, 328, 334, 342, 352, 363, 373, 374, 375, 376, 377, 378, 379, 380, 388, 394, 398, 400, 402, 404, 421, 427, 429, 430, 431, 432, 433, 434, 435, 436, 438, 440, 442, 446, 452, 460, 469, 477, 478, 479, 480, 481, 482, 483, 484, 490, 494, 496, 498, 500, 502, 519, 525, 527, 528, 529, 530, 531, 532, 533, 534, 536, 538, 540, 542, 546, 552, 559, 565, 566, 567, 568, 569, 570, 571, 572, 576, 578, 580, 582, 584, 586, 603, 609, 611, 612, 613, 614, 615, 616, 617, 618, 620, 622, 624, 626, 628, 632, 637, 641, 642, 643, 644, 645, 646, 647, 648, 650, 652, 654, 656, 658, 660, 677, 683, 685, 686, 687, 688, 689, 690, 691, 692, 694, 696, 698, 700, 702, 704, 707, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 745, 751, 753, 754, 755, 756, 757, 758, 759, 760, 762, 764, 766, 768, 770, 772, 774, 776, 777, 778, 779, 780, 781, 782, 783, 785, 787, 789, 791, 793, 795, 812, 814, 817, 819, 820, 821, 822, 823, 824, 825, 826, 828, 830, 832, 834, 836, 838, 840, 842, 843, 844, 845, 846, 847, 848, 849, 851, 853, 855, 857, 859, 861, 878, 884, 886, 887, 888, 889, 890, 891, 892, 893, 895, 897, 899, 901, 903, 905, 907, 909, 910, 911, 912, 913, 914, 915, 916, 918, 920, 922, 924, 926, 928, 945, 951, 953, 954, 955, 956, 957, 958, 959, 960, 962, 964, 966, 968, 970, 972, 974, 977, 978, 979, 980, 981, 982, 983, 984, 986, 988, 990, 992, 994, 996, 1013, 1019, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1030, 1032, 1034, 1036, 1038, 1040, 1044, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1060, 1062, 1064, 1066, 1068, 1070, 1087, 1093, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1104, 1106, 1108, 1110, 1112, 1116, 1122, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1142, 1146, 1148, 1150, 1152, 1154, 1171, 1177, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1188, 1190, 1192, 1194, 1198, 1204, 1212, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1236, 1242, 1246, 1248, 1250, 1252, 1269, 1275, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1286, 1288, 1290, 1294, 1300, 1308, 1318, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1346, 1354, 1360, 1364, 1366, 1368, 1385, 1391, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1402, 1404, 1408, 1414, 1422, 1432, 1444, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1476, 1486, 1494, 1500, 1504, 1506, 1523, 1525, 1528, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1539, 1543, 1549, 1557, 1567, 1579, 1593, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1629, 1641, 1651, 1659, 1665, 1669, 1686]
[2025-06-02 21:23:28] [INFO ] Actually due to overlaps returned [165, 303, 421, 519, 603, 677, 745, 812, 878, 945, 1013, 1087, 1171, 1269, 1385, 1523, 1686, 4, 9, 10, 11, 12, 13, 14, 15, 99, 100, 101, 102, 103, 104, 105, 173, 174, 175, 176, 177, 178, 179, 247, 248, 249, 250, 251, 252, 253, 311, 312, 313, 314, 315, 316, 373, 374, 375, 376, 377, 378, 379, 429, 430, 431, 432, 433, 434, 435, 477, 478, 479, 480, 481, 482, 483, 527, 528, 529, 530, 531, 532, 533, 565, 566, 567, 568, 569, 570, 571, 611, 612, 613, 614, 615, 616, 617, 641, 642, 643, 644, 645, 646, 647, 685, 686, 687, 688, 689, 690, 691, 709, 710, 711, 712, 713, 714, 715, 753, 754, 755, 756, 757, 758, 759, 776, 777, 778, 779, 780, 781, 782, 814, 819, 820, 821, 822, 823, 824, 825, 842, 843, 844, 845, 846, 847, 848, 886, 887, 888, 889, 890, 891, 892, 909, 910, 911, 912, 913, 914, 915, 953, 954, 955, 956, 957, 958, 959, 977, 978, 979, 980, 981, 982, 983, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1525, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1608, 1609, 1610, 1611, 1612, 1613, 1614]
Discarding 257 places :
Implicit Place search using SMT only with invariants took 7750 ms to find 257 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1697/1954 places, 4451/4451 transitions.
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 223 place count 1474 transition count 4228
Iterating global reduction 0 with 223 rules applied. Total rules applied 446 place count 1474 transition count 4228
Discarding 223 places :
Symmetric choice reduction at 0 with 223 rule applications. Total rules 669 place count 1251 transition count 4005
Iterating global reduction 0 with 223 rules applied. Total rules applied 892 place count 1251 transition count 4005
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 895 place count 1251 transition count 4002
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 898 place count 1248 transition count 4002
Applied a total of 898 rules in 368 ms. Remains 1248 /1697 variables (removed 449) and now considering 4002/4451 (removed 449) transitions.
[2025-06-02 21:23:29] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 1248 cols
[2025-06-02 21:23:29] [INFO ] Computed 320 invariants in 39 ms
[2025-06-02 21:23:34] [INFO ] Implicit Places using invariants in 5070 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 154, 156, 158, 162, 168, 176, 186, 198, 211, 223, 233, 241, 247, 251, 253, 255, 263, 267, 270, 272, 276, 282, 290, 300, 311, 321, 329, 335, 339, 341, 343, 345, 354, 356, 358, 360, 362, 366, 372, 380, 389, 397, 403, 407, 409, 411, 413, 415, 423, 425, 427, 429, 431, 433, 437, 443, 450, 456, 460, 462, 464, 466, 468, 470, 478, 480, 482, 484, 486, 488, 490, 494, 499, 503, 505, 507, 509, 511, 513, 515, 523, 525, 527, 529, 531, 533, 535, 537, 540, 542, 544, 546, 548, 550, 552, 554, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 586, 588, 590, 592, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 622, 624, 626, 628, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 659, 661, 663, 665, 673, 675, 677, 679, 681, 683, 685, 687, 689, 692, 694, 696, 698, 700, 702, 704, 712, 714, 716, 718, 720, 722, 724, 726, 730, 735, 739, 741, 743, 745, 747, 749, 757, 759, 761, 763, 765, 767, 769, 773, 779, 786, 792, 796, 798, 800, 802, 804, 812, 814, 816, 818, 820, 822, 826, 832, 840, 849, 857, 863, 867, 869, 871, 873, 881, 883, 885, 887, 889, 893, 899, 907, 917, 928, 938, 946, 952, 956, 958, 960, 968, 970, 972, 974, 978, 984, 992, 1002, 1014, 1027, 1039, 1049, 1057, 1063, 1067, 1069, 1075, 1077, 1079, 1083, 1089, 1097, 1107, 1119, 1133, 1148, 1162, 1174, 1184, 1192, 1198, 1202]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 5080 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 976/1954 places, 4002/4451 transitions.
Applied a total of 0 rules in 120 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 13487 ms. Remains : 976/1954 places, 4002/4451 transitions.
[2025-06-02 21:23:34] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2025-06-02 21:23:34] [INFO ] Computed 48 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (24138 resets) in 23230 ms. (43 steps per ms)
BEST_FIRST walk for 2000000 steps (6541 resets) in 7960 ms. (251 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 21:24:05] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:24:05] [INFO ] Invariant cache hit.
[2025-06-02 21:24:05] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 21:24:05] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:24:07] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2025-06-02 21:24:07] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:24:07] [INFO ] [Real]Added 2450 Read/Feed constraints in 638 ms returned sat
[2025-06-02 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:24:08] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 21:24:08] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 6 ms returned sat
[2025-06-02 21:24:09] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2025-06-02 21:24:11] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1926 ms returned sat
[2025-06-02 21:24:12] [INFO ] Deduced a trap composed of 211 places in 1192 ms of which 8 ms to minimize.
[2025-06-02 21:24:13] [INFO ] Deduced a trap composed of 82 places in 1102 ms of which 9 ms to minimize.
[2025-06-02 21:24:15] [INFO ] Deduced a trap composed of 84 places in 1319 ms of which 10 ms to minimize.
[2025-06-02 21:24:16] [INFO ] Deduced a trap composed of 87 places in 994 ms of which 10 ms to minimize.
[2025-06-02 21:24:16] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5175 ms
[2025-06-02 21:24:16] [INFO ] Computed and/alt/rep : 1341/1946/1341 causal constraints (skipped 2201 transitions) in 309 ms.
[2025-06-02 21:24:18] [INFO ] Added : 20 causal constraints over 6 iterations in 1716 ms. Result :sat
Minimization took 4909 ms.
[2025-06-02 21:24:23] [INFO ] [Real]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-02 21:24:23] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:24:24] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2025-06-02 21:24:24] [INFO ] [Real]Added 2450 Read/Feed constraints in 558 ms returned sat
[2025-06-02 21:24:25] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:24:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-02 21:24:25] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:24:26] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2025-06-02 21:24:27] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1036 ms returned sat
[2025-06-02 21:24:28] [INFO ] Deduced a trap composed of 176 places in 898 ms of which 9 ms to minimize.
[2025-06-02 21:24:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1460 ms
[2025-06-02 21:24:29] [INFO ] Computed and/alt/rep : 1341/1946/1341 causal constraints (skipped 2201 transitions) in 299 ms.
[2025-06-02 21:24:29] [INFO ] Added : 14 causal constraints over 3 iterations in 1074 ms. Result :sat
Minimization took 4911 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 121 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 121 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2025-06-02 21:24:35] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:24:35] [INFO ] Invariant cache hit.
[2025-06-02 21:24:37] [INFO ] Implicit Places using invariants in 2029 ms returned []
[2025-06-02 21:24:37] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:24:37] [INFO ] Invariant cache hit.
[2025-06-02 21:24:38] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:25:08] [INFO ] Performed 648/976 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:25:33] [INFO ] Implicit Places using invariants and state equation in 56390 ms returned []
Implicit Place search using SMT with State Equation took 58426 ms to find 0 implicit places.
[2025-06-02 21:25:33] [INFO ] Redundant transitions in 360 ms returned []
Running 3940 sub problems to find dead transitions.
[2025-06-02 21:25:34] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:25:34] [INFO ] Invariant cache hit.
[2025-06-02 21:25:34] [INFO ] State equation strengthened by 2450 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3940 unsolved
SMT process timed out in 65004ms, After SMT, problems are : Problem set: 0 solved, 3940 unsolved
Search for dead transitions found 0 dead transitions in 65102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124058 ms. Remains : 976/976 places, 4002/4002 transitions.
RANDOM walk for 40000 steps (964 resets) in 2980 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (126 resets) in 453 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (127 resets) in 454 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (128 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (128 resets) in 598 ms. (66 steps per ms) remains 4/4 properties
[2025-06-02 21:26:40] [INFO ] Flatten gal took : 799 ms
[2025-06-02 21:26:41] [INFO ] Flatten gal took : 216 ms
[2025-06-02 21:26:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17910585921331332199.gal : 110 ms
[2025-06-02 21:26:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13473516189813659140.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/ReachabilityCardinality17910585921331332199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13473516189813659140.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13473516189813659140.prop.
Interrupted probabilistic random walk after 41343 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 4
Probabilistic random walk after 41343 steps, saw 17486 distinct states, run finished after 3007 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-02 21:26:43] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:26:43] [INFO ] Invariant cache hit.
[2025-06-02 21:26:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 898/900 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 21:26:44] [INFO ] Deduced a trap composed of 81 places in 971 ms of which 9 ms to minimize.
[2025-06-02 21:26:45] [INFO ] Deduced a trap composed of 169 places in 928 ms of which 8 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :49 after 50
[2025-06-02 21:26:47] [INFO ] Deduced a trap composed of 252 places in 1311 ms of which 9 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :50 after 65
[2025-06-02 21:26:48] [INFO ] Deduced a trap composed of 97 places in 1071 ms of which 8 ms to minimize.
[2025-06-02 21:26:49] [INFO ] Deduced a trap composed of 252 places in 1043 ms of which 8 ms to minimize.
SMT process timed out in 5815ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 122 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 976/976 places, 4002/4002 transitions.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :65 after 92
RANDOM walk for 40000 steps (964 resets) in 2972 ms. (13 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (130 resets) in 485 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (130 resets) in 471 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (129 resets) in 728 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (128 resets) in 594 ms. (67 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 39481 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :0 out of 4
Probabilistic random walk after 39481 steps, saw 16703 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
[2025-06-02 21:26:54] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:26:54] [INFO ] Invariant cache hit.
[2025-06-02 21:26:54] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 898/900 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 21:26:55] [INFO ] Deduced a trap composed of 81 places in 1098 ms of which 8 ms to minimize.
[2025-06-02 21:26:56] [INFO ] Deduced a trap composed of 169 places in 1044 ms of which 8 ms to minimize.
[2025-06-02 21:26:58] [INFO ] Deduced a trap composed of 252 places in 1628 ms of which 13 ms to minimize.
[2025-06-02 21:27:00] [INFO ] Deduced a trap composed of 97 places in 1671 ms of which 13 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 21:27:01] [INFO ] Deduced a trap composed of 252 places in 1532 ms of which 13 ms to minimize.
[2025-06-02 21:27:03] [INFO ] Deduced a trap composed of 97 places in 1655 ms of which 13 ms to minimize.
[2025-06-02 21:27:04] [INFO ] Deduced a trap composed of 80 places in 1599 ms of which 13 ms to minimize.
[2025-06-02 21:27:06] [INFO ] Deduced a trap composed of 80 places in 1501 ms of which 11 ms to minimize.
[2025-06-02 21:27:07] [INFO ] Deduced a trap composed of 81 places in 1314 ms of which 10 ms to minimize.
[2025-06-02 21:27:09] [INFO ] Deduced a trap composed of 111 places in 1177 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/900 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/900 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 34/934 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 21:27:10] [INFO ] Deduced a trap composed of 5 places in 1259 ms of which 16 ms to minimize.
[2025-06-02 21:27:12] [INFO ] Deduced a trap composed of 27 places in 1369 ms of which 12 ms to minimize.
[2025-06-02 21:27:13] [INFO ] Deduced a trap composed of 62 places in 1231 ms of which 11 ms to minimize.
[2025-06-02 21:27:14] [INFO ] Deduced a trap composed of 85 places in 1058 ms of which 10 ms to minimize.
[2025-06-02 21:27:15] [INFO ] Deduced a trap composed of 82 places in 1013 ms of which 13 ms to minimize.
[2025-06-02 21:27:16] [INFO ] Deduced a trap composed of 85 places in 1008 ms of which 9 ms to minimize.
[2025-06-02 21:27:17] [INFO ] Deduced a trap composed of 136 places in 850 ms of which 13 ms to minimize.
[2025-06-02 21:27:18] [INFO ] Deduced a trap composed of 62 places in 1394 ms of which 12 ms to minimize.
[2025-06-02 21:27:20] [INFO ] Deduced a trap composed of 97 places in 1503 ms of which 13 ms to minimize.
[2025-06-02 21:27:21] [INFO ] Deduced a trap composed of 27 places in 1559 ms of which 14 ms to minimize.
[2025-06-02 21:27:23] [INFO ] Deduced a trap composed of 57 places in 1532 ms of which 14 ms to minimize.
[2025-06-02 21:27:24] [INFO ] Deduced a trap composed of 62 places in 1373 ms of which 12 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 21:27:26] [INFO ] Deduced a trap composed of 104 places in 1351 ms of which 12 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 13/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/934 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/962 variables, 28/57 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 21:27:28] [INFO ] Deduced a trap composed of 117 places in 1255 ms of which 14 ms to minimize.
[2025-06-02 21:27:29] [INFO ] Deduced a trap composed of 104 places in 1528 ms of which 14 ms to minimize.
[2025-06-02 21:27:31] [INFO ] Deduced a trap composed of 103 places in 1396 ms of which 14 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:27:31] [INFO ] Flatten gal took : 162 ms
[2025-06-02 21:27:31] [INFO ] Applying decomposition
[2025-06-02 21:27:31] [INFO ] Flatten gal took : 169 ms
[2025-06-02 21:27:32] [INFO ] Deduced a trap composed of 103 places in 1157 ms of which 9 ms to minimize.
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/graph3913681848633365242.txt' '-o' '/tmp/graph3913681848633365242.bin' '-w' '/tmp/graph3913681848633365242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3913681848633365242.bin' '-l' '-1' '-v' '-w' '/tmp/graph3913681848633365242.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:27:32] [INFO ] Decomposing Gal with order
[2025-06-02 21:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:27:33] [INFO ] Deduced a trap composed of 102 places in 856 ms of which 10 ms to minimize.
[2025-06-02 21:27:33] [INFO ] Deduced a trap composed of 108 places in 755 ms of which 9 ms to minimize.
[2025-06-02 21:27:34] [INFO ] Removed a total of 7336 redundant transitions.
[2025-06-02 21:27:34] [INFO ] Flatten gal took : 1522 ms
[2025-06-02 21:27:34] [INFO ] Deduced a trap composed of 103 places in 756 ms of which 8 ms to minimize.
[2025-06-02 21:27:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2597 labels/synchronizations in 369 ms.
[2025-06-02 21:27:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11386086724076554222.gal : 55 ms
[2025-06-02 21:27:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1209392094774271505.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/ReachabilityCardinality11386086724076554222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1209392094774271505.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 ...308
[2025-06-02 21:27:35] [INFO ] Deduced a trap composed of 103 places in 731 ms of which 9 ms to minimize.
Loading property file /tmp/ReachabilityCardinality1209392094774271505.prop.
[2025-06-02 21:27:36] [INFO ] Deduced a trap composed of 110 places in 918 ms of which 14 ms to minimize.
[2025-06-02 21:27:37] [INFO ] Deduced a trap composed of 103 places in 968 ms of which 9 ms to minimize.
[2025-06-02 21:27:38] [INFO ] Deduced a trap composed of 109 places in 918 ms of which 9 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 331
[2025-06-02 21:27:39] [INFO ] Deduced a trap composed of 102 places in 1018 ms of which 8 ms to minimize.
SMT process timed out in 45252ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 976 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 121 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 976/976 places, 4002/4002 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4002/4002 transitions.
Applied a total of 0 rules in 119 ms. Remains 976 /976 variables (removed 0) and now considering 4002/4002 (removed 0) transitions.
[2025-06-02 21:27:39] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:27:39] [INFO ] Invariant cache hit.
[2025-06-02 21:27:41] [INFO ] Implicit Places using invariants in 2064 ms returned []
[2025-06-02 21:27:41] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:27:41] [INFO ] Invariant cache hit.
[2025-06-02 21:27:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :331 after 1372
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1372 after 2452
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2452 after 4651
[2025-06-02 21:28:13] [INFO ] Performed 647/976 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-02 21:28:37] [INFO ] Implicit Places using invariants and state equation in 55727 ms returned []
Implicit Place search using SMT with State Equation took 57793 ms to find 0 implicit places.
[2025-06-02 21:28:37] [INFO ] Redundant transitions in 307 ms returned []
Running 3940 sub problems to find dead transitions.
[2025-06-02 21:28:37] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:28:37] [INFO ] Invariant cache hit.
[2025-06-02 21:28:37] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/974 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3940 unsolved
SMT process timed out in 67416ms, After SMT, problems are : Problem set: 0 solved, 3940 unsolved
Search for dead transitions found 0 dead transitions in 67481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125733 ms. Remains : 976/976 places, 4002/4002 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:29:45] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:29:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (241 resets) in 381 ms. (26 steps per ms)
BEST_FIRST walk for 10001 steps (33 resets) in 68 ms. (144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:29:45] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:29:45] [INFO ] Invariant cache hit.
[2025-06-02 21:29:46] [INFO ] [Real]Absence check using 31 positive place invariants in 41 ms returned sat
[2025-06-02 21:29:46] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 11 ms returned sat
[2025-06-02 21:29:47] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2025-06-02 21:29:47] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:29:48] [INFO ] [Real]Added 2450 Read/Feed constraints in 693 ms returned sat
[2025-06-02 21:29:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:29:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2025-06-02 21:29:48] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:29:50] [INFO ] [Nat]Absence check using state equation in 1369 ms returned sat
[2025-06-02 21:29:50] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:29:51] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1200 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 976 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4000/4000 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 975 transition count 3997
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 973 transition count 3995
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 972 transition count 3993
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 971 transition count 3991
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 970 transition count 3989
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 969 transition count 3987
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9 place count 969 transition count 3986
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10 place count 968 transition count 3986
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 11 place count 967 transition count 3985
Iterating global reduction 7 with 1 rules applied. Total rules applied 12 place count 967 transition count 3985
Applied a total of 12 rules in 320 ms. Remains 967 /976 variables (removed 9) and now considering 3985/4000 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 967/976 places, 3985/4000 transitions.
[2025-06-02 21:29:51] [INFO ] Flow matrix only has 3587 transitions (discarded 398 similar events)
// Phase 1: matrix 3587 rows 967 cols
[2025-06-02 21:29:51] [INFO ] Computed 48 invariants in 34 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24141 resets) in 23153 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3282 resets) in 3950 ms. (253 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:30:18] [INFO ] Flow matrix only has 3587 transitions (discarded 398 similar events)
[2025-06-02 21:30:18] [INFO ] Invariant cache hit.
[2025-06-02 21:30:18] [INFO ] [Real]Absence check using 31 positive place invariants in 25 ms returned sat
[2025-06-02 21:30:18] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:30:20] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2025-06-02 21:30:20] [INFO ] State equation strengthened by 2443 read => feed constraints.
[2025-06-02 21:30:20] [INFO ] [Real]Added 2443 Read/Feed constraints in 565 ms returned sat
[2025-06-02 21:30:21] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:30:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 43 ms returned sat
[2025-06-02 21:30:21] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 11 ms returned sat
[2025-06-02 21:30:22] [INFO ] [Nat]Absence check using state equation in 1425 ms returned sat
[2025-06-02 21:30:24] [INFO ] [Nat]Added 2443 Read/Feed constraints in 1886 ms returned sat
[2025-06-02 21:30:25] [INFO ] Deduced a trap composed of 207 places in 1020 ms of which 10 ms to minimize.
[2025-06-02 21:30:27] [INFO ] Deduced a trap composed of 81 places in 1631 ms of which 14 ms to minimize.
[2025-06-02 21:30:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3078 ms
[2025-06-02 21:30:28] [INFO ] Computed and/alt/rep : 1323/1911/1323 causal constraints (skipped 2202 transitions) in 475 ms.
[2025-06-02 21:30:31] [INFO ] Deduced a trap composed of 89 places in 1761 ms of which 14 ms to minimize.
[2025-06-02 21:30:34] [INFO ] Deduced a trap composed of 87 places in 1828 ms of which 15 ms to minimize.
[2025-06-02 21:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4320 ms
[2025-06-02 21:30:34] [INFO ] Added : 22 causal constraints over 6 iterations in 6968 ms. Result :sat
Minimization took 4886 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 967 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3985/3985 transitions.
Applied a total of 0 rules in 125 ms. Remains 967 /967 variables (removed 0) and now considering 3985/3985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 967/967 places, 3985/3985 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 967/967 places, 3985/3985 transitions.
Applied a total of 0 rules in 136 ms. Remains 967 /967 variables (removed 0) and now considering 3985/3985 (removed 0) transitions.
[2025-06-02 21:30:39] [INFO ] Flow matrix only has 3587 transitions (discarded 398 similar events)
[2025-06-02 21:30:39] [INFO ] Invariant cache hit.
[2025-06-02 21:30:41] [INFO ] Implicit Places using invariants in 2070 ms returned [226]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2075 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 966/967 places, 3985/3985 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 965 transition count 3984
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 965 transition count 3984
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 964 transition count 3983
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 964 transition count 3983
Applied a total of 4 rules in 195 ms. Remains 964 /966 variables (removed 2) and now considering 3983/3985 (removed 2) transitions.
[2025-06-02 21:30:42] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
// Phase 1: matrix 3585 rows 964 cols
[2025-06-02 21:30:42] [INFO ] Computed 47 invariants in 31 ms
[2025-06-02 21:30:45] [INFO ] Implicit Places using invariants in 3077 ms returned []
[2025-06-02 21:30:45] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:30:45] [INFO ] Invariant cache hit.
[2025-06-02 21:30:47] [INFO ] State equation strengthened by 2443 read => feed constraints.
[2025-06-02 21:31:17] [INFO ] Performed 520/964 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:31:44] [INFO ] Implicit Places using invariants and state equation in 59085 ms returned []
Implicit Place search using SMT with State Equation took 62165 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 964/967 places, 3983/3985 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64576 ms. Remains : 964/967 places, 3983/3985 transitions.
[2025-06-02 21:31:44] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:31:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24139 resets) in 22997 ms. (43 steps per ms)
BEST_FIRST walk for 1000001 steps (3282 resets) in 4068 ms. (245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:32:11] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:32:11] [INFO ] Invariant cache hit.
[2025-06-02 21:32:11] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:32:11] [INFO ] [Real]Absence check using 31 positive and 16 generalized place invariants in 6 ms returned sat
[2025-06-02 21:32:13] [INFO ] [Real]Absence check using state equation in 1372 ms returned sat
[2025-06-02 21:32:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:32:13] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 21:32:13] [INFO ] [Nat]Absence check using 31 positive and 16 generalized place invariants in 4 ms returned sat
[2025-06-02 21:32:14] [INFO ] [Nat]Absence check using state equation in 1168 ms returned sat
[2025-06-02 21:32:14] [INFO ] State equation strengthened by 2443 read => feed constraints.
[2025-06-02 21:32:17] [INFO ] [Nat]Added 2443 Read/Feed constraints in 3315 ms returned sat
[2025-06-02 21:32:19] [INFO ] Deduced a trap composed of 231 places in 1328 ms of which 16 ms to minimize.
[2025-06-02 21:32:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1626 ms
[2025-06-02 21:32:19] [INFO ] Computed and/alt/rep : 1322/1903/1322 causal constraints (skipped 2201 transitions) in 499 ms.
[2025-06-02 21:32:23] [INFO ] Deduced a trap composed of 61 places in 1214 ms of which 9 ms to minimize.
[2025-06-02 21:32:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1700 ms
[2025-06-02 21:32:23] [INFO ] Added : 20 causal constraints over 5 iterations in 4493 ms. Result :sat
Minimization took 4893 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3983/3983 transitions.
Applied a total of 0 rules in 117 ms. Remains 964 /964 variables (removed 0) and now considering 3983/3983 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 964/964 places, 3983/3983 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3983/3983 transitions.
Applied a total of 0 rules in 116 ms. Remains 964 /964 variables (removed 0) and now considering 3983/3983 (removed 0) transitions.
[2025-06-02 21:32:29] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:32:29] [INFO ] Invariant cache hit.
[2025-06-02 21:32:32] [INFO ] Implicit Places using invariants in 3012 ms returned []
[2025-06-02 21:32:32] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:32:32] [INFO ] Invariant cache hit.
[2025-06-02 21:32:34] [INFO ] State equation strengthened by 2443 read => feed constraints.
[2025-06-02 21:33:04] [INFO ] Performed 522/964 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:33:30] [INFO ] Implicit Places using invariants and state equation in 58057 ms returned []
Implicit Place search using SMT with State Equation took 61076 ms to find 0 implicit places.
[2025-06-02 21:33:30] [INFO ] Redundant transitions in 260 ms returned []
Running 3921 sub problems to find dead transitions.
[2025-06-02 21:33:30] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:33:30] [INFO ] Invariant cache hit.
[2025-06-02 21:33:30] [INFO ] State equation strengthened by 2443 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3921 unsolved
SMT process timed out in 65280ms, After SMT, problems are : Problem set: 0 solved, 3921 unsolved
Search for dead transitions found 0 dead transitions in 65331ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126799 ms. Remains : 964/964 places, 3983/3983 transitions.
[2025-06-02 21:34:36] [INFO ] Flatten gal took : 405 ms
RANDOM walk for 40000 steps (964 resets) in 2098 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (130 resets) in 422 ms. (94 steps per ms) remains 2/2 properties
[2025-06-02 21:34:36] [INFO ] Flatten gal took : 288 ms
[2025-06-02 21:34:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5759286982318337411.gal : 59 ms
[2025-06-02 21:34:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12817349106942313650.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/ReachabilityCardinality5759286982318337411.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12817349106942313650.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (128 resets) in 578 ms. (69 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality12817349106942313650.prop.
Interrupted probabilistic random walk after 48833 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 48833 steps, saw 20581 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 21:34:39] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:34:39] [INFO ] Invariant cache hit.
[2025-06-02 21:34:39] [INFO ] State equation strengthened by 2443 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 871/872 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/890 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:34:40] [INFO ] Deduced a trap composed of 93 places in 931 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/922 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
[2025-06-02 21:34:42] [INFO ] Deduced a trap composed of 5 places in 1078 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
[2025-06-02 21:34:43] [INFO ] Deduced a trap composed of 61 places in 1036 ms of which 11 ms to minimize.
[2025-06-02 21:34:44] [INFO ] Deduced a trap composed of 64 places in 1047 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
[2025-06-02 21:34:45] [INFO ] Deduced a trap composed of 27 places in 1044 ms of which 9 ms to minimize.
SMT process timed out in 5697ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3983/3983 transitions.
Applied a total of 0 rules in 117 ms. Remains 964 /964 variables (removed 0) and now considering 3983/3983 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 964/964 places, 3983/3983 transitions.
RANDOM walk for 40000 steps (964 resets) in 2093 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (129 resets) in 330 ms. (120 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (130 resets) in 364 ms. (109 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
Interrupted probabilistic random walk after 49600 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 49600 steps, saw 20904 distinct states, run finished after 3001 ms. (steps per millisecond=16 ) properties seen :0
[2025-06-02 21:34:49] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:34:49] [INFO ] Invariant cache hit.
[2025-06-02 21:34:49] [INFO ] State equation strengthened by 2443 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 871/872 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/872 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/890 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:34:50] [INFO ] Deduced a trap composed of 93 places in 1004 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 32/922 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:34:52] [INFO ] Deduced a trap composed of 5 places in 1110 ms of which 9 ms to minimize.
[2025-06-02 21:34:53] [INFO ] Deduced a trap composed of 61 places in 1067 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 21:34:54] [INFO ] Deduced a trap composed of 64 places in 1077 ms of which 9 ms to minimize.
[2025-06-02 21:34:55] [INFO ] Deduced a trap composed of 27 places in 1033 ms of which 8 ms to minimize.
[2025-06-02 21:34:56] [INFO ] Deduced a trap composed of 68 places in 1058 ms of which 8 ms to minimize.
[2025-06-02 21:34:57] [INFO ] Deduced a trap composed of 27 places in 1080 ms of which 8 ms to minimize.
[2025-06-02 21:34:58] [INFO ] Deduced a trap composed of 88 places in 1081 ms of which 9 ms to minimize.
[2025-06-02 21:34:59] [INFO ] Deduced a trap composed of 81 places in 1004 ms of which 8 ms to minimize.
[2025-06-02 21:35:00] [INFO ] Deduced a trap composed of 76 places in 1032 ms of which 9 ms to minimize.
[2025-06-02 21:35:01] [INFO ] Deduced a trap composed of 54 places in 1031 ms of which 9 ms to minimize.
[2025-06-02 21:35:02] [INFO ] Deduced a trap composed of 57 places in 1035 ms of which 8 ms to minimize.
[2025-06-02 21:35:03] [INFO ] Deduced a trap composed of 67 places in 1036 ms of which 8 ms to minimize.
[2025-06-02 21:35:04] [INFO ] Deduced a trap composed of 46 places in 1028 ms of which 8 ms to minimize.
[2025-06-02 21:35:06] [INFO ] Deduced a trap composed of 62 places in 1039 ms of which 9 ms to minimize.
[2025-06-02 21:35:07] [INFO ] Deduced a trap composed of 68 places in 1045 ms of which 8 ms to minimize.
[2025-06-02 21:35:08] [INFO ] Deduced a trap composed of 69 places in 1035 ms of which 8 ms to minimize.
[2025-06-02 21:35:09] [INFO ] Deduced a trap composed of 85 places in 1002 ms of which 8 ms to minimize.
[2025-06-02 21:35:10] [INFO ] Deduced a trap composed of 142 places in 1011 ms of which 8 ms to minimize.
[2025-06-02 21:35:11] [INFO ] Deduced a trap composed of 92 places in 1013 ms of which 9 ms to minimize.
[2025-06-02 21:35:12] [INFO ] Deduced a trap composed of 64 places in 1060 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/922 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:35:13] [INFO ] Deduced a trap composed of 62 places in 1039 ms of which 9 ms to minimize.
[2025-06-02 21:35:14] [INFO ] Deduced a trap composed of 82 places in 1066 ms of which 9 ms to minimize.
[2025-06-02 21:35:15] [INFO ] Deduced a trap composed of 70 places in 1081 ms of which 9 ms to minimize.
[2025-06-02 21:35:16] [INFO ] Deduced a trap composed of 95 places in 1013 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 21:35:17] [INFO ] Deduced a trap composed of 77 places in 1020 ms of which 8 ms to minimize.
[2025-06-02 21:35:18] [INFO ] Deduced a trap composed of 85 places in 1024 ms of which 8 ms to minimize.
[2025-06-02 21:35:19] [INFO ] Deduced a trap composed of 64 places in 1015 ms of which 9 ms to minimize.
[2025-06-02 21:35:20] [INFO ] Deduced a trap composed of 85 places in 1004 ms of which 9 ms to minimize.
[2025-06-02 21:35:21] [INFO ] Deduced a trap composed of 70 places in 986 ms of which 8 ms to minimize.
[2025-06-02 21:35:22] [INFO ] Deduced a trap composed of 95 places in 960 ms of which 8 ms to minimize.
[2025-06-02 21:35:23] [INFO ] Deduced a trap composed of 46 places in 968 ms of which 8 ms to minimize.
[2025-06-02 21:35:24] [INFO ] Deduced a trap composed of 62 places in 957 ms of which 8 ms to minimize.
[2025-06-02 21:35:25] [INFO ] Deduced a trap composed of 76 places in 985 ms of which 9 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:35:26] [INFO ] Deduced a trap composed of 135 places in 973 ms of which 9 ms to minimize.
[2025-06-02 21:35:26] [INFO ] Flatten gal took : 131 ms
[2025-06-02 21:35:26] [INFO ] Applying decomposition
[2025-06-02 21:35:26] [INFO ] Flatten gal took : 133 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/graph9843263458983105608.txt' '-o' '/tmp/graph9843263458983105608.bin' '-w' '/tmp/graph9843263458983105608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9843263458983105608.bin' '-l' '-1' '-v' '-w' '/tmp/graph9843263458983105608.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:35:27] [INFO ] Decomposing Gal with order
[2025-06-02 21:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:35:28] [INFO ] Removed a total of 7408 redundant transitions.
[2025-06-02 21:35:28] [INFO ] Deduced a trap composed of 64 places in 1312 ms of which 10 ms to minimize.
[2025-06-02 21:35:28] [INFO ] Flatten gal took : 834 ms
[2025-06-02 21:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2289 labels/synchronizations in 225 ms.
[2025-06-02 21:35:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4986623680463582772.gal : 39 ms
[2025-06-02 21:35:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2994453283166826942.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/ReachabilityCardinality4986623680463582772.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2994453283166826942.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 ...307
[2025-06-02 21:35:29] [INFO ] Deduced a trap composed of 84 places in 1207 ms of which 9 ms to minimize.
Loading property file /tmp/ReachabilityCardinality2994453283166826942.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 22
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :22 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 52
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :52 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 76
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :76 after 76
[2025-06-02 21:35:30] [INFO ] Deduced a trap composed of 82 places in 1431 ms of which 9 ms to minimize.
[2025-06-02 21:35:32] [INFO ] Deduced a trap composed of 94 places in 1276 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :76 after 452
[2025-06-02 21:35:33] [INFO ] Deduced a trap composed of 75 places in 1373 ms of which 10 ms to minimize.
[2025-06-02 21:35:34] [INFO ] Deduced a trap composed of 130 places in 1380 ms of which 13 ms to minimize.
SMT process timed out in 45518ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3983/3983 transitions.
Applied a total of 0 rules in 118 ms. Remains 964 /964 variables (removed 0) and now considering 3983/3983 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 964/964 places, 3983/3983 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 3983/3983 transitions.
Applied a total of 0 rules in 118 ms. Remains 964 /964 variables (removed 0) and now considering 3983/3983 (removed 0) transitions.
[2025-06-02 21:35:35] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:35:35] [INFO ] Invariant cache hit.
[2025-06-02 21:35:37] [INFO ] Implicit Places using invariants in 1966 ms returned []
[2025-06-02 21:35:37] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:35:37] [INFO ] Invariant cache hit.
[2025-06-02 21:35:38] [INFO ] State equation strengthened by 2443 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :452 after 3398
[2025-06-02 21:36:10] [INFO ] Performed 522/964 implicitness test of which 0 returned IMPLICIT in 31 seconds.
Detected timeout of ITS tools.
[2025-06-02 21:36:35] [INFO ] Implicit Places using invariants and state equation in 57963 ms returned []
Implicit Place search using SMT with State Equation took 59948 ms to find 0 implicit places.
[2025-06-02 21:36:35] [INFO ] Redundant transitions in 388 ms returned []
Running 3921 sub problems to find dead transitions.
[2025-06-02 21:36:35] [INFO ] Flow matrix only has 3585 transitions (discarded 398 similar events)
[2025-06-02 21:36:35] [INFO ] Invariant cache hit.
[2025-06-02 21:36:35] [INFO ] State equation strengthened by 2443 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/961 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3921 unsolved
SMT process timed out in 65482ms, After SMT, problems are : Problem set: 0 solved, 3921 unsolved
Search for dead transitions found 0 dead transitions in 65560ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126032 ms. Remains : 964/964 places, 3983/3983 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-00 in 475770 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06
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:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:37:41] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
// Phase 1: matrix 3604 rows 976 cols
[2025-06-02 21:37:41] [INFO ] Computed 48 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (241 resets) in 372 ms. (26 steps per ms)
BEST_FIRST walk for 10001 steps (32 resets) in 66 ms. (149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:37:41] [INFO ] Flow matrix only has 3604 transitions (discarded 398 similar events)
[2025-06-02 21:37:41] [INFO ] Invariant cache hit.
[2025-06-02 21:37:41] [INFO ] [Real]Absence check using 31 positive place invariants in 38 ms returned sat
[2025-06-02 21:37:41] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 7 ms returned sat
[2025-06-02 21:37:43] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2025-06-02 21:37:43] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:37:44] [INFO ] [Real]Added 2450 Read/Feed constraints in 659 ms returned sat
[2025-06-02 21:37:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:37:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 40 ms returned sat
[2025-06-02 21:37:44] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2025-06-02 21:37:45] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2025-06-02 21:37:46] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-02 21:37:46] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1046 ms returned sat
[2025-06-02 21:37:48] [INFO ] Deduced a trap composed of 176 places in 1308 ms of which 15 ms to minimize.
[2025-06-02 21:37:48] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2145 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 976 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node2HasTheLeafSetOfLx6ToReplaceNode0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 976/976 places, 4001/4001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 975 transition count 4000
Applied a total of 1 rules in 204 ms. Remains 975 /976 variables (removed 1) and now considering 4000/4001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 975/976 places, 4000/4001 transitions.
[2025-06-02 21:37:49] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
// Phase 1: matrix 3602 rows 975 cols
[2025-06-02 21:37:49] [INFO ] Computed 48 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (24137 resets) in 22609 ms. (44 steps per ms)
BEST_FIRST walk for 1000001 steps (3279 resets) in 3853 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 21:38:15] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:38:15] [INFO ] Invariant cache hit.
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 31 positive place invariants in 23 ms returned sat
[2025-06-02 21:38:16] [INFO ] [Real]Absence check using 31 positive and 17 generalized place invariants in 6 ms returned sat
[2025-06-02 21:38:17] [INFO ] [Real]Absence check using state equation in 1240 ms returned sat
[2025-06-02 21:38:17] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:38:17] [INFO ] [Real]Added 2450 Read/Feed constraints in 423 ms returned sat
[2025-06-02 21:38:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 31 positive place invariants in 41 ms returned sat
[2025-06-02 21:38:18] [INFO ] [Nat]Absence check using 31 positive and 17 generalized place invariants in 10 ms returned sat
[2025-06-02 21:38:19] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2025-06-02 21:38:20] [INFO ] [Nat]Added 2450 Read/Feed constraints in 1108 ms returned sat
[2025-06-02 21:38:21] [INFO ] Deduced a trap composed of 176 places in 1000 ms of which 10 ms to minimize.
[2025-06-02 21:38:23] [INFO ] Deduced a trap composed of 135 places in 1331 ms of which 12 ms to minimize.
[2025-06-02 21:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3388 ms
[2025-06-02 21:38:24] [INFO ] Computed and/alt/rep : 1339/1943/1339 causal constraints (skipped 2201 transitions) in 353 ms.
[2025-06-02 21:38:25] [INFO ] Added : 13 causal constraints over 3 iterations in 1734 ms. Result :sat
Minimization took 4890 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 118 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 975/975 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 118 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2025-06-02 21:38:31] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:38:31] [INFO ] Invariant cache hit.
[2025-06-02 21:38:34] [INFO ] Implicit Places using invariants in 3186 ms returned []
[2025-06-02 21:38:34] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:38:34] [INFO ] Invariant cache hit.
[2025-06-02 21:38:35] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2025-06-02 21:39:06] [INFO ] Performed 561/975 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-02 21:39:26] [INFO ] Implicit Places using invariants and state equation in 52083 ms returned []
Implicit Place search using SMT with State Equation took 55272 ms to find 0 implicit places.
[2025-06-02 21:39:26] [INFO ] Redundant transitions in 265 ms returned []
Running 3938 sub problems to find dead transitions.
[2025-06-02 21:39:26] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:39:26] [INFO ] Invariant cache hit.
[2025-06-02 21:39:26] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3938 unsolved
SMT process timed out in 65611ms, After SMT, problems are : Problem set: 0 solved, 3938 unsolved
Search for dead transitions found 0 dead transitions in 65657ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121326 ms. Remains : 975/975 places, 4000/4000 transitions.
[2025-06-02 21:40:32] [INFO ] Flatten gal took : 213 ms
[2025-06-02 21:40:32] [INFO ] Flatten gal took : 283 ms
[2025-06-02 21:40:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9761164572197092657.gal : 46 ms
[2025-06-02 21:40:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10293428970990427724.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/ReachabilityCardinality9761164572197092657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10293428970990427724.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (964 resets) in 2151 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 312 ms. (127 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (128 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality10293428970990427724.prop.
Interrupted probabilistic random walk after 47662 steps, run timeout after 3001 ms. (steps per millisecond=15 ) properties seen :0 out of 2
Probabilistic random walk after 47662 steps, saw 20104 distinct states, run finished after 3001 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-02 21:40:36] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:40:36] [INFO ] Invariant cache hit.
[2025-06-02 21:40:36] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/961 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/975 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
At refinement iteration 11 (OVERLAPS) 3602/4577 variables, 975/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
At refinement iteration 12 (INCLUDED_ONLY) 0/4577 variables, 2450/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
At refinement iteration 13 (INCLUDED_ONLY) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
After SMT solving in domain Real declared 4577/4577 variables, and 3473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2368 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 65
[2025-06-02 21:40:40] [INFO ] Deduced a trap composed of 55 places in 1316 ms of which 8 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :65 after 92
[2025-06-02 21:40:41] [INFO ] Deduced a trap composed of 27 places in 1077 ms of which 9 ms to minimize.
[2025-06-02 21:40:42] [INFO ] Deduced a trap composed of 73 places in 1084 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
[2025-06-02 21:40:43] [INFO ] Deduced a trap composed of 82 places in 1096 ms of which 8 ms to minimize.
SDD size :92 after 172
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 933/4577 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 3/31 constraints, Generalized P Invariants (flows): 3/17 constraints, State Equation: 0/975 constraints, ReadFeed: 0/2450 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 7446ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 121 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 975/975 places, 4000/4000 transitions.
RANDOM walk for 40000 steps (964 resets) in 2546 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (129 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (129 resets) in 376 ms. (106 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 48042 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 2
Probabilistic random walk after 48042 steps, saw 20257 distinct states, run finished after 3004 ms. (steps per millisecond=15 ) properties seen :0
[2025-06-02 21:40:47] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:40:47] [INFO ] Invariant cache hit.
[2025-06-02 21:40:47] [INFO ] State equation strengthened by 2450 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/961 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/961 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 14/975 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3602/4577 variables, 975/1023 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4577 variables, 2450/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4577 variables, 0/3473 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4577/4577 variables, and 3473 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2538 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 881/882 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/899 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/899 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/933 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
[2025-06-02 21:40:51] [INFO ] Deduced a trap composed of 55 places in 1081 ms of which 9 ms to minimize.
[2025-06-02 21:40:52] [INFO ] Deduced a trap composed of 27 places in 1070 ms of which 9 ms to minimize.
[2025-06-02 21:40:53] [INFO ] Deduced a trap composed of 73 places in 1116 ms of which 9 ms to minimize.
[2025-06-02 21:40:55] [INFO ] Deduced a trap composed of 82 places in 1116 ms of which 9 ms to minimize.
[2025-06-02 21:40:56] [INFO ] Deduced a trap composed of 94 places in 1047 ms of which 9 ms to minimize.
[2025-06-02 21:40:57] [INFO ] Deduced a trap composed of 54 places in 1035 ms of which 8 ms to minimize.
[2025-06-02 21:40:58] [INFO ] Deduced a trap composed of 54 places in 1007 ms of which 8 ms to minimize.
[2025-06-02 21:40:59] [INFO ] Deduced a trap composed of 62 places in 1001 ms of which 8 ms to minimize.
[2025-06-02 21:41:00] [INFO ] Deduced a trap composed of 85 places in 1003 ms of which 8 ms to minimize.
[2025-06-02 21:41:01] [INFO ] Deduced a trap composed of 73 places in 991 ms of which 8 ms to minimize.
[2025-06-02 21:41:02] [INFO ] Deduced a trap composed of 83 places in 1007 ms of which 9 ms to minimize.
[2025-06-02 21:41:03] [INFO ] Deduced a trap composed of 78 places in 990 ms of which 9 ms to minimize.
[2025-06-02 21:41:04] [INFO ] Deduced a trap composed of 73 places in 1000 ms of which 8 ms to minimize.
[2025-06-02 21:41:05] [INFO ] Deduced a trap composed of 85 places in 982 ms of which 8 ms to minimize.
[2025-06-02 21:41:06] [INFO ] Deduced a trap composed of 78 places in 994 ms of which 9 ms to minimize.
[2025-06-02 21:41:07] [INFO ] Deduced a trap composed of 65 places in 1007 ms of which 8 ms to minimize.
[2025-06-02 21:41:08] [INFO ] Deduced a trap composed of 68 places in 1027 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/961 variables, 28/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/961 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/975 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3602/4577 variables, 975/1040 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4577 variables, 2450/3490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4577 variables, 2/3492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-06-02 21:41:13] [INFO ] Deduced a trap composed of 176 places in 941 ms of which 8 ms to minimize.
[2025-06-02 21:41:14] [INFO ] Deduced a trap composed of 182 places in 886 ms of which 9 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :489 after 1335
[2025-06-02 21:41:17] [INFO ] Deduced a trap composed of 178 places in 925 ms of which 9 ms to minimize.
[2025-06-02 21:41:19] [INFO ] Deduced a trap composed of 180 places in 904 ms of which 9 ms to minimize.
[2025-06-02 21:41:21] [INFO ] Deduced a trap composed of 180 places in 993 ms of which 8 ms to minimize.
Detected timeout of ITS tools.
[2025-06-02 21:41:23] [INFO ] Flatten gal took : 127 ms
[2025-06-02 21:41:23] [INFO ] Applying decomposition
[2025-06-02 21:41:23] [INFO ] Flatten gal took : 130 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/graph14411786381782482282.txt' '-o' '/tmp/graph14411786381782482282.bin' '-w' '/tmp/graph14411786381782482282.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14411786381782482282.bin' '-l' '-1' '-v' '-w' '/tmp/graph14411786381782482282.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:41:23] [INFO ] Decomposing Gal with order
[2025-06-02 21:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:41:23] [INFO ] Deduced a trap composed of 184 places in 918 ms of which 8 ms to minimize.
[2025-06-02 21:41:24] [INFO ] Removed a total of 7421 redundant transitions.
[2025-06-02 21:41:24] [INFO ] Flatten gal took : 587 ms
[2025-06-02 21:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2368 labels/synchronizations in 186 ms.
[2025-06-02 21:41:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16236912727138014296.gal : 32 ms
[2025-06-02 21:41:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9893225797443105714.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/ReachabilityCardinality16236912727138014296.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9893225797443105714.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 ...308
At refinement iteration 15 (INCLUDED_ONLY) 0/4577 variables, 6/3498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/4577 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Loading property file /tmp/ReachabilityCardinality9893225797443105714.prop.
At refinement iteration 17 (OVERLAPS) 0/4577 variables, 0/3498 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4577/4577 variables, and 3498 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35661 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 975/975 constraints, ReadFeed: 2450/2450 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 23/23 constraints]
After SMT, in 38240ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 207 ms.
Support contains 1 out of 975 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 128 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 975/975 places, 4000/4000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 975/975 places, 4000/4000 transitions.
Applied a total of 0 rules in 125 ms. Remains 975 /975 variables (removed 0) and now considering 4000/4000 (removed 0) transitions.
[2025-06-02 21:41:26] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:41:26] [INFO ] Invariant cache hit.
[2025-06-02 21:41:28] [INFO ] Implicit Places using invariants in 2179 ms returned []
[2025-06-02 21:41:28] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:41:28] [INFO ] Invariant cache hit.
[2025-06-02 21:41:30] [INFO ] State equation strengthened by 2450 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 765
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :765 after 1735
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1735 after 2307
[2025-06-02 21:42:00] [INFO ] Performed 550/975 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2025-06-02 21:42:25] [INFO ] Implicit Places using invariants and state equation in 56765 ms returned []
Implicit Place search using SMT with State Equation took 58946 ms to find 0 implicit places.
[2025-06-02 21:42:25] [INFO ] Redundant transitions in 402 ms returned []
Running 3938 sub problems to find dead transitions.
[2025-06-02 21:42:25] [INFO ] Flow matrix only has 3602 transitions (discarded 398 similar events)
[2025-06-02 21:42:25] [INFO ] Invariant cache hit.
[2025-06-02 21:42:25] [INFO ] State equation strengthened by 2450 read => feed constraints.
(s546 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 0.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 0.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 0.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 0.0)
(s545 0.0)
(s546 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/972 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3938 unsolved
SMT process timed out in 66542ms, After SMT, problems are : Problem set: 0 solved, 3938 unsolved
Search for dead transitions found 0 dead transitions in 66588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126082 ms. Remains : 975/975 places, 4000/4000 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C07-UpperBounds-06 in 351279 ms.
[2025-06-02 21:43:32] [INFO ] Flatten gal took : 197 ms
[2025-06-02 21:43:32] [INFO ] Applying decomposition
[2025-06-02 21:43:32] [INFO ] Flatten gal took : 206 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/graph17336280653554486527.txt' '-o' '/tmp/graph17336280653554486527.bin' '-w' '/tmp/graph17336280653554486527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17336280653554486527.bin' '-l' '-1' '-v' '-w' '/tmp/graph17336280653554486527.weights' '-q' '0' '-e' '0.001'
[2025-06-02 21:43:33] [INFO ] Decomposing Gal with order
[2025-06-02 21:43:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 21:43:34] [INFO ] Removed a total of 7431 redundant transitions.
[2025-06-02 21:43:34] [INFO ] Flatten gal took : 656 ms
[2025-06-02 21:43:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2663 labels/synchronizations in 166 ms.
[2025-06-02 21:43:34] [INFO ] Time to serialize gal into /tmp/UpperBounds12241941167660427116.gal : 33 ms
[2025-06-02 21:43:34] [INFO ] Time to serialize properties into /tmp/UpperBounds15088066948962517214.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/UpperBounds12241941167660427116.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15088066948962517214.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 ...285
Loading property file /tmp/UpperBounds15088066948962517214.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:51:09] [INFO ] Flatten gal took : 209 ms
[2025-06-02 21:51:09] [INFO ] Time to serialize gal into /tmp/UpperBounds3758541934287426511.gal : 40 ms
[2025-06-02 21:51:09] [INFO ] Time to serialize properties into /tmp/UpperBounds1188270787314387902.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/UpperBounds3758541934287426511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1188270787314387902.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 ...304
Loading property file /tmp/UpperBounds1188270787314387902.prop.
ITS-tools command line returned an error code 137
[2025-06-02 21:59:28] [INFO ] Flatten gal took : 207 ms
[2025-06-02 21:59:28] [INFO ] Input system was already deterministic with 4002 transitions.
[2025-06-02 21:59:28] [INFO ] Transformed 976 places.
[2025-06-02 21:59:28] [INFO ] Transformed 4002 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 21:59:29] [INFO ] Time to serialize gal into /tmp/UpperBounds740105167027647182.gal : 32 ms
[2025-06-02 21:59:29] [INFO ] Time to serialize properties into /tmp/UpperBounds15503007866756038235.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/UpperBounds740105167027647182.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15503007866756038235.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15503007866756038235.prop.
ITS-tools command line returned an error code 137
Total runtime 3048630 ms.

BK_STOP 1748902084510

--------------------
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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;