Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 757K 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 ASLink-PT-08a-UpperBounds-00
FORMULA_NAME ASLink-PT-08a-UpperBounds-01
FORMULA_NAME ASLink-PT-08a-UpperBounds-02
FORMULA_NAME ASLink-PT-08a-UpperBounds-03
FORMULA_NAME ASLink-PT-08a-UpperBounds-04
FORMULA_NAME ASLink-PT-08a-UpperBounds-05
FORMULA_NAME ASLink-PT-08a-UpperBounds-06
FORMULA_NAME ASLink-PT-08a-UpperBounds-07
FORMULA_NAME ASLink-PT-08a-UpperBounds-08
FORMULA_NAME ASLink-PT-08a-UpperBounds-09
FORMULA_NAME ASLink-PT-08a-UpperBounds-10
FORMULA_NAME ASLink-PT-08a-UpperBounds-11
FORMULA_NAME ASLink-PT-08a-UpperBounds-12
FORMULA_NAME ASLink-PT-08a-UpperBounds-13
FORMULA_NAME ASLink-PT-08a-UpperBounds-14
FORMULA_NAME ASLink-PT-08a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540482088

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:41:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 17:41:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:41:23] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-05-29 17:41:23] [INFO ] Transformed 1796 places.
[2025-05-29 17:41:23] [INFO ] Transformed 2646 transitions.
[2025-05-29 17:41:23] [INFO ] Found NUPN structural information;
[2025-05-29 17:41:23] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
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]
// Phase 1: matrix 2618 rows 1796 cols
[2025-05-29 17:41:23] [INFO ] Computed 346 invariants in 144 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 (54 resets) in 88 ms. (112 steps per ms)
FORMULA ASLink-PT-08a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110011 steps (49 resets) in 248 ms. (441 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:41:24] [INFO ] Invariant cache hit.
[2025-05-29 17:41:24] [INFO ] [Real]Absence check using 85 positive place invariants in 47 ms returned sat
[2025-05-29 17:41:24] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 131 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2025-05-29 17:41:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:26] [INFO ] [Nat]Absence check using 85 positive place invariants in 51 ms returned sat
[2025-05-29 17:41:26] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 62 ms returned sat
[2025-05-29 17:41:27] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2025-05-29 17:41:27] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 18 ms to minimize.
[2025-05-29 17:41:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 412 ms
[2025-05-29 17:41:28] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 179 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:41:31] [INFO ] [Real]Absence check using 85 positive place invariants in 40 ms returned sat
[2025-05-29 17:41:31] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 70 ms returned sat
[2025-05-29 17:41:32] [INFO ] [Real]Absence check using state equation in 1030 ms returned sat
[2025-05-29 17:41:33] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 2 ms to minimize.
[2025-05-29 17:41:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using 85 positive place invariants in 43 ms returned sat
[2025-05-29 17:41:33] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 65 ms returned sat
[2025-05-29 17:41:34] [INFO ] [Nat]Absence check using state equation in 896 ms returned sat
[2025-05-29 17:41:34] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 150 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 85 positive place invariants in 40 ms returned sat
[2025-05-29 17:41:38] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 66 ms returned sat
[2025-05-29 17:41:39] [INFO ] [Real]Absence check using state equation in 1044 ms returned sat
[2025-05-29 17:41:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 85 positive place invariants in 42 ms returned sat
[2025-05-29 17:41:40] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 76 ms returned sat
[2025-05-29 17:41:41] [INFO ] [Nat]Absence check using state equation in 833 ms returned sat
[2025-05-29 17:41:41] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
[2025-05-29 17:41:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2025-05-29 17:41:41] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 137 ms.
[2025-05-29 17:41:42] [INFO ] Added : 5 causal constraints over 1 iterations in 867 ms. Result :sat
Minimization took 596 ms.
[2025-05-29 17:41:43] [INFO ] [Real]Absence check using 85 positive place invariants in 41 ms returned sat
[2025-05-29 17:41:43] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 67 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2025-05-29 17:41:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 85 positive place invariants in 42 ms returned sat
[2025-05-29 17:41:44] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 65 ms returned sat
[2025-05-29 17:41:45] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2025-05-29 17:41:46] [INFO ] Deduced a trap composed of 75 places in 500 ms of which 9 ms to minimize.
[2025-05-29 17:41:46] [INFO ] Deduced a trap composed of 38 places in 383 ms of which 7 ms to minimize.
[2025-05-29 17:41:47] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 3 ms to minimize.
[2025-05-29 17:41:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1339 ms
[2025-05-29 17:41:47] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 145 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:41:49] [INFO ] [Real]Absence check using 85 positive place invariants in 39 ms returned sat
[2025-05-29 17:41:49] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 63 ms returned sat
[2025-05-29 17:41:50] [INFO ] [Real]Absence check using state equation in 1031 ms returned sat
[2025-05-29 17:41:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:51] [INFO ] [Nat]Absence check using 85 positive place invariants in 43 ms returned sat
[2025-05-29 17:41:51] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 68 ms returned sat
[2025-05-29 17:41:52] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2025-05-29 17:41:52] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 127 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:41:56] [INFO ] [Real]Absence check using 85 positive place invariants in 40 ms returned sat
[2025-05-29 17:41:56] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 71 ms returned sat
[2025-05-29 17:41:57] [INFO ] [Real]Absence check using state equation in 898 ms returned sat
[2025-05-29 17:41:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:41:57] [INFO ] [Nat]Absence check using 85 positive place invariants in 44 ms returned sat
[2025-05-29 17:41:57] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 69 ms returned sat
[2025-05-29 17:41:58] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2025-05-29 17:41:58] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 4 ms to minimize.
[2025-05-29 17:41:59] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2025-05-29 17:41:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 527 ms
[2025-05-29 17:41:59] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 163 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 85 positive place invariants in 39 ms returned sat
[2025-05-29 17:42:02] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 67 ms returned sat
[2025-05-29 17:42:03] [INFO ] [Real]Absence check using state equation in 920 ms returned sat
[2025-05-29 17:42:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using 85 positive place invariants in 42 ms returned sat
[2025-05-29 17:42:04] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 69 ms returned sat
[2025-05-29 17:42:05] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2025-05-29 17:42:05] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 134 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:42:09] [INFO ] [Real]Absence check using 85 positive place invariants in 40 ms returned sat
[2025-05-29 17:42:09] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 69 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Real]Absence check using state equation in 951 ms returned sat
[2025-05-29 17:42:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:10] [INFO ] [Nat]Absence check using 85 positive place invariants in 50 ms returned sat
[2025-05-29 17:42:10] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 70 ms returned sat
[2025-05-29 17:42:11] [INFO ] [Nat]Absence check using state equation in 1118 ms returned sat
[2025-05-29 17:42:11] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
[2025-05-29 17:42:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2025-05-29 17:42:12] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 145 ms.
[2025-05-29 17:42:15] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 85 positive place invariants in 42 ms returned sat
[2025-05-29 17:42:15] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 82 ms returned sat
[2025-05-29 17:42:16] [INFO ] [Real]Absence check using state equation in 1060 ms returned sat
[2025-05-29 17:42:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:17] [INFO ] [Nat]Absence check using 85 positive place invariants in 43 ms returned sat
[2025-05-29 17:42:17] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 62 ms returned sat
[2025-05-29 17:42:18] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2025-05-29 17:42:18] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 2 ms to minimize.
[2025-05-29 17:42:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2025-05-29 17:42:18] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 134 ms.
[2025-05-29 17:42:19] [INFO ] Added : 5 causal constraints over 1 iterations in 932 ms. Result :sat
Minimization took 587 ms.
[2025-05-29 17:42:20] [INFO ] [Real]Absence check using 85 positive place invariants in 41 ms returned sat
[2025-05-29 17:42:20] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 67 ms returned sat
[2025-05-29 17:42:21] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2025-05-29 17:42:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:22] [INFO ] [Nat]Absence check using 85 positive place invariants in 44 ms returned sat
[2025-05-29 17:42:22] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 67 ms returned sat
[2025-05-29 17:42:24] [INFO ] [Nat]Absence check using state equation in 2583 ms returned unknown
[2025-05-29 17:42:24] [INFO ] [Real]Absence check using 85 positive place invariants in 39 ms returned sat
[2025-05-29 17:42:25] [INFO ] [Real]Absence check using 85 positive and 261 generalized place invariants in 64 ms returned sat
[2025-05-29 17:42:26] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2025-05-29 17:42:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:26] [INFO ] [Nat]Absence check using 85 positive place invariants in 46 ms returned sat
[2025-05-29 17:42:26] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 75 ms returned sat
[2025-05-29 17:42:27] [INFO ] [Nat]Absence check using state equation in 1026 ms returned sat
[2025-05-29 17:42:28] [INFO ] Computed and/alt/rep : 1106/3898/1106 causal constraints (skipped 1511 transitions) in 149 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 211 rules applied. Total rules applied 211 place count 1748 transition count 2455
Reduce places removed 163 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 164 rules applied. Total rules applied 375 place count 1585 transition count 2454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 1584 transition count 2454
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 376 place count 1584 transition count 2287
Deduced a syphon composed of 167 places in 9 ms
Ensure Unique test removed 66 places
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 776 place count 1351 transition count 2287
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 777 place count 1351 transition count 2286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 778 place count 1350 transition count 2286
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 789 place count 1339 transition count 2227
Ensure Unique test removed 1 places
Iterating global reduction 5 with 12 rules applied. Total rules applied 801 place count 1338 transition count 2227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 807 place count 1337 transition count 2222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 810 place count 1334 transition count 2222
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 1333 transition count 2214
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 1333 transition count 2214
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1332 transition count 2206
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1332 transition count 2206
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1331 transition count 2198
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1331 transition count 2198
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1330 transition count 2190
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1330 transition count 2190
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1329 transition count 2182
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1329 transition count 2182
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1328 transition count 2174
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1328 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1327 transition count 2166
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1327 transition count 2166
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1326 transition count 2158
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1326 transition count 2158
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 827 place count 1325 transition count 2150
Iterating global reduction 7 with 1 rules applied. Total rules applied 828 place count 1325 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 829 place count 1324 transition count 2142
Iterating global reduction 7 with 1 rules applied. Total rules applied 830 place count 1324 transition count 2142
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 831 place count 1323 transition count 2134
Iterating global reduction 7 with 1 rules applied. Total rules applied 832 place count 1323 transition count 2134
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 833 place count 1322 transition count 2126
Iterating global reduction 7 with 1 rules applied. Total rules applied 834 place count 1322 transition count 2126
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 835 place count 1321 transition count 2118
Iterating global reduction 7 with 1 rules applied. Total rules applied 836 place count 1321 transition count 2118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 837 place count 1320 transition count 2110
Iterating global reduction 7 with 1 rules applied. Total rules applied 838 place count 1320 transition count 2110
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 839 place count 1319 transition count 2102
Iterating global reduction 7 with 1 rules applied. Total rules applied 840 place count 1319 transition count 2102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 841 place count 1318 transition count 2094
Iterating global reduction 7 with 1 rules applied. Total rules applied 842 place count 1318 transition count 2094
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 7 with 108 rules applied. Total rules applied 950 place count 1264 transition count 2040
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 951 place count 1264 transition count 2039
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 952 place count 1263 transition count 2039
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 959 place count 1263 transition count 2032
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 966 place count 1256 transition count 2032
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 975 place count 1256 transition count 2032
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 976 place count 1255 transition count 2031
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 991 place count 1240 transition count 2031
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 31 Pre rules applied. Total rules applied 991 place count 1240 transition count 2000
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 10 with 63 rules applied. Total rules applied 1054 place count 1208 transition count 2000
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 10 with 8 rules applied. Total rules applied 1062 place count 1200 transition count 2000
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1062 place count 1200 transition count 1999
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1064 place count 1199 transition count 1999
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1080 place count 1191 transition count 1991
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 1087 place count 1184 transition count 1984
Iterating global reduction 11 with 7 rules applied. Total rules applied 1094 place count 1184 transition count 1984
Free-agglomeration rule applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 1101 place count 1184 transition count 1977
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 1108 place count 1177 transition count 1977
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 12 with 7 rules applied. Total rules applied 1115 place count 1177 transition count 1977
Applied a total of 1115 rules in 2107 ms. Remains 1177 /1796 variables (removed 619) and now considering 1977/2618 (removed 641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2120 ms. Remains : 1177/1796 places, 1977/2618 transitions.
// Phase 1: matrix 1977 rows 1177 cols
[2025-05-29 17:42:33] [INFO ] Computed 206 invariants in 51 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (10306 resets) in 3534 ms. (282 steps per ms)
FORMULA ASLink-PT-08a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000006 steps (7689 resets) in 9029 ms. (664 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-05-29 17:42:46] [INFO ] Invariant cache hit.
[2025-05-29 17:42:46] [INFO ] [Real]Absence check using 49 positive place invariants in 18 ms returned sat
[2025-05-29 17:42:46] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 30 ms returned sat
[2025-05-29 17:42:46] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2025-05-29 17:42:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using 49 positive place invariants in 20 ms returned sat
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 31 ms returned sat
[2025-05-29 17:42:47] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2025-05-29 17:42:47] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 103 ms.
[2025-05-29 17:42:51] [INFO ] Added : 146 causal constraints over 33 iterations in 3603 ms. Result :sat
Minimization took 1401 ms.
[2025-05-29 17:42:52] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2025-05-29 17:42:52] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 35 ms returned sat
[2025-05-29 17:42:53] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2025-05-29 17:42:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:42:53] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2025-05-29 17:42:53] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 34 ms returned sat
[2025-05-29 17:42:54] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2025-05-29 17:42:54] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 108 ms.
[2025-05-29 17:43:07] [INFO ] Added : 638 causal constraints over 128 iterations in 12856 ms. Result :sat
Minimization took 1721 ms.
[2025-05-29 17:43:09] [INFO ] [Real]Absence check using 49 positive place invariants in 16 ms returned sat
[2025-05-29 17:43:09] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 34 ms returned sat
[2025-05-29 17:43:09] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2025-05-29 17:43:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:10] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2025-05-29 17:43:10] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 36 ms returned sat
[2025-05-29 17:43:10] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2025-05-29 17:43:11] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 105 ms.
[2025-05-29 17:43:15] [INFO ] Added : 202 causal constraints over 41 iterations in 4597 ms. Result :sat
Minimization took 1695 ms.
[2025-05-29 17:43:17] [INFO ] [Real]Absence check using 49 positive place invariants in 17 ms returned sat
[2025-05-29 17:43:17] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 34 ms returned sat
[2025-05-29 17:43:18] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2025-05-29 17:43:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:18] [INFO ] [Nat]Absence check using 49 positive place invariants in 18 ms returned sat
[2025-05-29 17:43:18] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 33 ms returned sat
[2025-05-29 17:43:18] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2025-05-29 17:43:19] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 99 ms.
[2025-05-29 17:43:22] [INFO ] Added : 173 causal constraints over 35 iterations in 3741 ms. Result :sat
Minimization took 1509 ms.
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using 49 positive place invariants in 18 ms returned sat
[2025-05-29 17:43:24] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 34 ms returned sat
[2025-05-29 17:43:25] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2025-05-29 17:43:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:25] [INFO ] [Nat]Absence check using 49 positive place invariants in 17 ms returned sat
[2025-05-29 17:43:25] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 34 ms returned sat
[2025-05-29 17:43:26] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2025-05-29 17:43:26] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 95 ms.
[2025-05-29 17:43:41] [INFO ] Added : 549 causal constraints over 110 iterations in 15166 ms. Result :sat
Minimization took 2704 ms.
[2025-05-29 17:43:44] [INFO ] [Real]Absence check using 49 positive place invariants in 15 ms returned sat
[2025-05-29 17:43:44] [INFO ] [Real]Absence check using 49 positive and 157 generalized place invariants in 33 ms returned sat
[2025-05-29 17:43:44] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2025-05-29 17:43:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:43:45] [INFO ] [Nat]Absence check using 49 positive place invariants in 19 ms returned sat
[2025-05-29 17:43:45] [INFO ] [Nat]Absence check using 49 positive and 157 generalized place invariants in 52 ms returned sat
[2025-05-29 17:43:45] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2025-05-29 17:43:45] [INFO ] Computed and/alt/rep : 788/2969/788 causal constraints (skipped 1147 transitions) in 97 ms.
[2025-05-29 17:43:51] [INFO ] Added : 270 causal constraints over 54 iterations in 5998 ms. Result :sat
Minimization took 1452 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 ASLink-PT-08a-UpperBounds-01 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 1177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 1977/1977 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1177 transition count 1976
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1175 transition count 1976
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 1175 transition count 1974
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 1173 transition count 1974
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1172 transition count 1974
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 1170 transition count 1972
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 13 place count 1169 transition count 1971
Iterating global reduction 3 with 1 rules applied. Total rules applied 14 place count 1169 transition count 1971
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 1169 transition count 1970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 1168 transition count 1970
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 18 place count 1168 transition count 1970
Applied a total of 18 rules in 189 ms. Remains 1168 /1177 variables (removed 9) and now considering 1970/1977 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 1168/1177 places, 1970/1977 transitions.
// Phase 1: matrix 1970 rows 1168 cols
[2025-05-29 17:44:04] [INFO ] Computed 204 invariants in 24 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 (10329 resets) in 3346 ms. (298 steps per ms)
BEST_FIRST walk for 5000005 steps (6411 resets) in 7252 ms. (689 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-05-29 17:44:14] [INFO ] Invariant cache hit.
[2025-05-29 17:44:14] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2025-05-29 17:44:14] [INFO ] [Real]Absence check using 58 positive and 146 generalized place invariants in 28 ms returned sat
[2025-05-29 17:44:15] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2025-05-29 17:44:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:15] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2025-05-29 17:44:15] [INFO ] [Nat]Absence check using 58 positive and 146 generalized place invariants in 31 ms returned sat
[2025-05-29 17:44:16] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2025-05-29 17:44:16] [INFO ] Computed and/alt/rep : 782/2961/782 causal constraints (skipped 1147 transitions) in 95 ms.
[2025-05-29 17:44:21] [INFO ] Added : 227 causal constraints over 46 iterations in 5056 ms. Result :sat
Minimization took 1247 ms.
[2025-05-29 17:44:22] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2025-05-29 17:44:22] [INFO ] [Real]Absence check using 58 positive and 146 generalized place invariants in 39 ms returned sat
[2025-05-29 17:44:23] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2025-05-29 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:23] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:23] [INFO ] [Nat]Absence check using 58 positive and 146 generalized place invariants in 31 ms returned sat
[2025-05-29 17:44:24] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2025-05-29 17:44:24] [INFO ] Computed and/alt/rep : 782/2961/782 causal constraints (skipped 1147 transitions) in 94 ms.
[2025-05-29 17:44:36] [INFO ] Added : 605 causal constraints over 121 iterations in 12440 ms. Result :sat
Minimization took 1324 ms.
[2025-05-29 17:44:38] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2025-05-29 17:44:38] [INFO ] [Real]Absence check using 58 positive and 146 generalized place invariants in 32 ms returned sat
[2025-05-29 17:44:39] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2025-05-29 17:44:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:39] [INFO ] [Nat]Absence check using 58 positive place invariants in 18 ms returned sat
[2025-05-29 17:44:39] [INFO ] [Nat]Absence check using 58 positive and 146 generalized place invariants in 30 ms returned sat
[2025-05-29 17:44:39] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2025-05-29 17:44:40] [INFO ] Deduced a trap composed of 111 places in 374 ms of which 6 ms to minimize.
[2025-05-29 17:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 489 ms
[2025-05-29 17:44:40] [INFO ] Computed and/alt/rep : 782/2961/782 causal constraints (skipped 1147 transitions) in 109 ms.
[2025-05-29 17:44:52] [INFO ] Added : 560 causal constraints over 112 iterations in 12251 ms. Result :sat
Minimization took 1355 ms.
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using 58 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using 58 positive and 146 generalized place invariants in 29 ms returned sat
[2025-05-29 17:44:54] [INFO ] [Real]Absence check using state equation in 570 ms returned sat
[2025-05-29 17:44:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 58 positive place invariants in 19 ms returned sat
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using 58 positive and 146 generalized place invariants in 32 ms returned sat
[2025-05-29 17:44:55] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2025-05-29 17:44:56] [INFO ] Computed and/alt/rep : 782/2961/782 causal constraints (skipped 1147 transitions) in 97 ms.
[2025-05-29 17:45:07] [INFO ] Deduced a trap composed of 106 places in 343 ms of which 5 ms to minimize.
[2025-05-29 17:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 511 ms
[2025-05-29 17:45:07] [INFO ] Added : 547 causal constraints over 110 iterations in 11986 ms. Result :sat
Minimization took 2041 ms.
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 58 positive place invariants in 33 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using 58 positive and 146 generalized place invariants in 29 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2025-05-29 17:45:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 20 ms returned sat
[2025-05-29 17:45:10] [INFO ] [Nat]Absence check using 58 positive and 146 generalized place invariants in 30 ms returned sat
[2025-05-29 17:45:11] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2025-05-29 17:45:11] [INFO ] Computed and/alt/rep : 782/2961/782 causal constraints (skipped 1147 transitions) in 106 ms.
[2025-05-29 17:45:15] [INFO ] Added : 189 causal constraints over 38 iterations in 4426 ms. Result :sat
Minimization took 1136 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 1168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1970/1970 transitions.
Applied a total of 0 rules in 36 ms. Remains 1168 /1168 variables (removed 0) and now considering 1970/1970 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1168/1168 places, 1970/1970 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1970/1970 transitions.
Applied a total of 0 rules in 35 ms. Remains 1168 /1168 variables (removed 0) and now considering 1970/1970 (removed 0) transitions.
[2025-05-29 17:45:22] [INFO ] Invariant cache hit.
[2025-05-29 17:45:23] [INFO ] Implicit Places using invariants in 744 ms returned [0, 18, 19, 30, 48, 66, 103, 137, 141, 150, 151, 152, 170, 188, 257, 261, 262, 273, 274, 275, 293, 311, 380, 384, 385, 396, 397, 398, 416, 434, 503, 507, 508, 519, 520, 521, 539, 557, 626, 630, 631, 642, 643, 644, 662, 680, 749, 753, 754, 765, 766, 767, 785, 803, 872, 876, 877, 888, 889, 890, 908, 926, 995, 999, 1000, 1003, 1014, 1015, 1016, 1034, 1036, 1039, 1057, 1058, 1059, 1060, 1072, 1078, 1084, 1090, 1096, 1102, 1108, 1114, 1120, 1126, 1132]
[2025-05-29 17:45:23] [INFO ] Actually due to overlaps returned [1034, 1016, 30, 48, 152, 170, 275, 293, 398, 416, 521, 539, 644, 662, 767, 785, 890, 908, 1039, 151, 274, 397, 520, 643, 766, 889, 1015, 1058, 150, 273, 396, 519, 642, 765, 888, 1014, 1036, 1057, 0, 261, 262, 384, 385, 507, 508, 630, 631, 753, 754, 876, 877, 999, 1000, 18, 19, 66, 188, 311, 434, 557, 680, 803, 926, 1060, 1102, 1120, 1132, 1003, 1059, 1072, 1078, 1084, 1090, 1096, 1108, 1114, 1126]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 750 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1091/1168 places, 1970/1970 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 1082 transition count 1821
Reduce places removed 149 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 308 place count 933 transition count 1820
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 309 place count 932 transition count 1820
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 309 place count 932 transition count 1782
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 386 place count 893 transition count 1782
Discarding 4 places :
Implicit places reduction removed 4 places
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 3 with 12 rules applied. Total rules applied 398 place count 889 transition count 1774
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 406 place count 881 transition count 1774
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 421 place count 866 transition count 1759
Iterating global reduction 5 with 15 rules applied. Total rules applied 436 place count 866 transition count 1759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 439 place count 866 transition count 1756
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 439 place count 866 transition count 1755
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 441 place count 865 transition count 1755
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 444 place count 862 transition count 1752
Iterating global reduction 6 with 3 rules applied. Total rules applied 447 place count 862 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 448 place count 861 transition count 1751
Iterating global reduction 6 with 1 rules applied. Total rules applied 449 place count 861 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 450 place count 860 transition count 1750
Iterating global reduction 6 with 1 rules applied. Total rules applied 451 place count 860 transition count 1750
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 581 place count 795 transition count 1685
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 588 place count 795 transition count 1678
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 595 place count 788 transition count 1671
Iterating global reduction 7 with 7 rules applied. Total rules applied 602 place count 788 transition count 1671
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 609 place count 788 transition count 1664
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 610 place count 788 transition count 1663
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 628 place count 788 transition count 1645
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 8 with 19 rules applied. Total rules applied 647 place count 769 transition count 1645
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 671 place count 769 transition count 1645
Applied a total of 671 rules in 374 ms. Remains 769 /1091 variables (removed 322) and now considering 1645/1970 (removed 325) transitions.
// Phase 1: matrix 1645 rows 769 cols
[2025-05-29 17:45:23] [INFO ] Computed 112 invariants in 20 ms
[2025-05-29 17:45:24] [INFO ] Implicit Places using invariants in 506 ms returned [91, 97, 100, 102, 104, 107, 108, 160, 178, 184, 187, 189, 194, 195, 247, 264, 270, 273, 275, 280, 281, 333, 350, 356, 359, 361, 366, 367, 419, 436, 442, 445, 447, 452, 453, 505, 522, 528, 531, 533, 538, 539, 591, 609, 615, 618, 620, 625, 626, 678, 695, 701, 704, 706]
[2025-05-29 17:45:24] [INFO ] Actually due to overlaps returned [107, 194, 280, 366, 452, 538, 625, 108, 281, 367, 453, 539, 626, 195, 91, 97, 102, 104, 178, 184, 189, 264, 270, 275, 350, 356, 361, 436, 442, 447, 522, 528, 533, 609, 615, 620, 695, 701, 706, 160, 247, 333, 419, 505, 591, 678]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 509 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 723/1168 places, 1645/1970 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 692 transition count 1614
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 692 transition count 1614
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 70 place count 684 transition count 1606
Iterating global reduction 0 with 8 rules applied. Total rules applied 78 place count 684 transition count 1606
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 110 place count 668 transition count 1590
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 134 place count 668 transition count 1566
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 158 place count 644 transition count 1566
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 644 transition count 1559
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 172 place count 637 transition count 1559
Applied a total of 172 rules in 128 ms. Remains 637 /723 variables (removed 86) and now considering 1559/1645 (removed 86) transitions.
// Phase 1: matrix 1559 rows 637 cols
[2025-05-29 17:45:24] [INFO ] Computed 66 invariants in 13 ms
[2025-05-29 17:45:24] [INFO ] Implicit Places using invariants in 366 ms returned []
[2025-05-29 17:45:24] [INFO ] Invariant cache hit.
[2025-05-29 17:45:26] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 637/1168 places, 1559/1970 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3429 ms. Remains : 637/1168 places, 1559/1970 transitions.
[2025-05-29 17:45:26] [INFO ] Invariant cache hit.
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 (17121 resets) in 2176 ms. (459 steps per ms)
BEST_FIRST walk for 5000005 steps (14637 resets) in 3963 ms. (1261 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-05-29 17:45:32] [INFO ] Invariant cache hit.
[2025-05-29 17:45:32] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:32] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 21 ms returned sat
[2025-05-29 17:45:32] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2025-05-29 17:45:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:32] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:32] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-29 17:45:33] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2025-05-29 17:45:33] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 86 ms.
[2025-05-29 17:45:34] [INFO ] Added : 35 causal constraints over 8 iterations in 669 ms. Result :sat
Minimization took 500 ms.
[2025-05-29 17:45:34] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:34] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 12 ms returned sat
[2025-05-29 17:45:35] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2025-05-29 17:45:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:35] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:35] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-29 17:45:35] [INFO ] [Nat]Absence check using state equation in 426 ms returned sat
[2025-05-29 17:45:35] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 78 ms.
[2025-05-29 17:45:36] [INFO ] Added : 54 causal constraints over 11 iterations in 887 ms. Result :sat
Minimization took 541 ms.
[2025-05-29 17:45:37] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:37] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-29 17:45:37] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2025-05-29 17:45:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:37] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-29 17:45:38] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2025-05-29 17:45:38] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 75 ms.
[2025-05-29 17:45:38] [INFO ] Added : 24 causal constraints over 5 iterations in 481 ms. Result :sat
Minimization took 475 ms.
[2025-05-29 17:45:39] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:39] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-29 17:45:39] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2025-05-29 17:45:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:39] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-29 17:45:40] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2025-05-29 17:45:40] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 81 ms.
[2025-05-29 17:45:41] [INFO ] Added : 37 causal constraints over 8 iterations in 730 ms. Result :sat
Minimization took 480 ms.
[2025-05-29 17:45:41] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:41] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-29 17:45:42] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2025-05-29 17:45:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:42] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:42] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2025-05-29 17:45:42] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 82 ms.
[2025-05-29 17:45:43] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2025-05-29 17:45:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-05-29 17:45:43] [INFO ] Added : 47 causal constraints over 10 iterations in 1078 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-08a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 21 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 637/637 places, 1559/1559 transitions.
[2025-05-29 17:45:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (16961 resets) in 2173 ms. (459 steps per ms)
BEST_FIRST walk for 4000002 steps (11753 resets) in 3157 ms. (1266 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-29 17:45:51] [INFO ] Invariant cache hit.
[2025-05-29 17:45:51] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:51] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:51] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-05-29 17:45:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2025-05-29 17:45:51] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 14 ms returned sat
[2025-05-29 17:45:52] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2025-05-29 17:45:52] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 74 ms.
[2025-05-29 17:45:52] [INFO ] Added : 35 causal constraints over 8 iterations in 654 ms. Result :sat
Minimization took 515 ms.
[2025-05-29 17:45:53] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:53] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-29 17:45:54] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2025-05-29 17:45:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:54] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:54] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2025-05-29 17:45:54] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 72 ms.
[2025-05-29 17:45:55] [INFO ] Added : 54 causal constraints over 11 iterations in 902 ms. Result :sat
Minimization took 563 ms.
[2025-05-29 17:45:56] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-05-29 17:45:56] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2025-05-29 17:45:56] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2025-05-29 17:45:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:57] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 13 ms returned sat
[2025-05-29 17:45:57] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2025-05-29 17:45:57] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 73 ms.
[2025-05-29 17:45:57] [INFO ] Added : 24 causal constraints over 5 iterations in 499 ms. Result :sat
Minimization took 524 ms.
[2025-05-29 17:45:58] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:58] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 23 ms returned sat
[2025-05-29 17:45:58] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2025-05-29 17:45:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:45:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-05-29 17:45:59] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 18 ms returned sat
[2025-05-29 17:45:59] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2025-05-29 17:45:59] [INFO ] Computed and/alt/rep : 356/1544/356 causal constraints (skipped 1165 transitions) in 78 ms.
[2025-05-29 17:46:00] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 1 ms to minimize.
[2025-05-29 17:46:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2025-05-29 17:46:00] [INFO ] Added : 47 causal constraints over 10 iterations in 1146 ms. Result :sat
Minimization took 535 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 637 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 18 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 637/637 places, 1559/1559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1559/1559 transitions.
Applied a total of 0 rules in 17 ms. Remains 637 /637 variables (removed 0) and now considering 1559/1559 (removed 0) transitions.
[2025-05-29 17:46:02] [INFO ] Invariant cache hit.
[2025-05-29 17:46:03] [INFO ] Implicit Places using invariants in 560 ms returned []
[2025-05-29 17:46:03] [INFO ] Invariant cache hit.
[2025-05-29 17:46:04] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1838 ms to find 0 implicit places.
[2025-05-29 17:46:04] [INFO ] Redundant transitions in 119 ms returned []
Running 1521 sub problems to find dead transitions.
[2025-05-29 17:46:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 1521/1521 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1521 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/636 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/636 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 1521 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 1)
(s163 0)
(s164 1)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 1)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 1)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 1)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 636/2196 variables, and 61 constraints, problems are : Problem set: 0 solved, 1521 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 12/15 constraints, Generalized P Invariants (flows): 49/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 0/1521 constraints, Known Traps: 0/0 constraints]
After SMT, in 61456ms problems are : Problem set: 0 solved, 1521 unsolved
Search for dead transitions found 0 dead transitions in 61510ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63506 ms. Remains : 637/637 places, 1559/1559 transitions.
RANDOM walk for 40000 steps (699 resets) in 1137 ms. (35 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (116 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (115 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (117 resets) in 128 ms. (310 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (118 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (110 resets) in 327 ms. (121 steps per ms) remains 8/8 properties
[2025-05-29 17:47:06] [INFO ] Flatten gal took : 328 ms
BEST_FIRST walk for 40003 steps (118 resets) in 257 ms. (155 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
[2025-05-29 17:47:06] [INFO ] Flatten gal took : 227 ms
BEST_FIRST walk for 40002 steps (122 resets) in 326 ms. (122 steps per ms) remains 8/8 properties
[2025-05-29 17:47:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality443368411251751427.gal : 50 ms
[2025-05-29 17:47:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13419041501650027337.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality443368411251751427.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13419041501650027337.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality13419041501650027337.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :6 after 12
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :12 after 44
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :18272 after 3.25755e+07
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :3.25755e+07 after 6.25561e+07
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :6.25561e+07 after 6.41588e+07
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :6.41588e+07 after 6.41691e+07
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6.41691e+07 after 1.87305e+09
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.87305e+09 after 2.16912e+09
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :2.16912e+09 after 2.51369e+11
Interrupted probabilistic random walk after 141054 steps, run timeout after 3003 ms. (steps per millisecond=46 ) properties seen :0 out of 8
Probabilistic random walk after 141054 steps, saw 89411 distinct states, run finished after 3007 ms. (steps per millisecond=46 ) properties seen :0
[2025-05-29 17:47:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 159/162 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 16/178 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 13/191 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 33/224 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 325/549 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 20/569 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
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 8193 fixpoint passes
[2025-05-29 17:47:10] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
After SMT solving in domain Real declared 569/2196 variables, and 56 constraints, problems are : Problem set: 6 solved, 0 unsolved in 662 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 40/51 constraints, State Equation: 0/637 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 680ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-08a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-08a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-08a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-08a-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 347394 ms.

BK_STOP 1748540830770

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is ASLink-PT-08a, 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 r013-tall-174853743000050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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