Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 18K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 05:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 05:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 12 05:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716569104204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 16:45:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 16:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:45:05] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2024-05-24 16:45:05] [INFO ] Transformed 4914 places.
[2024-05-24 16:45:05] [INFO ] Transformed 6913 transitions.
[2024-05-24 16:45:05] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 499 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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]
[2024-05-24 16:45:05] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2024-05-24 16:45:06] [INFO ] Computed 535 invariants in 408 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:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
RANDOM walk for 10000 steps (192 resets) in 130 ms. (76 steps per ms)
BEST_FIRST walk for 160015 steps (800 resets) in 537 ms. (297 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[2, 17, 51, 51, 1, 17, 1, 51, 1, 51, 17, 17, 17, 51, 17, 17]
[2024-05-24 16:45:07] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2024-05-24 16:45:07] [INFO ] Invariant cache hit.
[2024-05-24 16:45:07] [INFO ] [Real]Absence check using 48 positive place invariants in 79 ms returned sat
[2024-05-24 16:45:08] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 164 ms returned unsat
[2024-05-24 16:45:08] [INFO ] [Real]Absence check using 48 positive place invariants in 74 ms returned sat
[2024-05-24 16:45:08] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 44 ms returned unsat
[2024-05-24 16:45:09] [INFO ] [Real]Absence check using 48 positive place invariants in 94 ms returned sat
[2024-05-24 16:45:09] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 170 ms returned unsat
[2024-05-24 16:45:09] [INFO ] [Real]Absence check using 48 positive place invariants in 70 ms returned sat
[2024-05-24 16:45:10] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 170 ms returned sat
[2024-05-24 16:45:13] [INFO ] [Real]Absence check using state equation in 3711 ms returned sat
[2024-05-24 16:45:14] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:45:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:45:14] [INFO ] [Real]Added 1906 Read/Feed constraints in 215 ms returned unknown
[2024-05-24 16:45:14] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:45:15] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 162 ms returned sat
[2024-05-24 16:45:17] [INFO ] [Real]Absence check using state equation in 2010 ms returned sat
[2024-05-24 16:45:17] [INFO ] [Real]Added 1906 Read/Feed constraints in 149 ms returned sat
[2024-05-24 16:45:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:45:18] [INFO ] [Nat]Absence check using 48 positive place invariants in 67 ms returned sat
[2024-05-24 16:45:18] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 157 ms returned sat
[2024-05-24 16:45:20] [INFO ] [Nat]Absence check using state equation in 2138 ms returned sat
[2024-05-24 16:45:20] [INFO ] [Nat]Added 1906 Read/Feed constraints in 365 ms returned sat
[2024-05-24 16:45:26] [INFO ] Deduced a trap composed of 782 places in 4954 ms of which 229 ms to minimize.
[2024-05-24 16:45:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 16:45:26] [INFO ] [Real]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-24 16:45:26] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 44 ms returned unsat
[2024-05-24 16:45:27] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:45:27] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 160 ms returned sat
[2024-05-24 16:45:31] [INFO ] [Real]Absence check using state equation in 4300 ms returned unknown
[2024-05-24 16:45:32] [INFO ] [Real]Absence check using 48 positive place invariants in 63 ms returned sat
[2024-05-24 16:45:32] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 164 ms returned sat
[2024-05-24 16:45:36] [INFO ] [Real]Absence check using state equation in 3939 ms returned sat
[2024-05-24 16:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:45:37] [INFO ] [Nat]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:45:37] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 159 ms returned sat
[2024-05-24 16:45:41] [INFO ] [Nat]Absence check using state equation in 3974 ms returned sat
[2024-05-24 16:45:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:45:41] [INFO ] [Nat]Added 1906 Read/Feed constraints in 382 ms returned unknown
[2024-05-24 16:45:42] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-24 16:45:42] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 160 ms returned sat
[2024-05-24 16:45:45] [INFO ] [Real]Absence check using state equation in 3281 ms returned sat
[2024-05-24 16:45:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:45:46] [INFO ] [Real]Added 1906 Read/Feed constraints in 676 ms returned unsat
[2024-05-24 16:45:46] [INFO ] [Real]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-24 16:45:47] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 161 ms returned sat
[2024-05-24 16:45:50] [INFO ] [Real]Absence check using state equation in 3635 ms returned sat
[2024-05-24 16:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:45:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:45:51] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 157 ms returned sat
[2024-05-24 16:45:55] [INFO ] [Nat]Absence check using state equation in 3822 ms returned sat
[2024-05-24 16:45:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:45:56] [INFO ] [Nat]Added 1906 Read/Feed constraints in 552 ms returned unknown
[2024-05-24 16:45:56] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:45:56] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 163 ms returned sat
[2024-05-24 16:46:00] [INFO ] [Real]Absence check using state equation in 4184 ms returned sat
[2024-05-24 16:46:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
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)
[2024-05-24 16:46:01] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-24 16:46:01] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 44 ms returned unsat
[2024-05-24 16:46:02] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:46:02] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 144 ms returned unsat
[2024-05-24 16:46:02] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:46:03] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 157 ms returned sat
[2024-05-24 16:46:06] [INFO ] [Real]Absence check using state equation in 3721 ms returned sat
[2024-05-24 16:46:07] [INFO ] [Real]Added 1906 Read/Feed constraints in 138 ms returned sat
[2024-05-24 16:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:46:07] [INFO ] [Nat]Absence check using 48 positive place invariants in 65 ms returned sat
[2024-05-24 16:46:08] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 157 ms returned sat
[2024-05-24 16:46:11] [INFO ] [Nat]Absence check using state equation in 3695 ms returned sat
[2024-05-24 16:46:12] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:46:12] [INFO ] [Nat]Added 1906 Read/Feed constraints in 616 ms returned unknown
[2024-05-24 16:46:12] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2024-05-24 16:46:12] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 47 ms returned unsat
[2024-05-24 16:46:13] [INFO ] [Real]Absence check using 48 positive place invariants in 62 ms returned sat
[2024-05-24 16:46:13] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 65 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1] Max Struct:[1, 1, 1, 51, 1, 1, 1, 51, 0, 51, 17, 1, 1, 51, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 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] Max Struct:[51, 1, 1, 51, 51, 17, 51]
Support contains 7 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.19 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1355 transitions
Trivial Post-agglo rules discarded 1355 transitions
Performed 1355 trivial Post agglomeration. Transition count delta: 1355
Iterating post reduction 0 with 1355 rules applied. Total rules applied 1356 place count 4884 transition count 5558
Reduce places removed 1355 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2715 place count 3529 transition count 5554
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 2719 place count 3525 transition count 5554
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2719 place count 3525 transition count 5384
Deduced a syphon composed of 170 places in 4 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3059 place count 3355 transition count 5384
Discarding 1185 places :
Symmetric choice reduction at 3 with 1185 rule applications. Total rules 4244 place count 2170 transition count 4199
Iterating global reduction 3 with 1185 rules applied. Total rules applied 5429 place count 2170 transition count 4199
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5429 place count 2170 transition count 4191
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5445 place count 2162 transition count 4191
Discarding 233 places :
Symmetric choice reduction at 3 with 233 rule applications. Total rules 5678 place count 1929 transition count 3026
Iterating global reduction 3 with 233 rules applied. Total rules applied 5911 place count 1929 transition count 3026
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5945 place count 1912 transition count 3009
Free-agglomeration rule (complex) applied 165 times.
Iterating global reduction 3 with 165 rules applied. Total rules applied 6110 place count 1912 transition count 3776
Reduce places removed 165 places and 0 transitions.
Iterating post reduction 3 with 165 rules applied. Total rules applied 6275 place count 1747 transition count 3776
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6309 place count 1747 transition count 3776
Applied a total of 6309 rules in 1482 ms. Remains 1747 /4914 variables (removed 3167) and now considering 3776/6913 (removed 3137) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1492 ms. Remains : 1747/4914 places, 3776/6913 transitions.
[2024-05-24 16:46:15] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
// Phase 1: matrix 3378 rows 1747 cols
[2024-05-24 16:46:15] [INFO ] Computed 505 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[2, 1, 1, 2, 2, 1, 2]
RANDOM walk for 1000000 steps (31864 resets) in 14087 ms. (70 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000005 steps (34013 resets) in 19090 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 1, 1, 1] Max Struct:[2, 1, 1, 2, 2, 2]
[2024-05-24 16:46:48] [INFO ] Flow matrix only has 3378 transitions (discarded 398 similar events)
[2024-05-24 16:46:48] [INFO ] Invariant cache hit.
[2024-05-24 16:46:48] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-24 16:46:48] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 34 ms returned unsat
[2024-05-24 16:46:48] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-24 16:46:48] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 74 ms returned sat
[2024-05-24 16:46:49] [INFO ] [Real]Absence check using state equation in 948 ms returned sat
[2024-05-24 16:46:49] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:46:50] [INFO ] [Real]Added 1906 Read/Feed constraints in 361 ms returned sat
[2024-05-24 16:46:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:46:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-24 16:46:50] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2024-05-24 16:46:51] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2024-05-24 16:46:53] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1369 ms returned sat
[2024-05-24 16:46:55] [INFO ] Deduced a trap composed of 195 places in 2568 ms of which 41 ms to minimize.
[2024-05-24 16:46:57] [INFO ] Deduced a trap composed of 377 places in 1207 ms of which 22 ms to minimize.
[2024-05-24 16:46:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4105 ms
[2024-05-24 16:46:57] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 301 ms.
[2024-05-24 16:46:59] [INFO ] Added : 26 causal constraints over 7 iterations in 2010 ms. Result :sat
Minimization took 5955 ms.
[2024-05-24 16:47:05] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2024-05-24 16:47:05] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 75 ms returned sat
[2024-05-24 16:47:06] [INFO ] [Real]Absence check using state equation in 1020 ms returned sat
[2024-05-24 16:47:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:47:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2024-05-24 16:47:06] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 77 ms returned sat
[2024-05-24 16:47:07] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2024-05-24 16:47:09] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1305 ms returned sat
[2024-05-24 16:47:10] [INFO ] Deduced a trap composed of 318 places in 1175 ms of which 11 ms to minimize.
[2024-05-24 16:47:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1391 ms
[2024-05-24 16:47:10] [INFO ] Computed and/alt/rep : 1580/3623/1580 causal constraints (skipped 1781 transitions) in 261 ms.
[2024-05-24 16:47:11] [INFO ] Added : 13 causal constraints over 3 iterations in 1176 ms. Result :sat
Minimization took 5862 ms.
[2024-05-24 16:47:17] [INFO ] [Real]Absence check using 33 positive place invariants in 48 ms returned sat
[2024-05-24 16:47:17] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 95 ms returned unsat
[2024-05-24 16:47:18] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 16:47:18] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 47 ms returned unsat
[2024-05-24 16:47:18] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2024-05-24 16:47:18] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 1, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 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 1747 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1747/1747 places, 3776/3776 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 1747 transition count 3775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1746 transition count 3775
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1746 transition count 3773
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 1744 transition count 3773
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 11 place count 1739 transition count 3768
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 1739 transition count 3768
Applied a total of 16 rules in 341 ms. Remains 1739 /1747 variables (removed 8) and now considering 3768/3776 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 1739/1747 places, 3768/3776 transitions.
[2024-05-24 16:47:18] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
// Phase 1: matrix 3370 rows 1739 cols
[2024-05-24 16:47:18] [INFO ] Computed 505 invariants in 59 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (31867 resets) in 13574 ms. (73 steps per ms)
BEST_FIRST walk for 2000002 steps (11338 resets) in 6030 ms. (331 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 16:47:38] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-24 16:47:38] [INFO ] Invariant cache hit.
[2024-05-24 16:47:38] [INFO ] [Real]Absence check using 33 positive place invariants in 36 ms returned sat
[2024-05-24 16:47:38] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 70 ms returned sat
[2024-05-24 16:47:39] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2024-05-24 16:47:39] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:47:40] [INFO ] [Real]Added 1906 Read/Feed constraints in 356 ms returned sat
[2024-05-24 16:47:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:47:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-24 16:47:40] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 84 ms returned sat
[2024-05-24 16:47:41] [INFO ] [Nat]Absence check using state equation in 902 ms returned sat
[2024-05-24 16:47:43] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1834 ms returned sat
[2024-05-24 16:47:44] [INFO ] Deduced a trap composed of 367 places in 1173 ms of which 12 ms to minimize.
[2024-05-24 16:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1381 ms
[2024-05-24 16:47:44] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 194 ms.
[2024-05-24 16:47:46] [INFO ] Added : 30 causal constraints over 9 iterations in 2388 ms. Result :sat
Minimization took 5844 ms.
[2024-05-24 16:47:53] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2024-05-24 16:47:53] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 74 ms returned sat
[2024-05-24 16:47:53] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2024-05-24 16:47:54] [INFO ] [Real]Added 1906 Read/Feed constraints in 310 ms returned sat
[2024-05-24 16:47:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:47:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 64 ms returned sat
[2024-05-24 16:47:54] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 73 ms returned sat
[2024-05-24 16:47:55] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2024-05-24 16:47:57] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1559 ms returned sat
[2024-05-24 16:47:58] [INFO ] Deduced a trap composed of 288 places in 1150 ms of which 11 ms to minimize.
[2024-05-24 16:47:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1346 ms
[2024-05-24 16:47:58] [INFO ] Computed and/alt/rep : 1574/3612/1574 causal constraints (skipped 1779 transitions) in 187 ms.
[2024-05-24 16:47:59] [INFO ] Added : 15 causal constraints over 3 iterations in 901 ms. Result :sat
Minimization took 5836 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 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 132 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 1739/1739 places, 3768/3768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 3768/3768 transitions.
Applied a total of 0 rules in 202 ms. Remains 1739 /1739 variables (removed 0) and now considering 3768/3768 (removed 0) transitions.
[2024-05-24 16:48:05] [INFO ] Flow matrix only has 3370 transitions (discarded 398 similar events)
[2024-05-24 16:48:05] [INFO ] Invariant cache hit.
[2024-05-24 16:48:09] [INFO ] Implicit Places using invariants in 3872 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 372, 376, 378, 380, 382, 395, 401, 403, 404, 405, 406, 407, 408, 410, 412, 414, 418, 424, 432, 441, 449, 450, 451, 452, 453, 454, 460, 464, 466, 468, 470, 472, 485, 491, 493, 494, 495, 496, 497, 498, 500, 502, 504, 506, 510, 516, 523, 529, 530, 531, 532, 533, 534, 538, 540, 542, 544, 546, 548, 561, 567, 569, 570, 571, 572, 573, 574, 576, 578, 580, 582, 584, 588, 593, 597, 598, 599, 600, 601, 602, 604, 606, 608, 610, 612, 614, 627, 633, 635, 636, 637, 638, 639, 640, 642, 644, 646, 648, 650, 652, 655, 657, 658, 659, 660, 661, 662, 664, 666, 668, 670, 672, 674, 687, 693, 695, 696, 697, 698, 699, 700, 702, 704, 706, 708, 710, 712, 714, 716, 717, 718, 719, 720, 721, 723, 725, 727, 729, 731, 733, 746, 748, 751, 753, 754, 755, 756, 757, 758, 760, 762, 764, 766, 768, 770, 772, 774, 775, 776, 777, 778, 779, 781, 783, 785, 787, 789, 791, 804, 810, 812, 813, 814, 815, 816, 817, 819, 821, 823, 825, 827, 829, 831, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 863, 869, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 890, 893, 894, 895, 896, 897, 898, 900, 902, 904, 906, 908, 910, 923, 929, 931, 932, 933, 934, 935, 936, 938, 940, 942, 944, 946, 948, 952, 957, 958, 959, 960, 961, 962, 966, 968, 970, 972, 974, 976, 989, 995, 997, 998, 999, 1000, 1001, 1002, 1004, 1006, 1008, 1010, 1012, 1016, 1022, 1029, 1030, 1031, 1032, 1033, 1034, 1040, 1044, 1046, 1048, 1050, 1052, 1065, 1071, 1073, 1074, 1075, 1076, 1077, 1078, 1080, 1082, 1084, 1086, 1090, 1096, 1104, 1113, 1114, 1115, 1116, 1117, 1118, 1126, 1132, 1136, 1138, 1140, 1142, 1155, 1161, 1163, 1164, 1165, 1166, 1167, 1168, 1170, 1172, 1174, 1178, 1184, 1192, 1202, 1213, 1214, 1215, 1216, 1217, 1218, 1228, 1236, 1242, 1246, 1248, 1250, 1263, 1269, 1271, 1272, 1273, 1274, 1275, 1276, 1278, 1280, 1284, 1290, 1298, 1308, 1320, 1333, 1334, 1335, 1336, 1337, 1338, 1350, 1360, 1368, 1374, 1378, 1380, 1393, 1395, 1398, 1400, 1401, 1402, 1403, 1404, 1405, 1407, 1411, 1417, 1425, 1435, 1447, 1461, 1476, 1477, 1478, 1479, 1480, 1481, 1495, 1507, 1517, 1525, 1531, 1535, 1548]
[2024-05-24 16:48:09] [INFO ] Actually due to overlaps returned [157, 287, 395, 485, 561, 627, 687, 746, 804, 863, 923, 989, 1065, 1155, 1263, 1393, 1548, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 403, 404, 405, 406, 407, 449, 450, 451, 452, 453, 493, 494, 495, 496, 497, 529, 530, 531, 532, 533, 569, 570, 571, 572, 573, 597, 598, 599, 600, 601, 635, 636, 637, 638, 639, 657, 658, 659, 660, 661, 695, 696, 697, 698, 699, 716, 717, 718, 719, 720, 748, 753, 754, 755, 756, 757, 774, 775, 776, 777, 778, 812, 813, 814, 815, 816, 833, 834, 835, 836, 837, 871, 872, 873, 874, 875, 893, 894, 895, 896, 897, 931, 932, 933, 934, 935, 957, 958, 959, 960, 961, 997, 998, 999, 1000, 1001, 1029, 1030, 1031, 1032, 1033, 1073, 1074, 1075, 1076, 1077, 1113, 1114, 1115, 1116, 1117, 1163, 1164, 1165, 1166, 1167, 1213, 1214, 1215, 1216, 1217, 1271, 1272, 1273, 1274, 1275, 1333, 1334, 1335, 1336, 1337, 1395, 1400, 1401, 1402, 1403, 1404, 1476, 1477, 1478, 1479, 1480]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 3890 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1549/1739 places, 3768/3768 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1389 transition count 3608
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1389 transition count 3608
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1229 transition count 3448
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1229 transition count 3448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1229 transition count 3445
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1226 transition count 3445
Applied a total of 646 rules in 354 ms. Remains 1226 /1549 variables (removed 323) and now considering 3445/3768 (removed 323) transitions.
[2024-05-24 16:48:09] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 1226 cols
[2024-05-24 16:48:09] [INFO ] Computed 315 invariants in 37 ms
[2024-05-24 16:48:12] [INFO ] Implicit Places using invariants in 2268 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 328, 332, 334, 336, 338, 346, 348, 350, 352, 354, 358, 364, 372, 381, 389, 395, 399, 401, 403, 405, 407, 415, 417, 419, 421, 423, 425, 429, 435, 442, 448, 452, 454, 456, 458, 460, 462, 470, 472, 474, 476, 478, 480, 482, 486, 491, 495, 497, 499, 501, 503, 505, 507, 515, 517, 519, 521, 523, 525, 527, 529, 532, 534, 536, 538, 540, 542, 544, 546, 554, 556, 558, 560, 562, 564, 566, 568, 570, 572, 574, 576, 578, 580, 582, 584, 590, 592, 594, 596, 598, 600, 602, 604, 606, 608, 610, 612, 614, 616, 618, 620, 627, 629, 631, 633, 635, 637, 639, 641, 643, 645, 647, 649, 651, 653, 655, 657, 665, 667, 669, 671, 673, 675, 677, 679, 681, 684, 686, 688, 690, 692, 694, 696, 704, 706, 708, 710, 712, 714, 716, 718, 722, 727, 731, 733, 735, 737, 739, 741, 749, 751, 753, 755, 757, 759, 761, 765, 771, 778, 784, 788, 790, 792, 794, 796, 804, 806, 808, 810, 812, 814, 818, 824, 832, 841, 849, 855, 859, 861, 863, 865, 873, 875, 877, 879, 881, 885, 891, 899, 909, 920, 930, 938, 944, 948, 950, 952, 960, 962, 964, 966, 970, 976, 984, 994, 1006, 1019, 1031, 1041, 1049, 1055, 1059, 1061, 1067, 1069, 1071, 1075, 1081, 1089, 1099, 1111, 1125, 1140, 1154, 1166, 1176, 1184, 1190, 1194]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2280 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1739 places, 3445/3768 transitions.
Applied a total of 0 rules in 95 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6859 ms. Remains : 954/1739 places, 3445/3768 transitions.
[2024-05-24 16:48:12] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-24 16:48:12] [INFO ] Computed 43 invariants in 30 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (34069 resets) in 12887 ms. (77 steps per ms)
BEST_FIRST walk for 2000002 steps (8055 resets) in 4176 ms. (478 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-24 16:48:29] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:48:29] [INFO ] Invariant cache hit.
[2024-05-24 16:48:29] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:48:29] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:48:30] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2024-05-24 16:48:30] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:48:30] [INFO ] [Real]Added 1906 Read/Feed constraints in 321 ms returned sat
[2024-05-24 16:48:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:48:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:48:30] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:48:31] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2024-05-24 16:48:32] [INFO ] [Nat]Added 1906 Read/Feed constraints in 741 ms returned sat
[2024-05-24 16:48:32] [INFO ] Deduced a trap composed of 207 places in 451 ms of which 5 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Deduced a trap composed of 98 places in 500 ms of which 5 ms to minimize.
[2024-05-24 16:48:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1168 ms
[2024-05-24 16:48:33] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 170 ms.
[2024-05-24 16:48:33] [INFO ] Added : 14 causal constraints over 3 iterations in 650 ms. Result :sat
Minimization took 6253 ms.
[2024-05-24 16:48:40] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:48:40] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:48:40] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2024-05-24 16:48:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:48:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-24 16:48:41] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:48:41] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2024-05-24 16:48:42] [INFO ] [Nat]Added 1906 Read/Feed constraints in 800 ms returned sat
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 236 places in 456 ms of which 5 ms to minimize.
[2024-05-24 16:48:43] [INFO ] Deduced a trap composed of 88 places in 524 ms of which 5 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Deduced a trap composed of 66 places in 528 ms of which 5 ms to minimize.
[2024-05-24 16:48:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1806 ms
[2024-05-24 16:48:44] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 188 ms.
[2024-05-24 16:48:45] [INFO ] Added : 11 causal constraints over 3 iterations in 692 ms. Result :sat
Minimization took 6159 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 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 89 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 82 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-24 16:48:51] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:48:51] [INFO ] Invariant cache hit.
[2024-05-24 16:48:52] [INFO ] Implicit Places using invariants in 1046 ms returned []
[2024-05-24 16:48:52] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:48:52] [INFO ] Invariant cache hit.
[2024-05-24 16:48:53] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:49:21] [INFO ] Implicit Places using invariants and state equation in 29439 ms returned []
Implicit Place search using SMT with State Equation took 30514 ms to find 0 implicit places.
[2024-05-24 16:49:22] [INFO ] Redundant transitions in 188 ms returned []
Running 3383 sub problems to find dead transitions.
[2024-05-24 16:49:22] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:49:22] [INFO ] Invariant cache hit.
[2024-05-24 16:49:22] [INFO ] State equation strengthened by 1906 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/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 48924ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 49038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79878 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1360 resets) in 1867 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (158 resets) in 406 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (158 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (161 resets) in 492 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (160 resets) in 263 ms. (151 steps per ms) remains 4/4 properties
[2024-05-24 16:50:12] [INFO ] Flatten gal took : 517 ms
[2024-05-24 16:50:12] [INFO ] Flatten gal took : 180 ms
[2024-05-24 16:50:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12307781979243796222.gal : 122 ms
[2024-05-24 16:50:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2670251503633462766.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/ReachabilityCardinality12307781979243796222.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2670251503633462766.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2670251503633462766.prop.
Interrupted probabilistic random walk after 56617 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :0 out of 4
Probabilistic random walk after 56617 steps, saw 23688 distinct states, run finished after 3005 ms. (steps per millisecond=18 ) properties seen :0
[2024-05-24 16:50:15] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:50:15] [INFO ] Invariant cache hit.
[2024-05-24 16:50:15] [INFO ] State equation strengthened by 1906 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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :37 after 72
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :72 after 74
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :148 after 151
[2024-05-24 16:50:16] [INFO ] Deduced a trap composed of 75 places in 513 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :151 after 282
[2024-05-24 16:50:16] [INFO ] Deduced a trap composed of 165 places in 480 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :282 after 430
[2024-05-24 16:50:17] [INFO ] Deduced a trap composed of 239 places in 465 ms of which 5 ms to minimize.
[2024-05-24 16:50:17] [INFO ] Deduced a trap composed of 209 places in 457 ms of which 5 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :430 after 696
[2024-05-24 16:50:18] [INFO ] Deduced a trap composed of 139 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:50:18] [INFO ] Deduced a trap composed of 166 places in 459 ms of which 6 ms to minimize.
[2024-05-24 16:50:19] [INFO ] Deduced a trap composed of 209 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:50:19] [INFO ] Deduced a trap composed of 158 places in 520 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :696 after 1208
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 1005 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 954/954 constraints, ReadFeed: 0/1906 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:21] [INFO ] Deduced a trap composed of 129 places in 442 ms of which 5 ms to minimize.
[2024-05-24 16:50:21] [INFO ] Deduced a trap composed of 175 places in 441 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/916 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:22] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 6 ms to minimize.
[2024-05-24 16:50:22] [INFO ] Deduced a trap composed of 27 places in 415 ms of which 5 ms to minimize.
[2024-05-24 16:50:23] [INFO ] Deduced a trap composed of 27 places in 428 ms of which 6 ms to minimize.
[2024-05-24 16:50:23] [INFO ] Deduced a trap composed of 57 places in 504 ms of which 6 ms to minimize.
[2024-05-24 16:50:24] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 6 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1208 after 2256
[2024-05-24 16:50:24] [INFO ] Deduced a trap composed of 138 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:50:25] [INFO ] Deduced a trap composed of 123 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:50:25] [INFO ] Deduced a trap composed of 128 places in 415 ms of which 5 ms to minimize.
SMT process timed out in 10165ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 90 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 954/954 places, 3445/3445 transitions.
RANDOM walk for 40000 steps (1360 resets) in 1267 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (155 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (159 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (161 resets) in 185 ms. (215 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 63565 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 4
Probabilistic random walk after 63565 steps, saw 26557 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2024-05-24 16:50:29] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:50:29] [INFO ] Invariant cache hit.
[2024-05-24 16:50:29] [INFO ] State equation strengthened by 1906 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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:30] [INFO ] Deduced a trap composed of 75 places in 482 ms of which 5 ms to minimize.
[2024-05-24 16:50:30] [INFO ] Deduced a trap composed of 165 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:50:31] [INFO ] Deduced a trap composed of 239 places in 501 ms of which 6 ms to minimize.
[2024-05-24 16:50:31] [INFO ] Deduced a trap composed of 209 places in 494 ms of which 5 ms to minimize.
[2024-05-24 16:50:32] [INFO ] Deduced a trap composed of 139 places in 505 ms of which 5 ms to minimize.
[2024-05-24 16:50:32] [INFO ] Deduced a trap composed of 166 places in 493 ms of which 9 ms to minimize.
[2024-05-24 16:50:33] [INFO ] Deduced a trap composed of 209 places in 492 ms of which 5 ms to minimize.
[2024-05-24 16:50:33] [INFO ] Deduced a trap composed of 158 places in 490 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/916 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/916 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 28/944 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/944 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/954 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/954 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3047/4001 variables, 954/1005 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4001 variables, 1906/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :2256 after 5133
At refinement iteration 14 (INCLUDED_ONLY) 0/4001 variables, 0/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/4001 variables, 0/2911 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4001/4001 variables, and 2911 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6202 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 954/954 constraints, ReadFeed: 1906/1906 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
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) 868/870 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/870 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 18/888 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:36] [INFO ] Deduced a trap composed of 129 places in 887 ms of which 11 ms to minimize.
[2024-05-24 16:50:37] [INFO ] Deduced a trap composed of 175 places in 902 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/888 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/888 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 28/916 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:38] [INFO ] Deduced a trap composed of 5 places in 850 ms of which 13 ms to minimize.
[2024-05-24 16:50:39] [INFO ] Deduced a trap composed of 27 places in 838 ms of which 14 ms to minimize.
[2024-05-24 16:50:40] [INFO ] Deduced a trap composed of 27 places in 809 ms of which 11 ms to minimize.
[2024-05-24 16:50:41] [INFO ] Deduced a trap composed of 57 places in 664 ms of which 9 ms to minimize.
[2024-05-24 16:50:41] [INFO ] Deduced a trap composed of 46 places in 658 ms of which 5 ms to minimize.
[2024-05-24 16:50:42] [INFO ] Deduced a trap composed of 138 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:50:42] [INFO ] Deduced a trap composed of 123 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:50:43] [INFO ] Deduced a trap composed of 128 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:50:43] [INFO ] Deduced a trap composed of 62 places in 458 ms of which 6 ms to minimize.
[2024-05-24 16:50:44] [INFO ] Deduced a trap composed of 149 places in 467 ms of which 6 ms to minimize.
[2024-05-24 16:50:44] [INFO ] Deduced a trap composed of 101 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:50:45] [INFO ] Deduced a trap composed of 118 places in 518 ms of which 7 ms to minimize.
[2024-05-24 16:50:45] [INFO ] Deduced a trap composed of 134 places in 525 ms of which 5 ms to minimize.
[2024-05-24 16:50:46] [INFO ] Deduced a trap composed of 129 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:50:47] [INFO ] Deduced a trap composed of 141 places in 518 ms of which 6 ms to minimize.
[2024-05-24 16:50:47] [INFO ] Deduced a trap composed of 64 places in 537 ms of which 6 ms to minimize.
[2024-05-24 16:50:48] [INFO ] Deduced a trap composed of 60 places in 521 ms of which 5 ms to minimize.
[2024-05-24 16:50:48] [INFO ] Deduced a trap composed of 69 places in 594 ms of which 18 ms to minimize.
[2024-05-24 16:50:49] [INFO ] Deduced a trap composed of 140 places in 887 ms of which 11 ms to minimize.
[2024-05-24 16:50:50] [INFO ] Deduced a trap composed of 137 places in 1033 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/916 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:50:51] [INFO ] Deduced a trap composed of 61 places in 1068 ms of which 9 ms to minimize.
[2024-05-24 16:50:52] [INFO ] Deduced a trap composed of 130 places in 1000 ms of which 11 ms to minimize.
[2024-05-24 16:50:53] [INFO ] Deduced a trap composed of 94 places in 961 ms of which 11 ms to minimize.
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :5133 after 10233
[2024-05-24 16:50:54] [INFO ] Deduced a trap composed of 62 places in 1014 ms of which 11 ms to minimize.
[2024-05-24 16:51:02] [INFO ] Deduced a trap composed of 63 places in 7412 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 16:51:03] [INFO ] Flatten gal took : 267 ms
[2024-05-24 16:51:03] [INFO ] Applying decomposition
[2024-05-24 16:51:03] [INFO ] Flatten gal took : 223 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/graph16989338676744497148.txt' '-o' '/tmp/graph16989338676744497148.bin' '-w' '/tmp/graph16989338676744497148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16989338676744497148.bin' '-l' '-1' '-v' '-w' '/tmp/graph16989338676744497148.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:51:04] [INFO ] Decomposing Gal with order
[2024-05-24 16:51:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:51:05] [INFO ] Deduced a trap composed of 65 places in 3484 ms of which 18 ms to minimize.
[2024-05-24 16:51:06] [INFO ] Removed a total of 5794 redundant transitions.
[2024-05-24 16:51:06] [INFO ] Flatten gal took : 1685 ms
[2024-05-24 16:51:06] [INFO ] Deduced a trap composed of 70 places in 986 ms of which 6 ms to minimize.
[2024-05-24 16:51:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 2361 labels/synchronizations in 306 ms.
[2024-05-24 16:51:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18120180386159967520.gal : 47 ms
[2024-05-24 16:51:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9916222201747037944.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/ReachabilityCardinality18120180386159967520.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9916222201747037944.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
Loading property file /tmp/ReachabilityCardinality9916222201747037944.prop.
[2024-05-24 16:51:07] [INFO ] Deduced a trap composed of 69 places in 843 ms of which 5 ms to minimize.
[2024-05-24 16:51:08] [INFO ] Deduced a trap composed of 71 places in 570 ms of which 6 ms to minimize.
[2024-05-24 16:51:09] [INFO ] Deduced a trap composed of 79 places in 554 ms of which 6 ms to minimize.
[2024-05-24 16:51:09] [INFO ] Deduced a trap composed of 95 places in 563 ms of which 8 ms to minimize.
[2024-05-24 16:51:10] [INFO ] Deduced a trap composed of 64 places in 898 ms of which 12 ms to minimize.
[2024-05-24 16:51:11] [INFO ] Deduced a trap composed of 67 places in 905 ms of which 6 ms to minimize.
[2024-05-24 16:51:12] [INFO ] Deduced a trap composed of 66 places in 897 ms of which 6 ms to minimize.
[2024-05-24 16:51:13] [INFO ] Deduced a trap composed of 67 places in 937 ms of which 12 ms to minimize.
[2024-05-24 16:51:14] [INFO ] Deduced a trap composed of 64 places in 921 ms of which 7 ms to minimize.
[2024-05-24 16:51:15] [INFO ] Deduced a trap composed of 68 places in 917 ms of which 7 ms to minimize.
[2024-05-24 16:51:15] [INFO ] Deduced a trap composed of 64 places in 636 ms of which 6 ms to minimize.
[2024-05-24 16:51:16] [INFO ] Deduced a trap composed of 71 places in 958 ms of which 7 ms to minimize.
[2024-05-24 16:51:17] [INFO ] Deduced a trap composed of 62 places in 936 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/916 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 16:51:18] [INFO ] Deduced a trap composed of 70 places in 934 ms of which 10 ms to minimize.
[2024-05-24 16:51:19] [INFO ] Deduced a trap composed of 68 places in 946 ms of which 10 ms to minimize.
[2024-05-24 16:51:20] [INFO ] Deduced a trap composed of 65 places in 968 ms of which 6 ms to minimize.
SMT process timed out in 51406ms, 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 954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 105 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 954/954 places, 3445/3445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3445/3445 transitions.
Applied a total of 0 rules in 81 ms. Remains 954 /954 variables (removed 0) and now considering 3445/3445 (removed 0) transitions.
[2024-05-24 16:51:21] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:51:21] [INFO ] Invariant cache hit.
[2024-05-24 16:51:22] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2024-05-24 16:51:22] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:51:22] [INFO ] Invariant cache hit.
[2024-05-24 16:51:23] [INFO ] State equation strengthened by 1906 read => feed constraints.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1305
[2024-05-24 16:51:53] [INFO ] Implicit Places using invariants and state equation in 31001 ms returned []
Implicit Place search using SMT with State Equation took 32421 ms to find 0 implicit places.
[2024-05-24 16:51:53] [INFO ] Redundant transitions in 144 ms returned []
Running 3383 sub problems to find dead transitions.
[2024-05-24 16:51:53] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:51:53] [INFO ] Invariant cache hit.
[2024-05-24 16:51:53] [INFO ] State equation strengthened by 1906 read => feed constraints.
Detected timeout of ITS tools.
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/952 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 3383 unsolved
SMT process timed out in 49687ms, After SMT, problems are : Problem set: 0 solved, 3383 unsolved
Search for dead transitions found 0 dead transitions in 49724ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82399 ms. Remains : 954/954 places, 3445/3445 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-S16C05-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:52:43] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:52:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (340 resets) in 139 ms. (71 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 23 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:52:43] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:52:43] [INFO ] Invariant cache hit.
[2024-05-24 16:52:43] [INFO ] [Real]Absence check using 31 positive place invariants in 21 ms returned sat
[2024-05-24 16:52:43] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:52:44] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2024-05-24 16:52:44] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:52:44] [INFO ] [Real]Added 1906 Read/Feed constraints in 307 ms returned sat
[2024-05-24 16:52:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:52:44] [INFO ] [Nat]Absence check using 31 positive place invariants in 29 ms returned sat
[2024-05-24 16:52:44] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:52:45] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-24 16:52:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:52:46] [INFO ] [Nat]Added 1906 Read/Feed constraints in 929 ms returned sat
[2024-05-24 16:52:47] [INFO ] Deduced a trap composed of 98 places in 526 ms of which 6 ms to minimize.
[2024-05-24 16:52:47] [INFO ] Deduced a trap composed of 207 places in 466 ms of which 5 ms to minimize.
[2024-05-24 16:52:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1209 ms
[2024-05-24 16:52:47] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 171 ms.
[2024-05-24 16:52:48] [INFO ] Added : 14 causal constraints over 3 iterations in 649 ms. Result :sat
Minimization took 1166 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 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Applied a total of 2 rules in 104 ms. Remains 952 /954 variables (removed 2) and now considering 3439/3443 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 952/954 places, 3439/3443 transitions.
[2024-05-24 16:52:49] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
// Phase 1: matrix 3041 rows 952 cols
[2024-05-24 16:52:49] [INFO ] Computed 43 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34073 resets) in 13026 ms. (76 steps per ms)
BEST_FIRST walk for 1000000 steps (4034 resets) in 2124 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:53:04] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:53:04] [INFO ] Invariant cache hit.
[2024-05-24 16:53:04] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2024-05-24 16:53:04] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-24 16:53:05] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2024-05-24 16:53:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:53:05] [INFO ] [Nat]Absence check using 31 positive place invariants in 22 ms returned sat
[2024-05-24 16:53:05] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-24 16:53:06] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2024-05-24 16:53:06] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-24 16:53:07] [INFO ] [Nat]Added 1903 Read/Feed constraints in 806 ms returned sat
[2024-05-24 16:53:07] [INFO ] Deduced a trap composed of 201 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:53:08] [INFO ] Deduced a trap composed of 77 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:53:08] [INFO ] Deduced a trap composed of 72 places in 511 ms of which 5 ms to minimize.
[2024-05-24 16:53:09] [INFO ] Deduced a trap composed of 67 places in 520 ms of which 5 ms to minimize.
[2024-05-24 16:53:10] [INFO ] Deduced a trap composed of 71 places in 513 ms of which 5 ms to minimize.
[2024-05-24 16:53:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2987 ms
[2024-05-24 16:53:10] [INFO ] Computed and/alt/rep : 1326/1907/1326 causal constraints (skipped 1653 transitions) in 170 ms.
[2024-05-24 16:53:12] [INFO ] Added : 30 causal constraints over 9 iterations in 1821 ms. Result :sat
Minimization took 6672 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 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 95 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 81 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-24 16:53:18] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:53:18] [INFO ] Invariant cache hit.
[2024-05-24 16:53:20] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2024-05-24 16:53:20] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:53:20] [INFO ] Invariant cache hit.
[2024-05-24 16:53:20] [INFO ] State equation strengthened by 1903 read => feed constraints.
[2024-05-24 16:53:47] [INFO ] Implicit Places using invariants and state equation in 27763 ms returned []
Implicit Place search using SMT with State Equation took 28864 ms to find 0 implicit places.
[2024-05-24 16:53:47] [INFO ] Redundant transitions in 145 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-24 16:53:48] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:53:48] [INFO ] Invariant cache hit.
[2024-05-24 16:53:48] [INFO ] State equation strengthened by 1903 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/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 48268ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 48313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77425 ms. Remains : 952/952 places, 3439/3439 transitions.
[2024-05-24 16:54:36] [INFO ] Flatten gal took : 110 ms
RANDOM walk for 40000 steps (1362 resets) in 1096 ms. (36 steps per ms) remains 2/2 properties
[2024-05-24 16:54:36] [INFO ] Flatten gal took : 242 ms
BEST_FIRST walk for 40003 steps (163 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
[2024-05-24 16:54:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16418653223043126665.gal : 53 ms
[2024-05-24 16:54:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15997260483305842604.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/ReachabilityCardinality16418653223043126665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15997260483305842604.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (161 resets) in 187 ms. (212 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15997260483305842604.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 37
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :37 after 71
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :71 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
Interrupted probabilistic random walk after 70582 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 70582 steps, saw 29463 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:54:39] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:54:39] [INFO ] Invariant cache hit.
[2024-05-24 16:54:39] [INFO ] State equation strengthened by 1903 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
At refinement iteration 1 (OVERLAPS) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:54:40] [INFO ] Deduced a trap composed of 181 places in 436 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 712
[2024-05-24 16:54:42] [INFO ] Deduced a trap composed of 80 places in 495 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:54:42] [INFO ] Deduced a trap composed of 5 places in 460 ms of which 5 ms to minimize.
[2024-05-24 16:54:43] [INFO ] Deduced a trap composed of 27 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:54:43] [INFO ] Deduced a trap composed of 27 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:54:44] [INFO ] Deduced a trap composed of 57 places in 487 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :712 after 1212
[2024-05-24 16:54:44] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 6 ms to minimize.
[2024-05-24 16:54:45] [INFO ] Deduced a trap composed of 62 places in 466 ms of which 5 ms to minimize.
[2024-05-24 16:54:45] [INFO ] Deduced a trap composed of 143 places in 462 ms of which 6 ms to minimize.
[2024-05-24 16:54:46] [INFO ] Deduced a trap composed of 75 places in 488 ms of which 5 ms to minimize.
[2024-05-24 16:54:46] [INFO ] Deduced a trap composed of 163 places in 450 ms of which 6 ms to minimize.
SMT process timed out in 6977ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 82 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 952/952 places, 3439/3439 transitions.
RANDOM walk for 40000 steps (1360 resets) in 1231 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 205 ms. (194 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1212 after 2206
Interrupted probabilistic random walk after 70715 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 70715 steps, saw 29511 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:54:50] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:54:50] [INFO ] Invariant cache hit.
[2024-05-24 16:54:50] [INFO ] State equation strengthened by 1903 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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:54:50] [INFO ] Deduced a trap composed of 181 places in 430 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/914 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/942 variables, 28/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/942 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/952 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3041/3993 variables, 952/996 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3993 variables, 1903/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3993 variables, 0/2899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3993/3993 variables, and 2899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1831 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 952/952 constraints, ReadFeed: 1903/1903 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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) 867/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/886 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/886 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:54:52] [INFO ] Deduced a trap composed of 80 places in 492 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/886 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/914 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:54:53] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:54:53] [INFO ] Deduced a trap composed of 27 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:54:54] [INFO ] Deduced a trap composed of 27 places in 493 ms of which 6 ms to minimize.
[2024-05-24 16:54:54] [INFO ] Deduced a trap composed of 57 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:54:55] [INFO ] Deduced a trap composed of 46 places in 463 ms of which 5 ms to minimize.
[2024-05-24 16:54:55] [INFO ] Deduced a trap composed of 62 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:54:56] [INFO ] Deduced a trap composed of 143 places in 466 ms of which 6 ms to minimize.
[2024-05-24 16:54:56] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:54:57] [INFO ] Deduced a trap composed of 163 places in 453 ms of which 5 ms to minimize.
[2024-05-24 16:54:57] [INFO ] Deduced a trap composed of 152 places in 446 ms of which 5 ms to minimize.
[2024-05-24 16:54:58] [INFO ] Deduced a trap composed of 161 places in 448 ms of which 5 ms to minimize.
[2024-05-24 16:54:58] [INFO ] Deduced a trap composed of 85 places in 469 ms of which 6 ms to minimize.
[2024-05-24 16:54:59] [INFO ] Deduced a trap composed of 92 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:54:59] [INFO ] Deduced a trap composed of 173 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:55:00] [INFO ] Deduced a trap composed of 176 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:55:00] [INFO ] Deduced a trap composed of 113 places in 475 ms of which 5 ms to minimize.
[2024-05-24 16:55:01] [INFO ] Deduced a trap composed of 101 places in 481 ms of which 6 ms to minimize.
[2024-05-24 16:55:01] [INFO ] Deduced a trap composed of 201 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:55:02] [INFO ] Deduced a trap composed of 90 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:55:02] [INFO ] Deduced a trap composed of 92 places in 459 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/914 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:55:03] [INFO ] Deduced a trap composed of 115 places in 473 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
[2024-05-24 16:55:03] [INFO ] Deduced a trap composed of 183 places in 454 ms of which 6 ms to minimize.
SDD size :2206 after 5102
[2024-05-24 16:55:04] [INFO ] Deduced a trap composed of 118 places in 449 ms of which 5 ms to minimize.
[2024-05-24 16:55:04] [INFO ] Deduced a trap composed of 94 places in 489 ms of which 6 ms to minimize.
[2024-05-24 16:55:05] [INFO ] Deduced a trap composed of 115 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:55:05] [INFO ] Deduced a trap composed of 101 places in 453 ms of which 6 ms to minimize.
[2024-05-24 16:55:06] [INFO ] Deduced a trap composed of 122 places in 451 ms of which 6 ms to minimize.
[2024-05-24 16:55:06] [INFO ] Deduced a trap composed of 159 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:55:07] [INFO ] Deduced a trap composed of 160 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:55:07] [INFO ] Deduced a trap composed of 85 places in 478 ms of which 5 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 95 places in 491 ms of which 6 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 134 places in 468 ms of which 6 ms to minimize.
[2024-05-24 16:55:08] [INFO ] Deduced a trap composed of 82 places in 459 ms of which 5 ms to minimize.
[2024-05-24 16:55:09] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 6 ms to minimize.
[2024-05-24 16:55:09] [INFO ] Deduced a trap composed of 62 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:55:10] [INFO ] Deduced a trap composed of 71 places in 455 ms of which 6 ms to minimize.
[2024-05-24 16:55:10] [INFO ] Deduced a trap composed of 176 places in 463 ms of which 5 ms to minimize.
[2024-05-24 16:55:11] [INFO ] Deduced a trap composed of 97 places in 482 ms of which 6 ms to minimize.
[2024-05-24 16:55:11] [INFO ] Deduced a trap composed of 130 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:55:12] [INFO ] Deduced a trap composed of 46 places in 527 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/914 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:55:12] [INFO ] Deduced a trap composed of 88 places in 461 ms of which 6 ms to minimize.
[2024-05-24 16:55:13] [INFO ] Deduced a trap composed of 123 places in 472 ms of which 6 ms to minimize.
[2024-05-24 16:55:13] [INFO ] Deduced a trap composed of 182 places in 476 ms of which 6 ms to minimize.
[2024-05-24 16:55:14] [INFO ] Deduced a trap composed of 165 places in 522 ms of which 6 ms to minimize.
[2024-05-24 16:55:15] [INFO ] Deduced a trap composed of 56 places in 521 ms of which 5 ms to minimize.
[2024-05-24 16:55:15] [INFO ] Deduced a trap composed of 74 places in 542 ms of which 6 ms to minimize.
[2024-05-24 16:55:16] [INFO ] Deduced a trap composed of 72 places in 539 ms of which 6 ms to minimize.
[2024-05-24 16:55:16] [INFO ] Deduced a trap composed of 66 places in 652 ms of which 5 ms to minimize.
[2024-05-24 16:55:17] [INFO ] Deduced a trap composed of 164 places in 945 ms of which 20 ms to minimize.
[2024-05-24 16:55:18] [INFO ] Deduced a trap composed of 75 places in 528 ms of which 6 ms to minimize.
[2024-05-24 16:55:18] [INFO ] Deduced a trap composed of 74 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:55:19] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 5 ms to minimize.
[2024-05-24 16:55:19] [INFO ] Deduced a trap composed of 62 places in 552 ms of which 6 ms to minimize.
[2024-05-24 16:55:20] [INFO ] Deduced a trap composed of 104 places in 516 ms of which 6 ms to minimize.
[2024-05-24 16:55:21] [INFO ] Deduced a trap composed of 71 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:55:21] [INFO ] Deduced a trap composed of 85 places in 584 ms of which 6 ms to minimize.
[2024-05-24 16:55:22] [INFO ] Deduced a trap composed of 65 places in 537 ms of which 5 ms to minimize.
[2024-05-24 16:55:22] [INFO ] Deduced a trap composed of 66 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:55:23] [INFO ] Deduced a trap composed of 68 places in 527 ms of which 6 ms to minimize.
[2024-05-24 16:55:23] [INFO ] Deduced a trap composed of 62 places in 519 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/914 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:55:24] [INFO ] Deduced a trap composed of 66 places in 526 ms of which 6 ms to minimize.
[2024-05-24 16:55:24] [INFO ] Deduced a trap composed of 68 places in 526 ms of which 5 ms to minimize.
[2024-05-24 16:55:25] [INFO ] Deduced a trap composed of 69 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:55:26] [INFO ] Deduced a trap composed of 66 places in 525 ms of which 5 ms to minimize.
[2024-05-24 16:55:26] [INFO ] Deduced a trap composed of 66 places in 521 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 16:55:26] [INFO ] Flatten gal took : 94 ms
[2024-05-24 16:55:26] [INFO ] Applying decomposition
[2024-05-24 16:55:27] [INFO ] Flatten gal took : 97 ms
[2024-05-24 16:55:27] [INFO ] Deduced a trap composed of 70 places in 555 ms of which 6 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/graph17527428820776987325.txt' '-o' '/tmp/graph17527428820776987325.bin' '-w' '/tmp/graph17527428820776987325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17527428820776987325.bin' '-l' '-1' '-v' '-w' '/tmp/graph17527428820776987325.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:55:27] [INFO ] Decomposing Gal with order
[2024-05-24 16:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:55:27] [INFO ] Deduced a trap composed of 64 places in 499 ms of which 5 ms to minimize.
[2024-05-24 16:55:27] [INFO ] Removed a total of 5649 redundant transitions.
[2024-05-24 16:55:27] [INFO ] Flatten gal took : 457 ms
[2024-05-24 16:55:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2306 labels/synchronizations in 109 ms.
[2024-05-24 16:55:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14220824369219583813.gal : 26 ms
[2024-05-24 16:55:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3040571287186736798.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/ReachabilityCardinality14220824369219583813.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3040571287186736798.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
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 65 places in 542 ms of which 5 ms to minimize.
Loading property file /tmp/ReachabilityCardinality3040571287186736798.prop.
[2024-05-24 16:55:28] [INFO ] Deduced a trap composed of 59 places in 526 ms of which 9 ms to minimize.
[2024-05-24 16:55:29] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 6 ms to minimize.
[2024-05-24 16:55:29] [INFO ] Deduced a trap composed of 72 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:55:30] [INFO ] Deduced a trap composed of 92 places in 462 ms of which 5 ms to minimize.
[2024-05-24 16:55:30] [INFO ] Deduced a trap composed of 55 places in 532 ms of which 6 ms to minimize.
[2024-05-24 16:55:31] [INFO ] Deduced a trap composed of 60 places in 513 ms of which 5 ms to minimize.
[2024-05-24 16:55:31] [INFO ] Deduced a trap composed of 74 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:55:32] [INFO ] Deduced a trap composed of 66 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:55:32] [INFO ] Deduced a trap composed of 55 places in 545 ms of which 7 ms to minimize.
[2024-05-24 16:55:33] [INFO ] Deduced a trap composed of 55 places in 540 ms of which 6 ms to minimize.
[2024-05-24 16:55:34] [INFO ] Deduced a trap composed of 67 places in 524 ms of which 5 ms to minimize.
[2024-05-24 16:55:34] [INFO ] Deduced a trap composed of 57 places in 535 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/914 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:55:35] [INFO ] Deduced a trap composed of 67 places in 539 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 498
[2024-05-24 16:55:35] [INFO ] Deduced a trap composed of 92 places in 533 ms of which 6 ms to minimize.
[2024-05-24 16:55:36] [INFO ] Deduced a trap composed of 85 places in 513 ms of which 5 ms to minimize.
[2024-05-24 16:55:36] [INFO ] Deduced a trap composed of 68 places in 523 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :498 after 801
[2024-05-24 16:55:37] [INFO ] Deduced a trap composed of 130 places in 532 ms of which 6 ms to minimize.
SMT process timed out in 47076ms, 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 952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 90 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 952/952 places, 3439/3439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 952/952 places, 3439/3439 transitions.
Applied a total of 0 rules in 94 ms. Remains 952 /952 variables (removed 0) and now considering 3439/3439 (removed 0) transitions.
[2024-05-24 16:55:37] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:55:37] [INFO ] Invariant cache hit.
[2024-05-24 16:55:38] [INFO ] Implicit Places using invariants in 1064 ms returned []
[2024-05-24 16:55:38] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:55:38] [INFO ] Invariant cache hit.
[2024-05-24 16:55:39] [INFO ] State equation strengthened by 1903 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :801 after 914
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :914 after 3867
[2024-05-24 16:56:08] [INFO ] Implicit Places using invariants and state equation in 29814 ms returned []
Implicit Place search using SMT with State Equation took 30888 ms to find 0 implicit places.
[2024-05-24 16:56:08] [INFO ] Redundant transitions in 143 ms returned []
Running 3377 sub problems to find dead transitions.
[2024-05-24 16:56:08] [INFO ] Flow matrix only has 3041 transitions (discarded 398 similar events)
[2024-05-24 16:56:08] [INFO ] Invariant cache hit.
[2024-05-24 16:56:08] [INFO ] State equation strengthened by 1903 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/949 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3377 unsolved
SMT process timed out in 51177ms, After SMT, problems are : Problem set: 0 solved, 3377 unsolved
Search for dead transitions found 0 dead transitions in 51213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82353 ms. Remains : 952/952 places, 3439/3439 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 in 256494 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-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]
[2024-05-24 16:56:59] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
// Phase 1: matrix 3047 rows 954 cols
[2024-05-24 16:56:59] [INFO ] Computed 43 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 139 ms. (71 steps per ms)
BEST_FIRST walk for 10001 steps (40 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:57:00] [INFO ] Flow matrix only has 3047 transitions (discarded 398 similar events)
[2024-05-24 16:57:00] [INFO ] Invariant cache hit.
[2024-05-24 16:57:00] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:57:00] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:57:00] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-05-24 16:57:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:57:00] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:57:00] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-24 16:57:01] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-05-24 16:57:01] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2024-05-24 16:57:02] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 16:57:02] [INFO ] [Nat]Added 1906 Read/Feed constraints in 749 ms returned sat
[2024-05-24 16:57:02] [INFO ] Deduced a trap composed of 236 places in 433 ms of which 6 ms to minimize.
[2024-05-24 16:57:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 591 ms
[2024-05-24 16:57:03] [INFO ] Computed and/alt/rep : 1332/1916/1332 causal constraints (skipped 1653 transitions) in 185 ms.
[2024-05-24 16:57:03] [INFO ] Added : 11 causal constraints over 3 iterations in 685 ms. Result :sat
Minimization took 1219 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 954 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 954/954 places, 3443/3443 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 953 transition count 3441
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 952 transition count 3439
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 951 transition count 3437
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 950 transition count 3435
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 949 transition count 3433
Applied a total of 5 rules in 116 ms. Remains 949 /954 variables (removed 5) and now considering 3433/3443 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 949/954 places, 3433/3443 transitions.
[2024-05-24 16:57:04] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
// Phase 1: matrix 3035 rows 949 cols
[2024-05-24 16:57:05] [INFO ] Computed 43 invariants in 60 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34077 resets) in 13144 ms. (76 steps per ms)
BEST_FIRST walk for 1000001 steps (4036 resets) in 2139 ms. (467 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 16:57:20] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:57:20] [INFO ] Invariant cache hit.
[2024-05-24 16:57:20] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-24 16:57:20] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-24 16:57:21] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-05-24 16:57:21] [INFO ] State equation strengthened by 1900 read => feed constraints.
[2024-05-24 16:57:21] [INFO ] [Real]Added 1900 Read/Feed constraints in 299 ms returned sat
[2024-05-24 16:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 16:57:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-24 16:57:21] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-24 16:57:22] [INFO ] [Nat]Absence check using state equation in 718 ms returned sat
[2024-05-24 16:57:23] [INFO ] [Nat]Added 1900 Read/Feed constraints in 612 ms returned sat
[2024-05-24 16:57:23] [INFO ] Deduced a trap composed of 242 places in 444 ms of which 6 ms to minimize.
[2024-05-24 16:57:24] [INFO ] Deduced a trap composed of 88 places in 547 ms of which 6 ms to minimize.
[2024-05-24 16:57:24] [INFO ] Deduced a trap composed of 93 places in 539 ms of which 6 ms to minimize.
[2024-05-24 16:57:25] [INFO ] Deduced a trap composed of 66 places in 525 ms of which 6 ms to minimize.
[2024-05-24 16:57:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2461 ms
[2024-05-24 16:57:25] [INFO ] Computed and/alt/rep : 1320/1898/1320 causal constraints (skipped 1653 transitions) in 176 ms.
[2024-05-24 16:57:26] [INFO ] Added : 10 causal constraints over 2 iterations in 572 ms. Result :sat
Minimization took 6351 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 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 88 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 949/949 places, 3433/3433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 85 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
[2024-05-24 16:57:32] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:57:32] [INFO ] Invariant cache hit.
[2024-05-24 16:57:33] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-05-24 16:57:33] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:57:33] [INFO ] Invariant cache hit.
[2024-05-24 16:57:34] [INFO ] State equation strengthened by 1900 read => feed constraints.
[2024-05-24 16:58:01] [INFO ] Implicit Places using invariants and state equation in 27939 ms returned []
Implicit Place search using SMT with State Equation took 28986 ms to find 0 implicit places.
[2024-05-24 16:58:01] [INFO ] Redundant transitions in 140 ms returned []
Running 3371 sub problems to find dead transitions.
[2024-05-24 16:58:01] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:58:01] [INFO ] Invariant cache hit.
[2024-05-24 16:58:01] [INFO ] State equation strengthened by 1900 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3371 unsolved
SMT process timed out in 49120ms, After SMT, problems are : Problem set: 0 solved, 3371 unsolved
Search for dead transitions found 0 dead transitions in 49151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78380 ms. Remains : 949/949 places, 3433/3433 transitions.
[2024-05-24 16:58:51] [INFO ] Flatten gal took : 99 ms
[2024-05-24 16:58:51] [INFO ] Flatten gal took : 138 ms
RANDOM walk for 40000 steps (1361 resets) in 1047 ms. (38 steps per ms) remains 2/2 properties
[2024-05-24 16:58:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14719803930211888822.gal : 51 ms
[2024-05-24 16:58:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4661163775363167078.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/ReachabilityCardinality14719803930211888822.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4661163775363167078.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 (159 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality4661163775363167078.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 72
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :72 after 74
Interrupted probabilistic random walk after 71903 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 71903 steps, saw 30008 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:58:54] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:58:54] [INFO ] Invariant cache hit.
[2024-05-24 16:58:54] [INFO ] State equation strengthened by 1900 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) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :74 after 148
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :148 after 151
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:58:55] [INFO ] Deduced a trap composed of 152 places in 467 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :151 after 282
[2024-05-24 16:58:55] [INFO ] Deduced a trap composed of 133 places in 463 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :282 after 430
[2024-05-24 16:58:55] [INFO ] Deduced a trap composed of 229 places in 457 ms of which 5 ms to minimize.
[2024-05-24 16:58:56] [INFO ] Deduced a trap composed of 175 places in 463 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :430 after 696
[2024-05-24 16:58:56] [INFO ] Deduced a trap composed of 143 places in 455 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/949 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3035/3984 variables, 949/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3984 variables, 1900/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 2897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3988 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 949/949 constraints, ReadFeed: 1900/1900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:58:59] [INFO ] Deduced a trap composed of 5 places in 482 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :696 after 1209
[2024-05-24 16:58:59] [INFO ] Deduced a trap composed of 27 places in 479 ms of which 5 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 5 ms to minimize.
[2024-05-24 16:59:00] [INFO ] Deduced a trap composed of 69 places in 514 ms of which 6 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 75 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:59:01] [INFO ] Deduced a trap composed of 62 places in 518 ms of which 5 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 85 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:59:02] [INFO ] Deduced a trap composed of 65 places in 531 ms of which 5 ms to minimize.
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 58 places in 525 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1209 after 2266
[2024-05-24 16:59:03] [INFO ] Deduced a trap composed of 123 places in 510 ms of which 6 ms to minimize.
SMT process timed out in 9442ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 79 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 949/949 places, 3433/3433 transitions.
RANDOM walk for 40000 steps (1362 resets) in 789 ms. (50 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 69032 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 2
Probabilistic random walk after 69032 steps, saw 28815 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
[2024-05-24 16:59:07] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:59:07] [INFO ] Invariant cache hit.
[2024-05-24 16:59:07] [INFO ] State equation strengthened by 1900 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) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:59:07] [INFO ] Deduced a trap composed of 152 places in 484 ms of which 5 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 133 places in 494 ms of which 6 ms to minimize.
[2024-05-24 16:59:08] [INFO ] Deduced a trap composed of 229 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:59:09] [INFO ] Deduced a trap composed of 175 places in 492 ms of which 6 ms to minimize.
[2024-05-24 16:59:09] [INFO ] Deduced a trap composed of 143 places in 484 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/939 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/939 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/949 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3035/3984 variables, 949/997 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3984 variables, 1900/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/3984 variables, 0/2897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 2897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4073 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 949/949 constraints, ReadFeed: 1900/1900 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 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) 864/865 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/865 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/883 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/883 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/883 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/911 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:59:11] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 6 ms to minimize.
[2024-05-24 16:59:12] [INFO ] Deduced a trap composed of 27 places in 481 ms of which 5 ms to minimize.
[2024-05-24 16:59:12] [INFO ] Deduced a trap composed of 46 places in 473 ms of which 6 ms to minimize.
[2024-05-24 16:59:13] [INFO ] Deduced a trap composed of 69 places in 487 ms of which 5 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2266 after 5143
[2024-05-24 16:59:13] [INFO ] Deduced a trap composed of 75 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:59:14] [INFO ] Deduced a trap composed of 62 places in 491 ms of which 5 ms to minimize.
[2024-05-24 16:59:14] [INFO ] Deduced a trap composed of 85 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:59:15] [INFO ] Deduced a trap composed of 65 places in 496 ms of which 6 ms to minimize.
[2024-05-24 16:59:16] [INFO ] Deduced a trap composed of 58 places in 489 ms of which 6 ms to minimize.
[2024-05-24 16:59:16] [INFO ] Deduced a trap composed of 123 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:59:17] [INFO ] Deduced a trap composed of 65 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:59:17] [INFO ] Deduced a trap composed of 58 places in 501 ms of which 6 ms to minimize.
[2024-05-24 16:59:18] [INFO ] Deduced a trap composed of 73 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:59:18] [INFO ] Deduced a trap composed of 94 places in 425 ms of which 6 ms to minimize.
[2024-05-24 16:59:18] [INFO ] Deduced a trap composed of 232 places in 477 ms of which 6 ms to minimize.
[2024-05-24 16:59:19] [INFO ] Deduced a trap composed of 168 places in 506 ms of which 6 ms to minimize.
[2024-05-24 16:59:19] [INFO ] Deduced a trap composed of 117 places in 481 ms of which 7 ms to minimize.
[2024-05-24 16:59:20] [INFO ] Deduced a trap composed of 171 places in 512 ms of which 6 ms to minimize.
[2024-05-24 16:59:21] [INFO ] Deduced a trap composed of 92 places in 477 ms of which 5 ms to minimize.
[2024-05-24 16:59:21] [INFO ] Deduced a trap composed of 131 places in 487 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:59:22] [INFO ] Deduced a trap composed of 69 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:59:22] [INFO ] Deduced a trap composed of 85 places in 506 ms of which 5 ms to minimize.
[2024-05-24 16:59:23] [INFO ] Deduced a trap composed of 66 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:59:23] [INFO ] Deduced a trap composed of 63 places in 490 ms of which 6 ms to minimize.
[2024-05-24 16:59:24] [INFO ] Deduced a trap composed of 95 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:59:24] [INFO ] Deduced a trap composed of 149 places in 490 ms of which 6 ms to minimize.
[2024-05-24 16:59:25] [INFO ] Deduced a trap composed of 59 places in 479 ms of which 6 ms to minimize.
[2024-05-24 16:59:25] [INFO ] Deduced a trap composed of 82 places in 483 ms of which 6 ms to minimize.
[2024-05-24 16:59:26] [INFO ] Deduced a trap composed of 103 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:59:26] [INFO ] Deduced a trap composed of 90 places in 484 ms of which 6 ms to minimize.
[2024-05-24 16:59:27] [INFO ] Deduced a trap composed of 27 places in 488 ms of which 6 ms to minimize.
[2024-05-24 16:59:27] [INFO ] Deduced a trap composed of 78 places in 499 ms of which 5 ms to minimize.
[2024-05-24 16:59:28] [INFO ] Deduced a trap composed of 88 places in 487 ms of which 6 ms to minimize.
[2024-05-24 16:59:28] [INFO ] Deduced a trap composed of 136 places in 485 ms of which 6 ms to minimize.
[2024-05-24 16:59:29] [INFO ] Deduced a trap composed of 88 places in 478 ms of which 6 ms to minimize.
[2024-05-24 16:59:29] [INFO ] Deduced a trap composed of 117 places in 493 ms of which 6 ms to minimize.
[2024-05-24 16:59:30] [INFO ] Deduced a trap composed of 57 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:59:30] [INFO ] Deduced a trap composed of 104 places in 480 ms of which 5 ms to minimize.
[2024-05-24 16:59:31] [INFO ] Deduced a trap composed of 70 places in 480 ms of which 5 ms to minimize.
[2024-05-24 16:59:31] [INFO ] Deduced a trap composed of 222 places in 507 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/911 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:59:32] [INFO ] Deduced a trap composed of 127 places in 503 ms of which 6 ms to minimize.
[2024-05-24 16:59:32] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 5 ms to minimize.
[2024-05-24 16:59:33] [INFO ] Deduced a trap composed of 85 places in 477 ms of which 5 ms to minimize.
[2024-05-24 16:59:33] [INFO ] Deduced a trap composed of 62 places in 482 ms of which 8 ms to minimize.
[2024-05-24 16:59:34] [INFO ] Deduced a trap composed of 113 places in 470 ms of which 6 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :5143 after 10284
[2024-05-24 16:59:34] [INFO ] Deduced a trap composed of 58 places in 480 ms of which 6 ms to minimize.
[2024-05-24 16:59:35] [INFO ] Deduced a trap composed of 94 places in 488 ms of which 5 ms to minimize.
[2024-05-24 16:59:35] [INFO ] Deduced a trap composed of 94 places in 478 ms of which 5 ms to minimize.
[2024-05-24 16:59:36] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 5 ms to minimize.
[2024-05-24 16:59:36] [INFO ] Deduced a trap composed of 62 places in 491 ms of which 5 ms to minimize.
[2024-05-24 16:59:37] [INFO ] Deduced a trap composed of 161 places in 483 ms of which 5 ms to minimize.
[2024-05-24 16:59:37] [INFO ] Deduced a trap composed of 57 places in 530 ms of which 6 ms to minimize.
[2024-05-24 16:59:38] [INFO ] Deduced a trap composed of 66 places in 469 ms of which 5 ms to minimize.
[2024-05-24 16:59:38] [INFO ] Deduced a trap composed of 57 places in 486 ms of which 6 ms to minimize.
[2024-05-24 16:59:39] [INFO ] Deduced a trap composed of 60 places in 475 ms of which 6 ms to minimize.
[2024-05-24 16:59:39] [INFO ] Deduced a trap composed of 88 places in 543 ms of which 6 ms to minimize.
[2024-05-24 16:59:40] [INFO ] Deduced a trap composed of 63 places in 529 ms of which 5 ms to minimize.
[2024-05-24 16:59:40] [INFO ] Deduced a trap composed of 85 places in 516 ms of which 6 ms to minimize.
Detected timeout of ITS tools.
[2024-05-24 16:59:41] [INFO ] Deduced a trap composed of 71 places in 546 ms of which 5 ms to minimize.
[2024-05-24 16:59:41] [INFO ] Flatten gal took : 93 ms
[2024-05-24 16:59:41] [INFO ] Applying decomposition
[2024-05-24 16:59:41] [INFO ] Flatten gal took : 94 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/graph13964920413329512903.txt' '-o' '/tmp/graph13964920413329512903.bin' '-w' '/tmp/graph13964920413329512903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13964920413329512903.bin' '-l' '-1' '-v' '-w' '/tmp/graph13964920413329512903.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:59:41] [INFO ] Decomposing Gal with order
[2024-05-24 16:59:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:59:41] [INFO ] Deduced a trap composed of 97 places in 477 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 16:59:42] [INFO ] Removed a total of 5800 redundant transitions.
[2024-05-24 16:59:42] [INFO ] Flatten gal took : 378 ms
[2024-05-24 16:59:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2663 labels/synchronizations in 124 ms.
[2024-05-24 16:59:42] [INFO ] Deduced a trap composed of 62 places in 473 ms of which 5 ms to minimize.
[2024-05-24 16:59:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17297729036255880721.gal : 25 ms
[2024-05-24 16:59:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2081207420677049875.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/ReachabilityCardinality17297729036255880721.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2081207420677049875.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
Loading property file /tmp/ReachabilityCardinality2081207420677049875.prop.
[2024-05-24 16:59:42] [INFO ] Deduced a trap composed of 120 places in 485 ms of which 5 ms to minimize.
[2024-05-24 16:59:43] [INFO ] Deduced a trap composed of 85 places in 520 ms of which 6 ms to minimize.
[2024-05-24 16:59:43] [INFO ] Deduced a trap composed of 70 places in 516 ms of which 5 ms to minimize.
[2024-05-24 16:59:44] [INFO ] Deduced a trap composed of 93 places in 519 ms of which 6 ms to minimize.
[2024-05-24 16:59:45] [INFO ] Deduced a trap composed of 58 places in 505 ms of which 5 ms to minimize.
[2024-05-24 16:59:45] [INFO ] Deduced a trap composed of 76 places in 536 ms of which 6 ms to minimize.
[2024-05-24 16:59:46] [INFO ] Deduced a trap composed of 67 places in 534 ms of which 6 ms to minimize.
[2024-05-24 16:59:46] [INFO ] Deduced a trap composed of 106 places in 514 ms of which 5 ms to minimize.
[2024-05-24 16:59:47] [INFO ] Deduced a trap composed of 85 places in 500 ms of which 5 ms to minimize.
[2024-05-24 16:59:47] [INFO ] Deduced a trap composed of 59 places in 507 ms of which 5 ms to minimize.
[2024-05-24 16:59:48] [INFO ] Deduced a trap composed of 67 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:59:48] [INFO ] Deduced a trap composed of 87 places in 513 ms of which 5 ms to minimize.
[2024-05-24 16:59:49] [INFO ] Deduced a trap composed of 69 places in 523 ms of which 6 ms to minimize.
[2024-05-24 16:59:49] [INFO ] Deduced a trap composed of 71 places in 515 ms of which 5 ms to minimize.
[2024-05-24 16:59:50] [INFO ] Deduced a trap composed of 75 places in 508 ms of which 6 ms to minimize.
[2024-05-24 16:59:51] [INFO ] Deduced a trap composed of 85 places in 505 ms of which 6 ms to minimize.
[2024-05-24 16:59:51] [INFO ] Deduced a trap composed of 103 places in 510 ms of which 5 ms to minimize.
[2024-05-24 16:59:52] [INFO ] Deduced a trap composed of 82 places in 507 ms of which 5 ms to minimize.
[2024-05-24 16:59:52] [INFO ] Deduced a trap composed of 70 places in 517 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1458
[2024-05-24 16:59:53] [INFO ] Deduced a trap composed of 82 places in 516 ms of which 5 ms to minimize.
[2024-05-24 16:59:53] [INFO ] Deduced a trap composed of 60 places in 513 ms of which 6 ms to minimize.
[2024-05-24 16:59:54] [INFO ] Deduced a trap composed of 204 places in 457 ms of which 5 ms to minimize.
[2024-05-24 16:59:54] [INFO ] Deduced a trap composed of 205 places in 459 ms of which 5 ms to minimize.
[2024-05-24 16:59:55] [INFO ] Deduced a trap composed of 113 places in 440 ms of which 5 ms to minimize.
[2024-05-24 16:59:55] [INFO ] Deduced a trap composed of 97 places in 511 ms of which 6 ms to minimize.
[2024-05-24 16:59:56] [INFO ] Deduced a trap composed of 143 places in 507 ms of which 6 ms to minimize.
[2024-05-24 16:59:56] [INFO ] Deduced a trap composed of 110 places in 506 ms of which 5 ms to minimize.
SMT process timed out in 49479ms, 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 949 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 88 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 949/949 places, 3433/3433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 949/949 places, 3433/3433 transitions.
Applied a total of 0 rules in 83 ms. Remains 949 /949 variables (removed 0) and now considering 3433/3433 (removed 0) transitions.
[2024-05-24 16:59:56] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:59:56] [INFO ] Invariant cache hit.
[2024-05-24 16:59:57] [INFO ] Implicit Places using invariants in 1058 ms returned []
[2024-05-24 16:59:57] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 16:59:57] [INFO ] Invariant cache hit.
[2024-05-24 16:59:58] [INFO ] State equation strengthened by 1900 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1458 after 5223
[2024-05-24 17:00:26] [INFO ] Implicit Places using invariants and state equation in 29059 ms returned []
Implicit Place search using SMT with State Equation took 30135 ms to find 0 implicit places.
[2024-05-24 17:00:27] [INFO ] Redundant transitions in 147 ms returned []
Running 3371 sub problems to find dead transitions.
[2024-05-24 17:00:27] [INFO ] Flow matrix only has 3035 transitions (discarded 398 similar events)
[2024-05-24 17:00:27] [INFO ] Invariant cache hit.
[2024-05-24 17:00:27] [INFO ] State equation strengthened by 1900 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/946 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3371 unsolved
SMT process timed out in 51589ms, After SMT, problems are : Problem set: 0 solved, 3371 unsolved
Search for dead transitions found 0 dead transitions in 51630ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82018 ms. Remains : 949/949 places, 3433/3433 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 in 258953 ms.
[2024-05-24 17:01:18] [INFO ] Flatten gal took : 95 ms
[2024-05-24 17:01:18] [INFO ] Applying decomposition
[2024-05-24 17:01:19] [INFO ] Flatten gal took : 100 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/graph5042153436321163743.txt' '-o' '/tmp/graph5042153436321163743.bin' '-w' '/tmp/graph5042153436321163743.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5042153436321163743.bin' '-l' '-1' '-v' '-w' '/tmp/graph5042153436321163743.weights' '-q' '0' '-e' '0.001'
[2024-05-24 17:01:19] [INFO ] Decomposing Gal with order
[2024-05-24 17:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 17:01:19] [INFO ] Removed a total of 5798 redundant transitions.
[2024-05-24 17:01:19] [INFO ] Flatten gal took : 353 ms
[2024-05-24 17:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 2477 labels/synchronizations in 96 ms.
[2024-05-24 17:01:19] [INFO ] Time to serialize gal into /tmp/UpperBounds9293064703672100504.gal : 24 ms
[2024-05-24 17:01:19] [INFO ] Time to serialize properties into /tmp/UpperBounds17329386791464105712.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/UpperBounds9293064703672100504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17329386791464105712.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17329386791464105712.prop.
ITS-tools command line returned an error code 137
[2024-05-24 17:06:29] [INFO ] Flatten gal took : 108 ms
[2024-05-24 17:06:29] [INFO ] Time to serialize gal into /tmp/UpperBounds16149636916537019844.gal : 19 ms
[2024-05-24 17:06:29] [INFO ] Time to serialize properties into /tmp/UpperBounds16470819878869233871.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/UpperBounds16149636916537019844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16470819878869233871.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 ...306
Loading property file /tmp/UpperBounds16470819878869233871.prop.
ITS-tools command line returned an error code 137
[2024-05-24 17:13:55] [INFO ] Flatten gal took : 86 ms
[2024-05-24 17:13:55] [INFO ] Input system was already deterministic with 3445 transitions.
[2024-05-24 17:13:55] [INFO ] Transformed 954 places.
[2024-05-24 17:13:55] [INFO ] Transformed 3445 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
[2024-05-24 17:13:55] [INFO ] Time to serialize gal into /tmp/UpperBounds13867461073170777903.gal : 15 ms
[2024-05-24 17:13:55] [INFO ] Time to serialize properties into /tmp/UpperBounds8693325106020577762.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/UpperBounds13867461073170777903.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8693325106020577762.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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds8693325106020577762.prop.
ITS-tools command line returned an error code 137
Total runtime 2185444 ms.

BK_STOP 1716571290955

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r246-tall-171654350700029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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