Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r015-oct2-177944372400038.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is ASLink-PT-02a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r015-oct2-177944372400038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 279K Mar 3 18:30 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-02a-UpperBounds-00
FORMULA_NAME ASLink-PT-02a-UpperBounds-01
FORMULA_NAME ASLink-PT-02a-UpperBounds-02
FORMULA_NAME ASLink-PT-02a-UpperBounds-03
FORMULA_NAME ASLink-PT-02a-UpperBounds-04
FORMULA_NAME ASLink-PT-02a-UpperBounds-05
FORMULA_NAME ASLink-PT-02a-UpperBounds-06
FORMULA_NAME ASLink-PT-02a-UpperBounds-07
FORMULA_NAME ASLink-PT-02a-UpperBounds-08
FORMULA_NAME ASLink-PT-02a-UpperBounds-09
FORMULA_NAME ASLink-PT-02a-UpperBounds-10
FORMULA_NAME ASLink-PT-02a-UpperBounds-11
FORMULA_NAME ASLink-PT-02a-UpperBounds-12
FORMULA_NAME ASLink-PT-02a-UpperBounds-13
FORMULA_NAME ASLink-PT-02a-UpperBounds-14
FORMULA_NAME ASLink-PT-02a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779685498266

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-25 05:04:59] [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]
[2026-05-25 05:04:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:05:00] [INFO ] Load time of PNML (sax parser for PT used): 211 ms
[2026-05-25 05:05:00] [INFO ] Transformed 626 places.
[2026-05-25 05:05:00] [INFO ] Transformed 1008 transitions.
[2026-05-25 05:05:00] [INFO ] Found NUPN structural information;
[2026-05-25 05:05:00] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 396 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 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 998 rows 626 cols
[2026-05-25 05:05:00] [INFO ] Computed 118 invariants in 83 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 (120 resets) in 97 ms. (102 steps per ms)
FORMULA ASLink-PT-02a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-02a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (172 resets) in 169 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-25 05:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:01] [INFO ] [Real]Absence check using 28 positive place invariants in 14 ms returned sat
[2026-05-25 05:05:01] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 35 ms returned sat
[2026-05-25 05:05:01] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2026-05-25 05:05:01] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:02] [INFO ] [Nat]Absence check using 28 positive place invariants in 72 ms returned sat
[2026-05-25 05:05:02] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 53 ms returned sat
[2026-05-25 05:05:03] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2026-05-25 05:05:03] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 62 ms.
[2026-05-25 05:05: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
[2026-05-25 05:05:07] [INFO ] [Real]Absence check using 28 positive place invariants in 11 ms returned sat
[2026-05-25 05:05:07] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 32 ms returned sat
[2026-05-25 05:05:07] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2026-05-25 05:05:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:07] [INFO ] [Nat]Absence check using 28 positive place invariants in 41 ms returned sat
[2026-05-25 05:05:07] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 51 ms returned sat
[2026-05-25 05:05:08] [INFO ] [Nat]Absence check using state equation in 301 ms returned sat
[2026-05-25 05:05:08] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 71 ms.
[2026-05-25 05:05:12] [INFO ] Added : 260 causal constraints over 52 iterations in 4437 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:12] [INFO ] [Real]Absence check using 28 positive place invariants in 18 ms returned sat
[2026-05-25 05:05:12] [INFO ] [Real]Absence check using 28 positive and 90 generalized place invariants in 33 ms returned sat
[2026-05-25 05:05:13] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2026-05-25 05:05:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-25 05:05:13] [INFO ] [Nat]Absence check using 28 positive place invariants in 12 ms returned sat
[2026-05-25 05:05:13] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 37 ms returned sat
[2026-05-25 05:05:13] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2026-05-25 05:05:13] [INFO ] Computed and/alt/rep : 362/1378/362 causal constraints (skipped 635 transitions) in 75 ms.
[2026-05-25 05:05:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 1] Max Struct:[1, 1, 1]
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 614 transition count 947
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 114 place count 563 transition count 947
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 114 place count 563 transition count 898
Deduced a syphon composed of 49 places in 2 ms
Ensure Unique test removed 19 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 117 rules applied. Total rules applied 231 place count 495 transition count 898
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 2 with 1 rules applied. Total rules applied 232 place count 495 transition count 897
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 233 place count 494 transition count 897
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 238 place count 489 transition count 874
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 244 place count 488 transition count 874
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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 249 place count 487 transition count 870
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 251 place count 485 transition count 870
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 484 transition count 862
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 484 transition count 862
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 483 transition count 854
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 483 transition count 854
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 482 transition count 846
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 482 transition count 846
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 481 transition count 838
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 481 transition count 838
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 480 transition count 830
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 480 transition count 830
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 479 transition count 822
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 479 transition count 822
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 478 transition count 814
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 478 transition count 814
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 477 transition count 806
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 477 transition count 806
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 476 transition count 798
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 476 transition count 798
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 475 transition count 790
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 475 transition count 790
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 474 transition count 782
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 474 transition count 782
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 473 transition count 774
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 473 transition count 774
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 276 place count 472 transition count 766
Iterating global reduction 6 with 1 rules applied. Total rules applied 277 place count 472 transition count 766
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 278 place count 471 transition count 758
Iterating global reduction 6 with 1 rules applied. Total rules applied 279 place count 471 transition count 758
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 280 place count 470 transition count 750
Iterating global reduction 6 with 1 rules applied. Total rules applied 281 place count 470 transition count 750
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 282 place count 469 transition count 742
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 469 transition count 742
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 311 place count 455 transition count 728
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 312 place count 455 transition count 727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 313 place count 454 transition count 727
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 316 place count 454 transition count 727
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 317 place count 453 transition count 726
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 321 place count 449 transition count 726
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 321 place count 449 transition count 718
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 338 place count 440 transition count 718
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 341 place count 437 transition count 718
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 341 place count 437 transition count 717
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 343 place count 436 transition count 717
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 349 place count 433 transition count 714
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 351 place count 431 transition count 712
Iterating global reduction 9 with 2 rules applied. Total rules applied 353 place count 431 transition count 712
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 355 place count 431 transition count 710
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 357 place count 429 transition count 710
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 359 place count 429 transition count 710
Applied a total of 359 rules in 683 ms. Remains 429 /626 variables (removed 197) and now considering 710/998 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 693 ms. Remains : 429/626 places, 710/998 transitions.
// Phase 1: matrix 710 rows 429 cols
[2026-05-25 05:05:19] [INFO ] Computed 77 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 1] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-02a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (16012 resets) in 1863 ms. (536 steps per ms)
BEST_FIRST walk for 1000001 steps (5561 resets) in 830 ms. (1203 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:05:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:22] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Real]Absence check using 18 positive and 59 generalized place invariants in 11 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2026-05-25 05:05:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Nat]Absence check using 18 positive and 59 generalized place invariants in 96 ms returned sat
[2026-05-25 05:05:22] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2026-05-25 05:05:22] [INFO ] Computed and/alt/rep : 266/1059/266 causal constraints (skipped 427 transitions) in 60 ms.
[2026-05-25 05:05:23] [INFO ] Added : 32 causal constraints over 7 iterations in 753 ms. Result :sat
Minimization took 521 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 429 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p109) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 429/429 places, 709/709 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 428 transition count 707
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 426 transition count 706
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 425 transition count 705
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 424 transition count 704
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 423 transition count 703
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 422 transition count 702
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 1815 edges and 421 vertex of which 420 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 2 rules applied. Total rules applied 10 place count 420 transition count 701
Applied a total of 10 rules in 37 ms. Remains 420 /429 variables (removed 9) and now considering 701/709 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 420/429 places, 701/709 transitions.
// Phase 1: matrix 701 rows 420 cols
[2026-05-25 05:05:24] [INFO ] Computed 76 invariants in 31 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16272 resets) in 1881 ms. (531 steps per ms)
BEST_FIRST walk for 1000001 steps (5614 resets) in 949 ms. (1052 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:05:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:27] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Real]Absence check using 20 positive and 56 generalized place invariants in 15 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-05-25 05:05:27] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using 20 positive and 56 generalized place invariants in 30 ms returned sat
[2026-05-25 05:05:27] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2026-05-25 05:05:28] [INFO ] Computed and/alt/rep : 257/1000/257 causal constraints (skipped 427 transitions) in 60 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:30] [INFO ] Deduced a trap composed of 72 places in 273 ms of which 34 ms to minimize.
[2026-05-25 05:05:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
[2026-05-25 05:05:30] [INFO ] Added : 163 causal constraints over 33 iterations in 2695 ms. Result :sat
Minimization took 433 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 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 701/701 transitions.
Applied a total of 0 rules in 28 ms. Remains 420 /420 variables (removed 0) and now considering 701/701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 420/420 places, 701/701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 701/701 transitions.
Applied a total of 0 rules in 17 ms. Remains 420 /420 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2026-05-25 05:05:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:32] [INFO ] Implicit Places using invariants in 560 ms returned [0, 18, 19, 30, 48, 66, 127, 131, 140, 141, 142, 160, 178, 247, 251, 252, 255, 266, 267, 268, 286, 288, 291, 309, 310, 311, 312, 324, 330, 336, 342, 348, 354, 360, 366, 372, 378, 384]
[2026-05-25 05:05:32] [INFO ] Actually due to overlaps returned [286, 268, 48, 142, 160, 291, 267, 310, 30, 141, 266, 288, 309, 0, 140, 251, 252, 18, 19, 66, 178, 312, 354, 372, 384, 255, 311, 324, 330, 336, 342, 348, 360, 366, 378]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 577 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 385/420 places, 701/701 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 383 transition count 643
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 325 transition count 643
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 118 place count 325 transition count 629
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 147 place count 310 transition count 629
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 2 with 12 rules applied. Total rules applied 159 place count 306 transition count 621
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 167 place count 298 transition count 621
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 182 place count 283 transition count 606
Iterating global reduction 4 with 15 rules applied. Total rules applied 197 place count 283 transition count 606
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 200 place count 283 transition count 603
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 200 place count 283 transition count 602
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 202 place count 282 transition count 602
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 205 place count 279 transition count 599
Iterating global reduction 5 with 3 rules applied. Total rules applied 208 place count 279 transition count 599
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 209 place count 278 transition count 598
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 278 transition count 598
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 211 place count 277 transition count 597
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 277 transition count 597
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 262 place count 252 transition count 572
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 264 place count 252 transition count 570
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 266 place count 250 transition count 568
Iterating global reduction 6 with 2 rules applied. Total rules applied 268 place count 250 transition count 568
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 270 place count 250 transition count 566
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 274 place count 250 transition count 562
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 279 place count 245 transition count 562
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 286 place count 245 transition count 562
Applied a total of 286 rules in 80 ms. Remains 245 /385 variables (removed 140) and now considering 562/701 (removed 139) transitions.
// Phase 1: matrix 562 rows 245 cols
[2026-05-25 05:05:32] [INFO ] Computed 33 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:32] [INFO ] Implicit Places using invariants in 217 ms returned [72, 86, 92, 95, 97, 98, 101, 102, 154, 171, 177, 180, 182]
[2026-05-25 05:05:32] [INFO ] Actually due to overlaps returned [101, 102, 86, 92, 97, 98, 171, 177, 182, 72, 154]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 220 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 234/420 places, 562/701 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 226 transition count 554
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 226 transition count 554
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 224 transition count 552
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 224 transition count 552
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 28 place count 220 transition count 548
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 220 transition count 542
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 40 place count 214 transition count 542
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 214 transition count 540
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 44 place count 212 transition count 540
Applied a total of 44 rules in 47 ms. Remains 212 /234 variables (removed 22) and now considering 540/562 (removed 22) transitions.
// Phase 1: matrix 540 rows 212 cols
[2026-05-25 05:05:32] [INFO ] Computed 22 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2026-05-25 05:05:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:33] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 212/420 places, 540/701 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1543 ms. Remains : 212/420 places, 540/701 transitions.
[2026-05-25 05:05:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (23846 resets) in 1449 ms. (689 steps per ms)
BEST_FIRST walk for 1000001 steps (10057 resets) in 756 ms. (1321 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-25 05:05:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:35] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2026-05-25 05:05:35] [INFO ] [Real]Absence check using 9 positive and 13 generalized place invariants in 8 ms returned sat
[2026-05-25 05:05:35] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2026-05-25 05:05:35] [INFO ] Computed and/alt/rep : 87/495/87 causal constraints (skipped 439 transitions) in 43 ms.
[2026-05-25 05:05:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-25 05:05:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 05:05:35] [INFO ] [Nat]Absence check using 9 positive and 13 generalized place invariants in 7 ms returned sat
[2026-05-25 05:05:36] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-25 05:05:36] [INFO ] Computed and/alt/rep : 87/495/87 causal constraints (skipped 439 transitions) in 38 ms.
[2026-05-25 05:05:36] [INFO ] Added : 25 causal constraints over 5 iterations in 285 ms. Result :sat
Minimization took 229 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 212 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 540/540 transitions.
Applied a total of 0 rules in 8 ms. Remains 212 /212 variables (removed 0) and now considering 540/540 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 212/212 places, 540/540 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 212/212 places, 540/540 transitions.
Applied a total of 0 rules in 9 ms. Remains 212 /212 variables (removed 0) and now considering 540/540 (removed 0) transitions.
[2026-05-25 05:05:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:37] [INFO ] Implicit Places using invariants in 465 ms returned []
[2026-05-25 05:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-25 05:05:37] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-25 05:05:37] [INFO ] Redundant transitions in 33 ms returned []
Running 526 sub problems to find dead transitions.
[2026-05-25 05:05:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 3 (OVERLAPS) 2/212 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 526 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:56] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-25 05:05:57] [INFO ] Deduced a trap composed of 68 places in 175 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 526 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 526 unsolved
SMT process timed out in 30284ms, After SMT, problems are : Problem set: 0 solved, 526 unsolved
Search for dead transitions found 0 dead transitions in 30303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31420 ms. Remains : 212/212 places, 540/540 transitions.
RANDOM walk for 40000 steps (972 resets) in 862 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (403 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (400 resets) in 189 ms. (210 steps per ms) remains 2/2 properties
[2026-05-25 05:06:08] [INFO ] Flatten gal took : 108 ms
Finished probabilistic random walk after 16127 steps, run visited all 2 properties in 190 ms. (steps per millisecond=84 )
Probabilistic random walk after 16127 steps, saw 10672 distinct states, run finished after 194 ms. (steps per millisecond=83 ) properties seen :2
[2026-05-25 05:06:08] [INFO ] Flatten gal took : 37 ms
[2026-05-25 05:06:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3689559065914290756.gal : 17 ms
[2026-05-25 05:06:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17732764615758713228.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3689559065914290756.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17732764615758713228.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-02a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 68881 ms.

BK_STOP 1779685568825

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ASLink-PT-02a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is ASLink-PT-02a, 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 r015-oct2-177944372400038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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