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-174853743000044.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-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 932K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 516K 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-05a-UpperBounds-00
FORMULA_NAME ASLink-PT-05a-UpperBounds-01
FORMULA_NAME ASLink-PT-05a-UpperBounds-02
FORMULA_NAME ASLink-PT-05a-UpperBounds-03
FORMULA_NAME ASLink-PT-05a-UpperBounds-04
FORMULA_NAME ASLink-PT-05a-UpperBounds-05
FORMULA_NAME ASLink-PT-05a-UpperBounds-06
FORMULA_NAME ASLink-PT-05a-UpperBounds-07
FORMULA_NAME ASLink-PT-05a-UpperBounds-08
FORMULA_NAME ASLink-PT-05a-UpperBounds-09
FORMULA_NAME ASLink-PT-05a-UpperBounds-10
FORMULA_NAME ASLink-PT-05a-UpperBounds-11
FORMULA_NAME ASLink-PT-05a-UpperBounds-12
FORMULA_NAME ASLink-PT-05a-UpperBounds-13
FORMULA_NAME ASLink-PT-05a-UpperBounds-14
FORMULA_NAME ASLink-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540256166

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-05a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:37:37] [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:37:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:37:37] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2025-05-29 17:37:37] [INFO ] Transformed 1211 places.
[2025-05-29 17:37:37] [INFO ] Transformed 1827 transitions.
[2025-05-29 17:37:37] [INFO ] Found NUPN structural information;
[2025-05-29 17:37:37] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 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 1808 rows 1211 cols
[2025-05-29 17:37:37] [INFO ] Computed 232 invariants in 134 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 (60 resets) in 70 ms. (140 steps per ms)
FORMULA ASLink-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (54 resets) in 120 ms. (495 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:37:38] [INFO ] Invariant cache hit.
[2025-05-29 17:37:38] [INFO ] [Real]Absence check using 56 positive place invariants in 45 ms returned sat
[2025-05-29 17:37:38] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 43 ms returned sat
[2025-05-29 17:37:39] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2025-05-29 17:37:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:39] [INFO ] [Nat]Absence check using 56 positive place invariants in 79 ms returned sat
[2025-05-29 17:37:39] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 46 ms returned sat
[2025-05-29 17:37:40] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2025-05-29 17:37:40] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 131 ms.
[2025-05-29 17:37:44] [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: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:37:44] [INFO ] [Real]Absence check using 56 positive place invariants in 24 ms returned sat
[2025-05-29 17:37:44] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 49 ms returned sat
[2025-05-29 17:37:45] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2025-05-29 17:37:45] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 118 ms.
[2025-05-29 17:37:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:46] [INFO ] [Nat]Absence check using 56 positive place invariants in 28 ms returned sat
[2025-05-29 17:37:46] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 48 ms returned sat
[2025-05-29 17:37:46] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2025-05-29 17:37:47] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 105 ms.
[2025-05-29 17:37:51] [INFO ] Added : 215 causal constraints over 43 iterations in 3993 ms. Result :unknown
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 56 positive place invariants in 24 ms returned sat
[2025-05-29 17:37:51] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 45 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Real]Absence check using state equation in 774 ms returned sat
[2025-05-29 17:37:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 56 positive place invariants in 33 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 41 ms returned sat
[2025-05-29 17:37:52] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2025-05-29 17:37:53] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 25 ms to minimize.
[2025-05-29 17:37:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2025-05-29 17:37:53] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 109 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 17:37:57] [INFO ] [Real]Absence check using 56 positive place invariants in 26 ms returned sat
[2025-05-29 17:37:57] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 50 ms returned sat
[2025-05-29 17:37:58] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2025-05-29 17:37:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:37:58] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2025-05-29 17:37:58] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 40 ms returned sat
[2025-05-29 17:37:58] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2025-05-29 17:37:59] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 91 ms.
[2025-05-29 17:37:59] [INFO ] Added : 5 causal constraints over 1 iterations in 710 ms. Result :sat
Minimization took 724 ms.
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using 56 positive place invariants in 27 ms returned sat
[2025-05-29 17:38:00] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 39 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2025-05-29 17:38:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 56 positive place invariants in 27 ms returned sat
[2025-05-29 17:38:01] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 40 ms returned sat
[2025-05-29 17:38:02] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2025-05-29 17:38:02] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 89 ms.
[2025-05-29 17:38:03] [INFO ] Added : 25 causal constraints over 5 iterations in 1548 ms. Result :unknown
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using 56 positive place invariants in 27 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 40 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2025-05-29 17:38:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2025-05-29 17:38:04] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 38 ms returned sat
[2025-05-29 17:38:05] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2025-05-29 17:38:05] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1181 transition count 1703
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 241 place count 1076 transition count 1702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 1075 transition count 1702
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 242 place count 1075 transition count 1594
Deduced a syphon composed of 108 places in 8 ms
Ensure Unique test removed 41 places
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 257 rules applied. Total rules applied 499 place count 926 transition count 1594
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 500 place count 926 transition count 1593
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 501 place count 925 transition count 1593
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 509 place count 917 transition count 1552
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 518 place count 916 transition count 1552
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 524 place count 915 transition count 1547
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 527 place count 912 transition count 1547
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 528 place count 911 transition count 1539
Iterating global reduction 7 with 1 rules applied. Total rules applied 529 place count 911 transition count 1539
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 530 place count 910 transition count 1531
Iterating global reduction 7 with 1 rules applied. Total rules applied 531 place count 910 transition count 1531
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 532 place count 909 transition count 1523
Iterating global reduction 7 with 1 rules applied. Total rules applied 533 place count 909 transition count 1523
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 534 place count 908 transition count 1515
Iterating global reduction 7 with 1 rules applied. Total rules applied 535 place count 908 transition count 1515
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 536 place count 907 transition count 1507
Iterating global reduction 7 with 1 rules applied. Total rules applied 537 place count 907 transition count 1507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 538 place count 906 transition count 1499
Iterating global reduction 7 with 1 rules applied. Total rules applied 539 place count 906 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 540 place count 905 transition count 1491
Iterating global reduction 7 with 1 rules applied. Total rules applied 541 place count 905 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 542 place count 904 transition count 1483
Iterating global reduction 7 with 1 rules applied. Total rules applied 543 place count 904 transition count 1483
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 544 place count 903 transition count 1475
Iterating global reduction 7 with 1 rules applied. Total rules applied 545 place count 903 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 546 place count 902 transition count 1467
Iterating global reduction 7 with 1 rules applied. Total rules applied 547 place count 902 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 548 place count 901 transition count 1459
Iterating global reduction 7 with 1 rules applied. Total rules applied 549 place count 901 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 550 place count 900 transition count 1451
Iterating global reduction 7 with 1 rules applied. Total rules applied 551 place count 900 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 552 place count 899 transition count 1443
Iterating global reduction 7 with 1 rules applied. Total rules applied 553 place count 899 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 554 place count 898 transition count 1435
Iterating global reduction 7 with 1 rules applied. Total rules applied 555 place count 898 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 556 place count 897 transition count 1427
Iterating global reduction 7 with 1 rules applied. Total rules applied 557 place count 897 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 558 place count 896 transition count 1419
Iterating global reduction 7 with 1 rules applied. Total rules applied 559 place count 896 transition count 1419
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 629 place count 861 transition count 1384
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 634 place count 861 transition count 1379
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 639 place count 856 transition count 1379
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 644 place count 856 transition count 1379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 645 place count 855 transition count 1378
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 655 place count 845 transition count 1378
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 19 Pre rules applied. Total rules applied 655 place count 845 transition count 1359
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 39 rules applied. Total rules applied 694 place count 825 transition count 1359
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 9 with 6 rules applied. Total rules applied 700 place count 819 transition count 1359
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 700 place count 819 transition count 1358
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 702 place count 818 transition count 1358
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 714 place count 812 transition count 1352
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 719 place count 807 transition count 1347
Iterating global reduction 10 with 5 rules applied. Total rules applied 724 place count 807 transition count 1347
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 729 place count 807 transition count 1342
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 734 place count 802 transition count 1342
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 739 place count 802 transition count 1342
Applied a total of 739 rules in 1164 ms. Remains 802 /1211 variables (removed 409) and now considering 1342/1808 (removed 466) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1173 ms. Remains : 802/1211 places, 1342/1808 transitions.
// Phase 1: matrix 1342 rows 802 cols
[2025-05-29 17:38:12] [INFO ] Computed 142 invariants in 63 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (12028 resets) in 2375 ms. (420 steps per ms)
FORMULA ASLink-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-05a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000002 steps (9262 resets) in 4297 ms. (930 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:38:19] [INFO ] Invariant cache hit.
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:19] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 29 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2025-05-29 17:38:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 23 ms returned sat
[2025-05-29 17:38:20] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2025-05-29 17:38:20] [INFO ] Computed and/alt/rep : 526/2009/526 causal constraints (skipped 787 transitions) in 74 ms.
[2025-05-29 17:38:25] [INFO ] Added : 350 causal constraints over 70 iterations in 5300 ms. Result :sat
Minimization took 1116 ms.
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2025-05-29 17:38:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 23 ms returned sat
[2025-05-29 17:38:27] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2025-05-29 17:38:28] [INFO ] Computed and/alt/rep : 526/2009/526 causal constraints (skipped 787 transitions) in 76 ms.
[2025-05-29 17:38:29] [INFO ] Added : 105 causal constraints over 22 iterations in 1775 ms. Result :sat
Minimization took 1198 ms.
[2025-05-29 17:38:31] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:31] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 28 ms returned sat
[2025-05-29 17:38:31] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2025-05-29 17:38:31] [INFO ] Computed and/alt/rep : 526/2009/526 causal constraints (skipped 787 transitions) in 69 ms.
[2025-05-29 17:38:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-29 17:38:31] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:38:32] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2025-05-29 17:38:32] [INFO ] Computed and/alt/rep : 526/2009/526 causal constraints (skipped 787 transitions) in 67 ms.
[2025-05-29 17:38:37] [INFO ] Added : 370 causal constraints over 74 iterations in 5120 ms. Result :sat
Minimization took 1231 ms.
[2025-05-29 17:38:38] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:38] [INFO ] [Real]Absence check using 36 positive and 106 generalized place invariants in 21 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2025-05-29 17:38:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Nat]Absence check using 36 positive and 106 generalized place invariants in 22 ms returned sat
[2025-05-29 17:38:39] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2025-05-29 17:38:39] [INFO ] Computed and/alt/rep : 526/2009/526 causal constraints (skipped 787 transitions) in 70 ms.
[2025-05-29 17:38:44] [INFO ] Added : 316 causal constraints over 64 iterations in 4514 ms. Result :sat
Minimization took 1084 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 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 1342/1342 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 802 transition count 1341
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 801 transition count 1341
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 800 transition count 1341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 799 transition count 1340
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 798 transition count 1339
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 798 transition count 1339
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 798 transition count 1338
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 797 transition count 1337
Applied a total of 10 rules in 106 ms. Remains 797 /802 variables (removed 5) and now considering 1337/1342 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 797/802 places, 1337/1342 transitions.
// Phase 1: matrix 1337 rows 797 cols
[2025-05-29 17:38:47] [INFO ] Computed 141 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (11924 resets) in 2245 ms. (445 steps per ms)
BEST_FIRST walk for 4000004 steps (9220 resets) in 4274 ms. (935 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:38:53] [INFO ] Invariant cache hit.
[2025-05-29 17:38:53] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:38:53] [INFO ] [Real]Absence check using 36 positive and 105 generalized place invariants in 20 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2025-05-29 17:38:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:38:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Nat]Absence check using 36 positive and 105 generalized place invariants in 20 ms returned sat
[2025-05-29 17:38:54] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2025-05-29 17:38:54] [INFO ] Computed and/alt/rep : 528/2056/528 causal constraints (skipped 780 transitions) in 61 ms.
[2025-05-29 17:38:59] [INFO ] Added : 349 causal constraints over 70 iterations in 4960 ms. Result :sat
Minimization took 979 ms.
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:00] [INFO ] [Real]Absence check using 36 positive and 105 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:01] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-05-29 17:39:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 12 ms returned sat
[2025-05-29 17:39:01] [INFO ] [Nat]Absence check using 36 positive and 105 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:01] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-05-29 17:39:02] [INFO ] Deduced a trap composed of 90 places in 202 ms of which 4 ms to minimize.
[2025-05-29 17:39:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2025-05-29 17:39:02] [INFO ] Computed and/alt/rep : 528/2056/528 causal constraints (skipped 780 transitions) in 70 ms.
[2025-05-29 17:39:07] [INFO ] Added : 394 causal constraints over 79 iterations in 5708 ms. Result :sat
Minimization took 975 ms.
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:08] [INFO ] [Real]Absence check using 36 positive and 105 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2025-05-29 17:39:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using 36 positive and 105 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:09] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2025-05-29 17:39:09] [INFO ] Computed and/alt/rep : 528/2056/528 causal constraints (skipped 780 transitions) in 62 ms.
[2025-05-29 17:39:15] [INFO ] Added : 380 causal constraints over 76 iterations in 5521 ms. Result :sat
Minimization took 1080 ms.
[2025-05-29 17:39:16] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:16] [INFO ] [Real]Absence check using 36 positive and 105 generalized place invariants in 21 ms returned sat
[2025-05-29 17:39:16] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2025-05-29 17:39:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2025-05-29 17:39:17] [INFO ] [Nat]Absence check using 36 positive and 105 generalized place invariants in 19 ms returned sat
[2025-05-29 17:39:17] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2025-05-29 17:39:17] [INFO ] Computed and/alt/rep : 528/2056/528 causal constraints (skipped 780 transitions) in 62 ms.
[2025-05-29 17:39:23] [INFO ] Added : 372 causal constraints over 75 iterations in 5530 ms. Result :sat
Minimization took 1001 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 797 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1337/1337 transitions.
Applied a total of 0 rules in 22 ms. Remains 797 /797 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 797/797 places, 1337/1337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 797/797 places, 1337/1337 transitions.
Applied a total of 0 rules in 21 ms. Remains 797 /797 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
[2025-05-29 17:39:25] [INFO ] Invariant cache hit.
[2025-05-29 17:39:25] [INFO ] Implicit Places using invariants in 498 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 223, 257, 261, 262, 273, 274, 275, 293, 311, 346, 382, 386, 387, 398, 399, 400, 418, 436, 455, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 632, 643, 644, 645, 663, 665, 668, 686, 687, 688, 689, 701, 707, 713, 719, 725, 731, 737, 743, 749, 755, 761]
[2025-05-29 17:39:25] [INFO ] Actually due to overlaps returned [663, 645, 30, 48, 150, 168, 275, 293, 418, 519, 537, 668, 400, 149, 274, 399, 518, 644, 687, 148, 273, 398, 517, 643, 665, 686, 0, 261, 262, 386, 387, 505, 506, 628, 629, 18, 19, 66, 186, 311, 555, 689, 731, 749, 761, 436, 455, 632, 688, 701, 707, 713, 719, 725, 737, 743, 755]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 502 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 740/797 places, 1337/1337 transitions.
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 734 transition count 1236
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 209 place count 633 transition count 1235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 632 transition count 1235
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 210 place count 632 transition count 1209
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 263 place count 605 transition count 1209
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 275 place count 601 transition count 1201
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 283 place count 593 transition count 1201
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 298 place count 578 transition count 1186
Iterating global reduction 5 with 15 rules applied. Total rules applied 313 place count 578 transition count 1186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 316 place count 578 transition count 1183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 316 place count 578 transition count 1182
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 318 place count 577 transition count 1182
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 321 place count 574 transition count 1179
Iterating global reduction 6 with 3 rules applied. Total rules applied 324 place count 574 transition count 1179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 325 place count 573 transition count 1178
Iterating global reduction 6 with 1 rules applied. Total rules applied 326 place count 573 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 327 place count 572 transition count 1177
Iterating global reduction 6 with 1 rules applied. Total rules applied 328 place count 572 transition count 1177
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 422 place count 525 transition count 1130
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 427 place count 525 transition count 1125
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 431 place count 521 transition count 1121
Iterating global reduction 7 with 4 rules applied. Total rules applied 435 place count 521 transition count 1121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 439 place count 521 transition count 1117
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 450 place count 521 transition count 1106
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 462 place count 509 transition count 1106
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 478 place count 509 transition count 1106
Applied a total of 478 rules in 200 ms. Remains 509 /740 variables (removed 231) and now considering 1106/1337 (removed 231) transitions.
// Phase 1: matrix 1106 rows 509 cols
[2025-05-29 17:39:26] [INFO ] Computed 72 invariants in 16 ms
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants in 308 ms returned [72, 90, 96, 99, 101, 102, 105, 106, 158, 178, 184, 187, 189, 194, 195, 247, 266, 272, 275, 277, 282, 283, 349, 355, 358, 360, 365, 366, 418, 435, 441, 444, 446]
[2025-05-29 17:39:26] [INFO ] Actually due to overlaps returned [105, 194, 282, 365, 106, 195, 283, 366, 90, 96, 101, 102, 178, 184, 189, 266, 272, 277, 349, 355, 360, 435, 441, 446, 72, 158, 247, 418]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 311 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 481/797 places, 1106/1337 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 461 transition count 1086
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 461 transition count 1086
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 456 transition count 1081
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 456 transition count 1081
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 68 place count 447 transition count 1072
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 83 place count 447 transition count 1057
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 98 place count 432 transition count 1057
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 102 place count 432 transition count 1053
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 428 transition count 1053
Applied a total of 106 rules in 109 ms. Remains 428 /481 variables (removed 53) and now considering 1053/1106 (removed 53) transitions.
// Phase 1: matrix 1053 rows 428 cols
[2025-05-29 17:39:26] [INFO ] Computed 44 invariants in 11 ms
[2025-05-29 17:39:26] [INFO ] Implicit Places using invariants in 250 ms returned []
[2025-05-29 17:39:26] [INFO ] Invariant cache hit.
[2025-05-29 17:39:27] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 428/797 places, 1053/1337 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2081 ms. Remains : 428/797 places, 1053/1337 transitions.
[2025-05-29 17:39:27] [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 (18401 resets) in 1713 ms. (583 steps per ms)
BEST_FIRST walk for 4000004 steps (19015 resets) in 2859 ms. (1398 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:39:32] [INFO ] Invariant cache hit.
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2025-05-29 17:39:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:39:32] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2025-05-29 17:39:32] [INFO ] Computed and/alt/rep : 225/1020/225 causal constraints (skipped 802 transitions) in 49 ms.
[2025-05-29 17:39:33] [INFO ] Added : 42 causal constraints over 9 iterations in 591 ms. Result :sat
Minimization took 351 ms.
[2025-05-29 17:39:33] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:33] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 13 ms returned sat
[2025-05-29 17:39:33] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2025-05-29 17:39:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:34] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:39:34] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2025-05-29 17:39:34] [INFO ] Computed and/alt/rep : 225/1020/225 causal constraints (skipped 802 transitions) in 51 ms.
[2025-05-29 17:39:34] [INFO ] Added : 18 causal constraints over 4 iterations in 314 ms. Result :sat
Minimization took 329 ms.
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 8 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2025-05-29 17:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 9 ms returned sat
[2025-05-29 17:39:35] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2025-05-29 17:39:35] [INFO ] Computed and/alt/rep : 225/1020/225 causal constraints (skipped 802 transitions) in 49 ms.
[2025-05-29 17:39:36] [INFO ] Added : 30 causal constraints over 10 iterations in 569 ms. Result :sat
Minimization took 340 ms.
[2025-05-29 17:39:36] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2025-05-29 17:39:36] [INFO ] [Real]Absence check using 10 positive and 34 generalized place invariants in 14 ms returned sat
[2025-05-29 17:39:36] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-29 17:39:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:39:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2025-05-29 17:39:36] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 14 ms returned sat
[2025-05-29 17:39:37] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-29 17:39:37] [INFO ] Computed and/alt/rep : 225/1020/225 causal constraints (skipped 802 transitions) in 49 ms.
[2025-05-29 17:39:37] [INFO ] Added : 33 causal constraints over 7 iterations in 442 ms. Result :sat
Minimization took 374 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 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1053/1053 transitions.
Applied a total of 0 rules in 22 ms. Remains 428 /428 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 428/428 places, 1053/1053 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1053/1053 transitions.
Applied a total of 0 rules in 11 ms. Remains 428 /428 variables (removed 0) and now considering 1053/1053 (removed 0) transitions.
[2025-05-29 17:39:38] [INFO ] Invariant cache hit.
[2025-05-29 17:39:38] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-29 17:39:38] [INFO ] Invariant cache hit.
[2025-05-29 17:39:39] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2025-05-29 17:39:39] [INFO ] Redundant transitions in 55 ms returned []
Running 1027 sub problems to find dead transitions.
[2025-05-29 17:39:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2025-05-29 17:40:05] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 3 ms to minimize.
[2025-05-29 17:40:05] [INFO ] Deduced a trap composed of 86 places in 187 ms of which 6 ms to minimize.
[2025-05-29 17:40:05] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.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 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 428/1481 variables, and 47 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 1027/1027 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1027 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/427 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/427 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 3 (OVERLAPS) 1/428 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
[2025-05-29 17:40:32] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 1027 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/1481 variables, and 48 constraints, problems are : Problem set: 0 solved, 1027 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/428 constraints, PredecessorRefiner: 0/1027 constraints, Known Traps: 4/4 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 1027 unsolved
Search for dead transitions found 0 dead transitions in 60769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61756 ms. Remains : 428/428 places, 1053/1053 transitions.
RANDOM walk for 40000 steps (739 resets) in 1695 ms. (23 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (191 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (196 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (197 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (182 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
[2025-05-29 17:40:41] [INFO ] Flatten gal took : 274 ms
BEST_FIRST walk for 40000 steps (188 resets) in 180 ms. (220 steps per ms) remains 8/8 properties
[2025-05-29 17:40:41] [INFO ] Flatten gal took : 134 ms
[2025-05-29 17:40:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1799733228631739893.gal : 47 ms
BEST_FIRST walk for 40003 steps (192 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
[2025-05-29 17:40:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10389485020669721022.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1799733228631739893.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10389485020669721022.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (189 resets) in 116 ms. (341 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (190 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality10389485020669721022.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 14688
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :14688 after 146600
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :146600 after 153688
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :153688 after 154429
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :154429 after 3.13214e+06
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.13214e+06 after 2.36884e+07
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 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 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.32965e+08,1.21059,42184,2,25355,20,85193,6,0,2768,71789,0
Total reachable state count : 332965128

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,6,1.21612,42184,2,539,20,85193,7,0,2771,71789,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,6,1.22059,42184,2,539,20,85193,8,0,2772,71789,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,44,1.22389,42184,2,760,20,85193,9,0,2774,71789,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,44,1.22718,42184,2,760,20,85193,10,0,2775,71789,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1,1.23221,42184,2,429,20,85193,11,0,2777,71789,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1,1.23466,42184,2,429,20,85193,12,0,2778,71789,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,6,1.23962,42184,2,539,20,85193,13,0,2780,71789,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,6,1.24465,42184,2,539,20,85193,14,0,2781,71789,0
Interrupted probabilistic random walk after 209597 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 8
Probabilistic random walk after 209597 steps, saw 135145 distinct states, run finished after 3005 ms. (steps per millisecond=69 ) properties seen :0
FORMULA ASLink-PT-05a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05a-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-05a-UpperBounds-03 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 187028 ms.

BK_STOP 1748540444469

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-05a"
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-05a, 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-174853743000044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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