MCC'2025- Execution of r072-tall-174860068100797

About the Execution of ITS-Tools for EisenbergMcGuire-PT-08

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	356180.00	0.00	0.00	1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1	normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.7M May 29 14:32 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748848920028

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-06-02 07:22:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 07:22:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 07:22:01] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2025-06-02 07:22:01] [INFO ] Transformed 712 places.
[2025-06-02 07:22:01] [INFO ] Transformed 2816 transitions.
[2025-06-02 07:22:01] [INFO ] Found NUPN structural information;
[2025-06-02 07:22:01] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 286 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 07:22:01] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2025-06-02 07:22:01] [INFO ] Computed 25 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 58 ms. (169 steps per ms)
FORMULA EisenbergMcGuire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 83 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-02 07:22:01] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
[2025-06-02 07:22:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:02] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2025-06-02 07:22:02] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-02 07:22:02] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2025-06-02 07:22:02] [INFO ] State equation strengthened by 676 read => feed constraints.
[2025-06-02 07:22:02] [INFO ] [Real]Added 676 Read/Feed constraints in 100 ms returned sat
[2025-06-02 07:22:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2025-06-02 07:22:02] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-02 07:22:03] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2025-06-02 07:22:03] [INFO ] [Nat]Added 676 Read/Feed constraints in 93 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:03] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:03] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:03] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:04] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:04] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:04] [INFO ] Deduced a trap composed of 26 places in 264 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:05] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:05] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:05] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:05] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 7 ms to minimize.
[2025-06-02 07:22:05] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2706 ms
[2025-06-02 07:22:05] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 112 ms.
[2025-06-02 07:22:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:07] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:07] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-02 07:22:08] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2025-06-02 07:22:08] [INFO ] [Real]Added 676 Read/Feed constraints in 87 ms returned sat
[2025-06-02 07:22:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2025-06-02 07:22:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-02 07:22:08] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2025-06-02 07:22:08] [INFO ] [Nat]Added 676 Read/Feed constraints in 120 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:09] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:09] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:09] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:09] [INFO ] Deduced a trap composed of 3 places in 234 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:10] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:10] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:10] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:10] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:11] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:11] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:11] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:11] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
[2025-06-02 07:22:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2923 ms
[2025-06-02 07:22:11] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 88 ms.
[2025-06-02 07:22:13] [INFO ] Added : 95 causal constraints over 19 iterations in 1574 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:13] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 07:22:13] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:13] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2025-06-02 07:22:13] [INFO ] [Real]Added 676 Read/Feed constraints in 81 ms returned sat
[2025-06-02 07:22:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-02 07:22:14] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 07:22:14] [INFO ] [Nat]Added 676 Read/Feed constraints in 76 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:14] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:14] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:15] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:15] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:15] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:15] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:16] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:16] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:16] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:16] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:17] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:17] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:17] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 6 ms to minimize.
[2025-06-02 07:22:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3402 ms
[2025-06-02 07:22:17] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 73 ms.
[2025-06-02 07:22:18] [INFO ] Added : 60 causal constraints over 12 iterations in 1143 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:18] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:18] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2025-06-02 07:22:19] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2025-06-02 07:22:19] [INFO ] [Real]Added 676 Read/Feed constraints in 83 ms returned sat
[2025-06-02 07:22:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:19] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 07:22:19] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-06-02 07:22:19] [INFO ] [Nat]Added 676 Read/Feed constraints in 104 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:20] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:20] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:20] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:21] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:21] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:21] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:21] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:22] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
[2025-06-02 07:22:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3153 ms
[2025-06-02 07:22:23] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 103 ms.
[2025-06-02 07:22:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:24] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 07:22:24] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 07:22:24] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2025-06-02 07:22:24] [INFO ] [Real]Added 676 Read/Feed constraints in 91 ms returned sat
[2025-06-02 07:22:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 07:22:25] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:25] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2025-06-02 07:22:25] [INFO ] [Nat]Added 676 Read/Feed constraints in 92 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:25] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:26] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:26] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:26] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:27] [INFO ] Deduced a trap composed of 20 places in 318 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:27] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:27] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:27] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:28] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:28] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:28] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:28] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 11 ms to minimize.
[2025-06-02 07:22:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3566 ms
[2025-06-02 07:22:28] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 65 ms.
[2025-06-02 07:22:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:30] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Real]Added 676 Read/Feed constraints in 80 ms returned sat
[2025-06-02 07:22:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Nat]Absence check using state equation in 260 ms returned sat
[2025-06-02 07:22:30] [INFO ] [Nat]Added 676 Read/Feed constraints in 80 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:31] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:31] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:31] [INFO ] Deduced a trap composed of 20 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:32] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:32] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:32] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:32] [INFO ] Deduced a trap composed of 35 places in 131 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:32] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:33] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 13 ms to minimize.
[2025-06-02 07:22:33] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2187 ms
[2025-06-02 07:22:33] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 74 ms.
[2025-06-02 07:22:35] [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 5
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:35] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2025-06-02 07:22:35] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:35] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2025-06-02 07:22:35] [INFO ] [Real]Added 676 Read/Feed constraints in 80 ms returned sat
[2025-06-02 07:22:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:36] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2025-06-02 07:22:36] [INFO ] [Nat]Added 676 Read/Feed constraints in 87 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:36] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:37] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:37] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:37] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:37] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:38] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:38] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:38] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:39] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:39] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:39] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:39] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:39] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 12 ms to minimize.
[2025-06-02 07:22:39] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3455 ms
[2025-06-02 07:22:39] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 69 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:41] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Real]Added 676 Read/Feed constraints in 68 ms returned sat
[2025-06-02 07:22:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:22:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-06-02 07:22:41] [INFO ] [Nat]Added 676 Read/Feed constraints in 81 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:42] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:42] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:42] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:43] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:43] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:43] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:43] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:44] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:44] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:44] [INFO ] Deduced a trap composed of 35 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:44] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:45] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:45] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:45] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 12 ms to minimize.
[2025-06-02 07:22:45] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3535 ms
[2025-06-02 07:22:45] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 78 ms.
[2025-06-02 07:22:46] [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 7
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:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 16 place count 704 transition count 2610
Deduced a syphon composed of 198 places in 4 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 412 place count 506 transition count 2610
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 468 place count 450 transition count 2162
Iterating global reduction 2 with 56 rules applied. Total rules applied 524 place count 450 transition count 2162
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 7 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 634 place count 395 transition count 2107
Applied a total of 634 rules in 282 ms. Remains 395 /712 variables (removed 317) and now considering 2107/2816 (removed 709) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 395/712 places, 2107/2816 transitions.
[2025-06-02 07:22:47] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
// Phase 1: matrix 659 rows 395 cols
[2025-06-02 07:22:47] [INFO ] Computed 25 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 1918 ms. (521 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 2905 ms. (2064 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-06-02 07:22:52] [INFO ] Flow matrix only has 659 transitions (discarded 1448 similar events)
[2025-06-02 07:22:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:52] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:52] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 7 ms returned sat
[2025-06-02 07:22:52] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-02 07:22:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:22:52] [INFO ] [Real]Added 284 Read/Feed constraints in 45 ms returned sat
[2025-06-02 07:22:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:53] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:53] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 07:22:53] [INFO ] [Nat]Added 284 Read/Feed constraints in 36 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:53] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 3 ms to minimize.
[2025-06-02 07:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-02 07:22:53] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 39 ms.
[2025-06-02 07:22:53] [INFO ] Added : 58 causal constraints over 12 iterations in 515 ms. Result :sat
Minimization took 154 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:54] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Real]Added 284 Read/Feed constraints in 39 ms returned sat
[2025-06-02 07:22:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-06-02 07:22:54] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2025-06-02 07:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2025-06-02 07:22:54] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 55 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:55] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:55] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:55] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 6 ms to minimize.
[2025-06-02 07:22:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 409 ms
[2025-06-02 07:22:56] [INFO ] Added : 109 causal constraints over 22 iterations in 1494 ms. Result :sat
Minimization took 172 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:56] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Real]Added 284 Read/Feed constraints in 38 ms returned sat
[2025-06-02 07:22:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-02 07:22:56] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 2 ms to minimize.
[2025-06-02 07:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2025-06-02 07:22:56] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 37 ms.
[2025-06-02 07:22:57] [INFO ] Added : 111 causal constraints over 23 iterations in 913 ms. Result :sat
Minimization took 161 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:57] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 07:22:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:58] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-02 07:22:58] [INFO ] [Real]Added 284 Read/Feed constraints in 41 ms returned sat
[2025-06-02 07:22:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 07:22:58] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:58] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 07:22:58] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2025-06-02 07:22:58] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 37 ms.
[2025-06-02 07:22:59] [INFO ] Added : 88 causal constraints over 18 iterations in 725 ms. Result :sat
Minimization took 164 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:59] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Real]Added 284 Read/Feed constraints in 35 ms returned sat
[2025-06-02 07:22:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:22:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 07:22:59] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:22:59] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2025-06-02 07:22:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2025-06-02 07:22:59] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 35 ms.
[2025-06-02 07:23:00] [INFO ] Added : 100 causal constraints over 20 iterations in 781 ms. Result :sat
Minimization took 168 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:00] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2025-06-02 07:23:00] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:01] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-02 07:23:01] [INFO ] [Real]Added 284 Read/Feed constraints in 40 ms returned sat
[2025-06-02 07:23:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 07:23:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:23:01] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-02 07:23:01] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:01] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 3 ms to minimize.
[2025-06-02 07:23:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2025-06-02 07:23:01] [INFO ] Computed and/alt/rep : 572/1395/404 causal constraints (skipped 247 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:02] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 3 ms to minimize.
[2025-06-02 07:23:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2025-06-02 07:23:02] [INFO ] Added : 126 causal constraints over 26 iterations in 1169 ms. Result :sat
Minimization took 167 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 2107/2107 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 394 transition count 2106
Applied a total of 2 rules in 110 ms. Remains 394 /395 variables (removed 1) and now considering 2106/2107 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 394/395 places, 2106/2107 transitions.
[2025-06-02 07:23:03] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2025-06-02 07:23:03] [INFO ] Computed 25 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1826 ms. (547 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2426 ms. (2060 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2025-06-02 07:23:07] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:23:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:08] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:08] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2025-06-02 07:23:08] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-06-02 07:23:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:23:08] [INFO ] [Real]Added 284 Read/Feed constraints in 34 ms returned sat
[2025-06-02 07:23:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:08] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:23:08] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-02 07:23:08] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
[2025-06-02 07:23:08] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 41 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:09] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2025-06-02 07:23:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 337 ms
[2025-06-02 07:23:09] [INFO ] Added : 92 causal constraints over 19 iterations in 1146 ms. Result :sat
Minimization took 150 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:09] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:09] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:09] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-06-02 07:23:10] [INFO ] [Real]Added 284 Read/Feed constraints in 34 ms returned sat
[2025-06-02 07:23:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:10] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:23:10] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2025-06-02 07:23:10] [INFO ] [Nat]Added 284 Read/Feed constraints in 33 ms returned sat
[2025-06-02 07:23:10] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 36 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:10] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 3 ms to minimize.
[2025-06-02 07:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2025-06-02 07:23:11] [INFO ] Added : 63 causal constraints over 14 iterations in 723 ms. Result :sat
Minimization took 144 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:11] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Real]Added 284 Read/Feed constraints in 43 ms returned sat
[2025-06-02 07:23:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2025-06-02 07:23:11] [INFO ] [Nat]Added 284 Read/Feed constraints in 38 ms returned sat
[2025-06-02 07:23:11] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 30 ms.
[2025-06-02 07:23:12] [INFO ] Added : 99 causal constraints over 20 iterations in 826 ms. Result :sat
Minimization took 146 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:12] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:12] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-06-02 07:23:12] [INFO ] [Real]Added 284 Read/Feed constraints in 36 ms returned sat
[2025-06-02 07:23:12] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:13] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2025-06-02 07:23:13] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2025-06-02 07:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-02 07:23:13] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 35 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:14] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:14] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 21 ms to minimize.
[2025-06-02 07:23:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 511 ms
[2025-06-02 07:23:15] [INFO ] Added : 146 causal constraints over 30 iterations in 1787 ms. Result :sat
Minimization took 182 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:15] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Real]Added 284 Read/Feed constraints in 34 ms returned sat
[2025-06-02 07:23:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:23:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-06-02 07:23:15] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:15] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2025-06-02 07:23:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2025-06-02 07:23:15] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 36 ms.
[2025-06-02 07:23:16] [INFO ] Added : 47 causal constraints over 10 iterations in 432 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 71 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 394/394 places, 2106/2106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Applied a total of 0 rules in 67 ms. Remains 394 /394 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
[2025-06-02 07:23:16] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:17] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-06-02 07:23:17] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:23:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:23:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:23:19] [INFO ] Implicit Places using invariants and state equation in 1913 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:23:19] [INFO ] Redundant transitions in 102 ms returned []
Running 2098 sub problems to find dead transitions.
[2025-06-02 07:23:19] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:23:19] [INFO ] Invariant cache hit.
[2025-06-02 07:23:19] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:33] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:34] [INFO ] Deduced a trap composed of 66 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:35] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:35] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:35] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:36] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:36] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:36] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:36] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:36] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:37] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:37] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:37] [INFO ] Deduced a trap composed of 61 places in 142 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:37] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:38] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:41] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:41] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:43] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:44] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:44] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:44] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:46] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:46] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:47] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:48] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:48] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:48] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:49] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:49] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:49] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:50] [INFO ] Deduced a trap composed of 51 places in 194 ms of which 30 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/1052 variables, and 65 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2098/2098 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 40/65 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:59] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:59] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:23:59] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:01] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:01] [INFO ] Deduced a trap composed of 57 places in 160 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:01] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:02] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:02] [INFO ] Deduced a trap composed of 59 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:02] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:02] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:03] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:03] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:03] [INFO ] Deduced a trap composed of 66 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:03] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:04] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:04] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:04] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:04] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:06] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:08] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:08] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:09] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:09] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:09] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:10] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:10] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:10] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:11] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:11] [INFO ] Deduced a trap composed of 55 places in 162 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:11] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:11] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:12] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:12] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:12] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:12] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:13] [INFO ] Deduced a trap composed of 58 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:13] [INFO ] Deduced a trap composed of 60 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:13] [INFO ] Deduced a trap composed of 60 places in 169 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:14] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 2098 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:16] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:17] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/1052 variables, and 107 constraints, problems are : Problem set: 0 solved, 2098 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2098 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 2098 unsolved
Search for dead transitions found 0 dead transitions in 60815ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63415 ms. Remains : 394/394 places, 2106/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 1169 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
[2025-06-02 07:24:20] [INFO ] Flatten gal took : 256 ms
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
[2025-06-02 07:24:21] [INFO ] Flatten gal took : 117 ms
[2025-06-02 07:24:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5961915566739435348.gal : 53 ms
[2025-06-02 07:24:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7940292160185856667.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5961915566739435348.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7940292160185856667.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7940292160185856667.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :22 after 23
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :23 after 29
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :29 after 72
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :72 after 283
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :283 after 396
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :396 after 1038
Interrupted probabilistic random walk after 313092 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :8 out of 10
Probabilistic random walk after 313092 steps, saw 173886 distinct states, run finished after 3006 ms. (steps per millisecond=104 ) properties seen :8
[2025-06-02 07:24:24] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:24:24] [INFO ] Invariant cache hit.
[2025-06-02 07:24:24] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,10 properties remain. new max is 4096
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :1038 after 4103
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 394/1052 variables, 268/457 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1052 variables, 247/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1052 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1052 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1052/1052 variables, and 704 constraints, problems are : Problem set: 0 solved, 2 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 254/644 variables, 14/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/644 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/658 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 394/1052 variables, 268/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1052 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1052 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1052 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1052/1052 variables, and 707 constraints, problems are : Problem set: 0 solved, 2 unsolved in 791 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 394/394 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1270ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 199 ms.
Support contains 1 out of 394 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2106/2106 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 2104
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 2104
Applied a total of 4 rules in 71 ms. Remains 392 /394 variables (removed 2) and now considering 2104/2106 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 392/394 places, 2104/2106 transitions.
RANDOM walk for 40000 steps (8 resets) in 250 ms. (159 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :4103 after 11203
Interrupted probabilistic random walk after 324531 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 2
Probabilistic random walk after 324531 steps, saw 179572 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2025-06-02 07:24:28] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2025-06-02 07:24:28] [INFO ] Computed 25 invariants in 3 ms
[2025-06-02 07:24:28] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/656 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/656 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 392/1048 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1048 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1048 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1048/1048 variables, and 702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 82/130 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/236 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/236 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/390 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/390 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/641 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/641 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/643 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:29] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/643 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/643 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/656 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/656 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/656 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 392/1048 variables, 266/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1048 variables, 247/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1048 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1048/1048 variables, and 705 constraints, problems are : Problem set: 0 solved, 2 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 149 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 62 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 61 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2025-06-02 07:24:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-02 07:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:24:30] [INFO ] Implicit Places using invariants in 440 ms returned []
[2025-06-02 07:24:30] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-02 07:24:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:24:30] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:24:32] [INFO ] Implicit Places using invariants and state equation in 1946 ms returned []
Implicit Place search using SMT with State Equation took 2388 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:24:32] [INFO ] Redundant transitions in 127 ms returned []
Running 2096 sub problems to find dead transitions.
[2025-06-02 07:24:32] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2025-06-02 07:24:32] [INFO ] Invariant cache hit.
[2025-06-02 07:24:32] [INFO ] State equation strengthened by 284 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :11203 after 18695
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :18695 after 79401
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:46] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:46] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:47] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:48] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:48] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:49] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:49] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:49] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:49] [INFO ] Deduced a trap composed of 42 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:50] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:50] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:50] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 20/45 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:54] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:56] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:56] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:24:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/1048 variables, and 50 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:06] [INFO ] Deduced a trap composed of 42 places in 142 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:06] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:07] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:07] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 18 ms to minimize.
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :79401 after 121597
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:08] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:08] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:09] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:10] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:10] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:10] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:11] [INFO ] Deduced a trap composed of 58 places in 154 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2025-06-02 07:25:11] [INFO ] Flatten gal took : 75 ms
[2025-06-02 07:25:11] [INFO ] Applying decomposition
[2025-06-02 07:25:11] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:11] [INFO ] Flatten gal took : 68 ms
[2025-06-02 07:25:11] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14717192263663301769.txt' '-o' '/tmp/graph14717192263663301769.bin' '-w' '/tmp/graph14717192263663301769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14717192263663301769.bin' '-l' '-1' '-v' '-w' '/tmp/graph14717192263663301769.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:25:11] [INFO ] Decomposing Gal with order
[2025-06-02 07:25:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:25:11] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:12] [INFO ] Removed a total of 4368 redundant transitions.
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:12] [INFO ] Flatten gal took : 357 ms
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 524 labels/synchronizations in 93 ms.
[2025-06-02 07:25:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11729341813536707645.gal : 23 ms
[2025-06-02 07:25:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8316496818923363493.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11729341813536707645.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8316496818923363493.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality8316496818923363493.prop.
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2387
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2387 after 2420
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :2420 after 2659
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:12] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:19] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:20] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:21] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 14 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2659 after 983359
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:25] [INFO ] Deduced a trap composed of 21 places in 158 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:26] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:29] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:32] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:33] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:33] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:33] [INFO ] Deduced a trap composed of 23 places in 191 ms of which 20 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/1048 variables, and 80 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60664ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 60674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63270 ms. Remains : 392/392 places, 2104/2104 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1958 edges and 392 vertex of which 64 / 392 are part of one of the 8 SCC in 3 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 216 transitions
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1616 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 336 transition count 409
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 257 transition count 409
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 159 place count 257 transition count 392
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 201 place count 232 transition count 392
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 0 ms
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 222 rules applied. Total rules applied 423 place count 121 transition count 281
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 2 with 56 rules applied. Total rules applied 479 place count 121 transition count 225
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 495 place count 113 transition count 225
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 503 place count 113 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 511 place count 113 transition count 209
Free-agglomeration rule applied 56 times.
Iterating global reduction 4 with 56 rules applied. Total rules applied 567 place count 113 transition count 153
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 4 with 56 rules applied. Total rules applied 623 place count 57 transition count 153
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 631 place count 57 transition count 153
Applied a total of 631 rules in 39 ms. Remains 57 /392 variables (removed 335) and now considering 153/2104 (removed 1951) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 153 rows 57 cols
[2025-06-02 07:25:33] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 07:25:33] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2025-06-02 07:25:33] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2025-06-02 07:25:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-02 07:25:33] [INFO ] After 13ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2025-06-02 07:25:33] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 07:25:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2025-06-02 07:25:33] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2025-06-02 07:25:33] [INFO ] After 7ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2025-06-02 07:25:33] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2025-06-02 07:25:33] [INFO ] After 86ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2025-06-02 07:25:33] [INFO ] Flatten gal took : 7 ms
[2025-06-02 07:25:33] [INFO ] Flatten gal took : 5 ms
[2025-06-02 07:25:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17737408445586207780.gal : 1 ms
[2025-06-02 07:25:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8956555533940536461.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17737408445586207780.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8956555533940536461.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8956555533940536461.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :12 after 48
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,252,0.022754,5680,2,172,8,684,6,0,384,334,0
Total reachable state count : 252

Verifying 2 reachability properties.
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,8,0.023166,5680,2,71,8,684,7,0,387,334,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,8,0.023346,5680,2,71,8,684,8,0,388,334,0
Over-approximation ignoring read arcs solved 0 properties in 269 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-08-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-08-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2025-06-02 07:25:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
// Phase 1: matrix 658 rows 394 cols
[2025-06-02 07:25:33] [INFO ] Computed 25 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 07:25:33] [INFO ] Flow matrix only has 658 transitions (discarded 1448 similar events)
[2025-06-02 07:25:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:25:33] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:25:33] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2025-06-02 07:25:34] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-02 07:25:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:25:34] [INFO ] [Real]Added 284 Read/Feed constraints in 43 ms returned sat
[2025-06-02 07:25:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 07:25:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 07:25:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:25:34] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2025-06-02 07:25:34] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2025-06-02 07:25:34] [INFO ] Computed and/alt/rep : 571/1394/403 causal constraints (skipped 247 transitions) in 36 ms.
[2025-06-02 07:25:35] [INFO ] Added : 99 causal constraints over 20 iterations in 832 ms. Result :sat
Minimization took 152 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 394 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_2_0) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 394/394 places, 2105/2105 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 2103
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 2103
Applied a total of 4 rules in 84 ms. Remains 392 /394 variables (removed 2) and now considering 2103/2105 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 392/394 places, 2103/2105 transitions.
[2025-06-02 07:25:35] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
// Phase 1: matrix 655 rows 392 cols
[2025-06-02 07:25:35] [INFO ] Computed 25 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1722 ms. (580 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 455 ms. (2192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-02 07:25:37] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:25:37] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2025-06-02 07:25:37] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:25:37] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2025-06-02 07:25:37] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:25:37] [INFO ] [Real]Added 284 Read/Feed constraints in 37 ms returned sat
[2025-06-02 07:25:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-06-02 07:25:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-02 07:25:38] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2025-06-02 07:25:38] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2025-06-02 07:25:38] [INFO ] [Nat]Added 284 Read/Feed constraints in 40 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
[2025-06-02 07:25:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-02 07:25:38] [INFO ] Computed and/alt/rep : 569/1391/401 causal constraints (skipped 246 transitions) in 36 ms.
[2025-06-02 07:25:38] [INFO ] Added : 78 causal constraints over 16 iterations in 650 ms. Result :sat
Minimization took 126 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 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2103/2103 transitions.
Applied a total of 0 rules in 76 ms. Remains 392 /392 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 392/392 places, 2103/2103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2103/2103 transitions.
Applied a total of 0 rules in 65 ms. Remains 392 /392 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
[2025-06-02 07:25:39] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:25:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:25:39] [INFO ] Implicit Places using invariants in 450 ms returned []
[2025-06-02 07:25:39] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:25:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:25:39] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:25:41] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:25:41] [INFO ] Redundant transitions in 48 ms returned []
Running 2095 sub problems to find dead transitions.
[2025-06-02 07:25:41] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:25:41] [INFO ] Invariant cache hit.
[2025-06-02 07:25:41] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:56] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:58] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:59] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:25:59] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:02] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:02] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:04] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:04] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:06] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:07] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:08] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:08] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:09] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:10] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:11] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1047 variables, and 42 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2095/2095 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2095 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:21] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:22] [INFO ] Deduced a trap composed of 56 places in 135 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:23] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:25] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:27] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:30] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:31] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:31] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:31] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:31] [INFO ] Deduced a trap composed of 46 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:31] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:32] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1047 variables, and 54 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2095 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60581ms problems are : Problem set: 0 solved, 2095 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63228 ms. Remains : 392/392 places, 2103/2103 transitions.
[2025-06-02 07:26:42] [INFO ] Flatten gal took : 58 ms
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2025-06-02 07:26:42] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
[2025-06-02 07:26:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7654732343489955260.gal : 10 ms
[2025-06-02 07:26:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2642546506198408475.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7654732343489955260.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2642546506198408475.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality2642546506198408475.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 22
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :22 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 53
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :53 after 85
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :85 after 276
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :276 after 523
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :523 after 1211
Interrupted probabilistic random walk after 329328 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 2
Probabilistic random walk after 329328 steps, saw 182120 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2025-06-02 07:26:45] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:26:45] [INFO ] Invariant cache hit.
[2025-06-02 07:26:45] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:45] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/129 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/235 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/389 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/640 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/642 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/642 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/655 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/655 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 392/1047 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1047 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1047 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1047 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD size :1211 after 4271
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/129 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/235 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/389 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/640 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/642 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:46] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:46] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 22 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/642 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/642 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/655 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/655 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:46] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 8 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/655 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/655 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 392/1047 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1047 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1047 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1047 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 707 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1358 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1825ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2103/2103 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 392/392 places, 2103/2103 transitions.
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 336474 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 336474 steps, saw 185734 distinct states, run finished after 3002 ms. (steps per millisecond=112 ) properties seen :0
[2025-06-02 07:26:50] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:26:50] [INFO ] Invariant cache hit.
[2025-06-02 07:26:50] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/129 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/235 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :4271 after 12338
At refinement iteration 13 (OVERLAPS) 154/389 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/640 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/642 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/642 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 13/655 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/655 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 392/1047 variables, 266/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1047 variables, 247/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1047 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1047 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 702 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 81/129 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 106/235 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 10/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 154/389 variables, 70/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 25/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 251/640 variables, 13/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/640 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/642 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:51] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:51] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 21 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/642 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/642 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 13/655 variables, 7/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/655 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:26:52] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 8 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/655 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/655 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 392/1047 variables, 266/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1047 variables, 247/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1047 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/1047 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 707 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 392/392 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1820ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2103/2103 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 392/392 places, 2103/2103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2103/2103 transitions.
Applied a total of 0 rules in 52 ms. Remains 392 /392 variables (removed 0) and now considering 2103/2103 (removed 0) transitions.
[2025-06-02 07:26:52] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:26:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:26:53] [INFO ] Implicit Places using invariants in 500 ms returned []
[2025-06-02 07:26:53] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:26:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 07:26:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2025-06-02 07:26:55] [INFO ] Implicit Places using invariants and state equation in 2124 ms returned []
Implicit Place search using SMT with State Equation took 2625 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 07:26:55] [INFO ] Redundant transitions in 49 ms returned []
Running 2095 sub problems to find dead transitions.
[2025-06-02 07:26:55] [INFO ] Flow matrix only has 655 transitions (discarded 1448 similar events)
[2025-06-02 07:26:55] [INFO ] Invariant cache hit.
[2025-06-02 07:26:55] [INFO ] State equation strengthened by 284 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :12338 after 44148
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :44148 after 79473
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:12] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:12] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:15] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:16] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:17] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:17] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:19] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:20] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:21] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:22] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:23] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:24] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:25] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 391/1047 variables, and 42 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 2095/2095 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2095 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/391 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Detected timeout of ITS tools.
[2025-06-02 07:27:32] [INFO ] Flatten gal took : 51 ms
[2025-06-02 07:27:32] [INFO ] Applying decomposition
[2025-06-02 07:27:32] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9871235899651627.txt' '-o' '/tmp/graph9871235899651627.bin' '-w' '/tmp/graph9871235899651627.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9871235899651627.bin' '-l' '-1' '-v' '-w' '/tmp/graph9871235899651627.weights' '-q' '0' '-e' '0.001'
[2025-06-02 07:27:33] [INFO ] Decomposing Gal with order
[2025-06-02 07:27:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 07:27:33] [INFO ] Removed a total of 4419 redundant transitions.
[2025-06-02 07:27:33] [INFO ] Flatten gal took : 157 ms
[2025-06-02 07:27:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 552 labels/synchronizations in 83 ms.
[2025-06-02 07:27:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14404413403277647343.gal : 11 ms
[2025-06-02 07:27:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12639087399248876880.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14404413403277647343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12639087399248876880.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality12639087399248876880.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1930
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1930 after 21465
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :21465 after 25806
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:35] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:36] [INFO ] Deduced a trap composed of 56 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:37] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:38] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 5 ms to minimize.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,599791,7.81024,216048,11715,2314,279068,13248,3362,669623,528,99141,0
Total reachable state count : 599791

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,5,7.83322,216048,112,109,279068,13248,3365,669623,531,99141,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,5,7.83603,216048,112,109,279068,13248,3371,669623,533,99141,0
ITS tools runner thread asked to quit. Dying gracefully.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:41] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:44] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:45] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:45] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:45] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:45] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:45] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 07:27:46] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 2095 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 391/1047 variables, and 54 constraints, problems are : Problem set: 0 solved, 2095 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 7/8 constraints, State Equation: 0/392 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 0/2095 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 2095 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63348 ms. Remains : 392/392 places, 2103/2103 transitions.
FORMULA EisenbergMcGuire-PT-08-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-09 in 142275 ms.
[2025-06-02 07:27:56] [INFO ] Flatten gal took : 47 ms
Total runtime 355002 ms.

BK_STOP 1748849276208

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="EisenbergMcGuire-PT-08"
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-5832"
echo " Executing tool itstools"
echo " Input is EisenbergMcGuire-PT-08, 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 r072-tall-174860068100797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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