Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 436K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716252925004

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 00:55:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 00:55:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 00:55:27] [INFO ] Load time of PNML (sax parser for PT used): 316 ms
[2024-05-21 00:55:27] [INFO ] Transformed 1016 places.
[2024-05-21 00:55:27] [INFO ] Transformed 1554 transitions.
[2024-05-21 00:55:27] [INFO ] Found NUPN structural information;
[2024-05-21 00:55:27] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 562 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 148 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 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 1538 rows 1016 cols
[2024-05-21 00:55:28] [INFO ] Computed 194 invariants in 172 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 (69 resets) in 177 ms. (56 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60004 steps (77 resets) in 367 ms. (163 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-21 00:55:28] [INFO ] Invariant cache hit.
[2024-05-21 00:55:29] [INFO ] [Real]Absence check using 46 positive place invariants in 56 ms returned sat
[2024-05-21 00:55:29] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 80 ms returned sat
[2024-05-21 00:55:30] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2024-05-21 00:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:31] [INFO ] [Nat]Absence check using 46 positive place invariants in 35 ms returned sat
[2024-05-21 00:55:31] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 62 ms returned sat
[2024-05-21 00:55:31] [INFO ] [Nat]Absence check using state equation in 797 ms returned sat
[2024-05-21 00:55:32] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 200 ms.
[2024-05-21 00:55:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2024-05-21 00:55:36] [INFO ] [Real]Absence check using 46 positive place invariants in 32 ms returned sat
[2024-05-21 00:55:36] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 62 ms returned sat
[2024-05-21 00:55:37] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2024-05-21 00:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 51 ms returned sat
[2024-05-21 00:55:37] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 91 ms returned sat
[2024-05-21 00:55:38] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2024-05-21 00:55:39] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 144 ms.
[2024-05-21 00:55:42] [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 1
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)
[2024-05-21 00:55:42] [INFO ] [Real]Absence check using 46 positive place invariants in 53 ms returned sat
[2024-05-21 00:55:42] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 105 ms returned sat
[2024-05-21 00:55:44] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2024-05-21 00:55:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:44] [INFO ] [Nat]Absence check using 46 positive place invariants in 49 ms returned sat
[2024-05-21 00:55:44] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 85 ms returned sat
[2024-05-21 00:55:45] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2024-05-21 00:55:45] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 131 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 00:55:49] [INFO ] [Real]Absence check using 46 positive place invariants in 50 ms returned sat
[2024-05-21 00:55:49] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 51 ms returned sat
[2024-05-21 00:55:50] [INFO ] [Real]Absence check using state equation in 1189 ms returned sat
[2024-05-21 00:55:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:51] [INFO ] [Nat]Absence check using 46 positive place invariants in 38 ms returned sat
[2024-05-21 00:55:51] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 76 ms returned sat
[2024-05-21 00:55:52] [INFO ] [Nat]Absence check using state equation in 1099 ms returned sat
[2024-05-21 00:55:52] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 112 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-21 00:55:56] [INFO ] [Real]Absence check using 46 positive place invariants in 51 ms returned sat
[2024-05-21 00:55:56] [INFO ] [Real]Absence check using 46 positive and 148 generalized place invariants in 91 ms returned sat
[2024-05-21 00:55:57] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2024-05-21 00:55:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:55:57] [INFO ] [Nat]Absence check using 46 positive place invariants in 33 ms returned sat
[2024-05-21 00:55:57] [INFO ] [Nat]Absence check using 46 positive and 148 generalized place invariants in 63 ms returned sat
[2024-05-21 00:55:58] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2024-05-21 00:55:58] [INFO ] Computed and/alt/rep : 610/2218/610 causal constraints (skipped 927 transitions) in 150 ms.
[2024-05-21 00:55:59] [INFO ] Added : 5 causal constraints over 1 iterations in 1025 ms. Result :sat
Minimization took 592 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1016 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 992 transition count 1451
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 198 place count 905 transition count 1451
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 88 Pre rules applied. Total rules applied 198 place count 905 transition count 1363
Deduced a syphon composed of 88 places in 2 ms
Ensure Unique test removed 34 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 210 rules applied. Total rules applied 408 place count 783 transition count 1363
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 409 place count 783 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 410 place count 782 transition count 1362
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 416 place count 776 transition count 1333
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 423 place count 775 transition count 1333
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 4 with 6 rules applied. Total rules applied 429 place count 774 transition count 1328
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 432 place count 771 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 433 place count 770 transition count 1320
Iterating global reduction 6 with 1 rules applied. Total rules applied 434 place count 770 transition count 1320
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 435 place count 769 transition count 1312
Iterating global reduction 6 with 1 rules applied. Total rules applied 436 place count 769 transition count 1312
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 437 place count 768 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 438 place count 768 transition count 1304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 439 place count 767 transition count 1296
Iterating global reduction 6 with 1 rules applied. Total rules applied 440 place count 767 transition count 1296
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 441 place count 766 transition count 1288
Iterating global reduction 6 with 1 rules applied. Total rules applied 442 place count 766 transition count 1288
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 443 place count 765 transition count 1280
Iterating global reduction 6 with 1 rules applied. Total rules applied 444 place count 765 transition count 1280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 445 place count 764 transition count 1272
Iterating global reduction 6 with 1 rules applied. Total rules applied 446 place count 764 transition count 1272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 447 place count 763 transition count 1264
Iterating global reduction 6 with 1 rules applied. Total rules applied 448 place count 763 transition count 1264
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 449 place count 762 transition count 1256
Iterating global reduction 6 with 1 rules applied. Total rules applied 450 place count 762 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 451 place count 761 transition count 1248
Iterating global reduction 6 with 1 rules applied. Total rules applied 452 place count 761 transition count 1248
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 453 place count 760 transition count 1240
Iterating global reduction 6 with 1 rules applied. Total rules applied 454 place count 760 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 455 place count 759 transition count 1232
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 759 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 457 place count 758 transition count 1224
Iterating global reduction 6 with 1 rules applied. Total rules applied 458 place count 758 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 459 place count 757 transition count 1216
Iterating global reduction 6 with 1 rules applied. Total rules applied 460 place count 757 transition count 1216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 461 place count 756 transition count 1208
Iterating global reduction 6 with 1 rules applied. Total rules applied 462 place count 756 transition count 1208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 463 place count 755 transition count 1200
Iterating global reduction 6 with 1 rules applied. Total rules applied 464 place count 755 transition count 1200
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 520 place count 727 transition count 1172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 523 place count 727 transition count 1169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 526 place count 724 transition count 1169
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 530 place count 724 transition count 1169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 531 place count 723 transition count 1168
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 538 place count 716 transition count 1168
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 538 place count 716 transition count 1153
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 31 rules applied. Total rules applied 569 place count 700 transition count 1153
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 8 with 4 rules applied. Total rules applied 573 place count 696 transition count 1153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 573 place count 696 transition count 1152
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 575 place count 695 transition count 1152
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 583 place count 691 transition count 1148
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 586 place count 688 transition count 1145
Iterating global reduction 9 with 3 rules applied. Total rules applied 589 place count 688 transition count 1145
Free-agglomeration rule applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 592 place count 688 transition count 1142
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 596 place count 685 transition count 1141
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 598 place count 685 transition count 1141
Applied a total of 598 rules in 1387 ms. Remains 685 /1016 variables (removed 331) and now considering 1141/1538 (removed 397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1406 ms. Remains : 685/1016 places, 1141/1538 transitions.
// Phase 1: matrix 1141 rows 685 cols
[2024-05-21 00:56:01] [INFO ] Computed 122 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (11908 resets) in 2914 ms. (343 steps per ms)
FORMULA ASLink-PT-04a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-04a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (8460 resets) in 3601 ms. (832 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 00:56:08] [INFO ] Invariant cache hit.
[2024-05-21 00:56:08] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-21 00:56:08] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 35 ms returned sat
[2024-05-21 00:56:09] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2024-05-21 00:56:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:09] [INFO ] [Nat]Absence check using 30 positive place invariants in 21 ms returned sat
[2024-05-21 00:56:09] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 42 ms returned sat
[2024-05-21 00:56:09] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2024-05-21 00:56:10] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 132 ms.
[2024-05-21 00:56:15] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 18 ms to minimize.
[2024-05-21 00:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2024-05-21 00:56:15] [INFO ] Added : 309 causal constraints over 63 iterations in 5807 ms. Result :sat
Minimization took 1293 ms.
[2024-05-21 00:56:17] [INFO ] [Real]Absence check using 30 positive place invariants in 16 ms returned sat
[2024-05-21 00:56:17] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 36 ms returned sat
[2024-05-21 00:56:17] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2024-05-21 00:56:17] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 96 ms.
[2024-05-21 00:56:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:18] [INFO ] [Nat]Absence check using 30 positive place invariants in 22 ms returned sat
[2024-05-21 00:56:18] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 54 ms returned sat
[2024-05-21 00:56:18] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2024-05-21 00:56:19] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 113 ms.
[2024-05-21 00:56:26] [INFO ] Deduced a trap composed of 111 places in 346 ms of which 7 ms to minimize.
[2024-05-21 00:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 528 ms
[2024-05-21 00:56:26] [INFO ] Added : 328 causal constraints over 66 iterations in 7707 ms. Result :sat
Minimization took 1351 ms.
[2024-05-21 00:56:28] [INFO ] [Real]Absence check using 30 positive place invariants in 24 ms returned sat
[2024-05-21 00:56:28] [INFO ] [Real]Absence check using 30 positive and 92 generalized place invariants in 48 ms returned sat
[2024-05-21 00:56:29] [INFO ] [Real]Absence check using state equation in 687 ms returned sat
[2024-05-21 00:56:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2024-05-21 00:56:29] [INFO ] [Nat]Absence check using 30 positive and 92 generalized place invariants in 35 ms returned sat
[2024-05-21 00:56:29] [INFO ] [Nat]Absence check using state equation in 498 ms returned sat
[2024-05-21 00:56:29] [INFO ] Computed and/alt/rep : 451/1730/451 causal constraints (skipped 663 transitions) in 88 ms.
[2024-05-21 00:56:34] [INFO ] Added : 304 causal constraints over 62 iterations in 4891 ms. Result :sat
Minimization took 1301 ms.
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, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 685 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 685/685 places, 1141/1141 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 685 transition count 1140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 683 transition count 1140
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 683 transition count 1139
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 682 transition count 1139
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 681 transition count 1139
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 3 with 2 rules applied. Total rules applied 8 place count 680 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 679 transition count 1137
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 679 transition count 1137
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 679 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 678 transition count 1136
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 13 place count 678 transition count 1136
Applied a total of 13 rules in 224 ms. Remains 678 /685 variables (removed 7) and now considering 1136/1141 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 678/685 places, 1136/1141 transitions.
// Phase 1: matrix 1136 rows 678 cols
[2024-05-21 00:56:37] [INFO ] Computed 120 invariants in 22 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (12976 resets) in 2557 ms. (390 steps per ms)
BEST_FIRST walk for 3000002 steps (9022 resets) in 4077 ms. (735 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 00:56:44] [INFO ] Invariant cache hit.
[2024-05-21 00:56:44] [INFO ] [Real]Absence check using 29 positive place invariants in 16 ms returned sat
[2024-05-21 00:56:44] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 36 ms returned sat
[2024-05-21 00:56:45] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2024-05-21 00:56:45] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 118 ms.
[2024-05-21 00:56:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:45] [INFO ] [Nat]Absence check using 29 positive place invariants in 24 ms returned sat
[2024-05-21 00:56:45] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 54 ms returned sat
[2024-05-21 00:56:46] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-21 00:56:46] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 131 ms.
[2024-05-21 00:56:55] [INFO ] Added : 356 causal constraints over 72 iterations in 9004 ms. Result :sat
Minimization took 1229 ms.
[2024-05-21 00:56:57] [INFO ] [Real]Absence check using 29 positive place invariants in 18 ms returned sat
[2024-05-21 00:56:57] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 41 ms returned sat
[2024-05-21 00:56:57] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2024-05-21 00:56:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:56:57] [INFO ] [Nat]Absence check using 29 positive place invariants in 23 ms returned sat
[2024-05-21 00:56:57] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 47 ms returned sat
[2024-05-21 00:56:58] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2024-05-21 00:56:58] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 3 ms to minimize.
[2024-05-21 00:56:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2024-05-21 00:56:58] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 109 ms.
[2024-05-21 00:57:05] [INFO ] Added : 328 causal constraints over 66 iterations in 6660 ms. Result :sat
Minimization took 1363 ms.
[2024-05-21 00:57:06] [INFO ] [Real]Absence check using 29 positive place invariants in 15 ms returned sat
[2024-05-21 00:57:07] [INFO ] [Real]Absence check using 29 positive and 91 generalized place invariants in 33 ms returned sat
[2024-05-21 00:57:07] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-05-21 00:57:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:57:07] [INFO ] [Nat]Absence check using 29 positive place invariants in 18 ms returned sat
[2024-05-21 00:57:07] [INFO ] [Nat]Absence check using 29 positive and 91 generalized place invariants in 41 ms returned sat
[2024-05-21 00:57:08] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2024-05-21 00:57:08] [INFO ] Computed and/alt/rep : 447/1724/447 causal constraints (skipped 663 transitions) in 130 ms.
[2024-05-21 00:57:15] [INFO ] Added : 352 causal constraints over 71 iterations in 6785 ms. Result :sat
Minimization took 1453 ms.
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, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 42 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 678/678 places, 1136/1136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 678/678 places, 1136/1136 transitions.
Applied a total of 0 rules in 28 ms. Remains 678 /678 variables (removed 0) and now considering 1136/1136 (removed 0) transitions.
[2024-05-21 00:57:17] [INFO ] Invariant cache hit.
[2024-05-21 00:57:18] [INFO ] Implicit Places using invariants in 849 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 169, 187, 206, 225, 258, 263, 264, 275, 276, 277, 295, 313, 382, 386, 387, 398, 399, 400, 418, 436, 505, 509, 510, 513, 524, 525, 526, 544, 546, 549, 567, 568, 569, 570, 582, 588, 594, 600, 606, 612, 618, 624, 630, 636, 642]
[2024-05-21 00:57:18] [INFO ] Actually due to overlaps returned [544, 526, 30, 48, 169, 277, 295, 400, 418, 549, 149, 276, 399, 525, 568, 148, 275, 398, 524, 546, 567, 0, 263, 264, 386, 387, 509, 510, 18, 19, 66, 313, 436, 570, 612, 630, 642, 187, 206, 258, 513, 569, 582, 588, 594, 600, 606, 618, 624, 636]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 856 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 628/678 places, 1136/1136 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 624 transition count 1053
Reduce places removed 83 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 171 place count 541 transition count 1052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 172 place count 540 transition count 1052
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 172 place count 540 transition count 1028
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 49 rules applied. Total rules applied 221 place count 515 transition count 1028
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 233 place count 511 transition count 1020
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 241 place count 503 transition count 1020
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 256 place count 488 transition count 1005
Iterating global reduction 5 with 15 rules applied. Total rules applied 271 place count 488 transition count 1005
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 274 place count 488 transition count 1002
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 274 place count 488 transition count 1001
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 276 place count 487 transition count 1001
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 279 place count 484 transition count 998
Iterating global reduction 6 with 3 rules applied. Total rules applied 282 place count 484 transition count 998
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 283 place count 483 transition count 997
Iterating global reduction 6 with 1 rules applied. Total rules applied 284 place count 483 transition count 997
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 285 place count 482 transition count 996
Iterating global reduction 6 with 1 rules applied. Total rules applied 286 place count 482 transition count 996
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 366 place count 442 transition count 956
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 369 place count 442 transition count 953
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 373 place count 438 transition count 948
Iterating global reduction 7 with 4 rules applied. Total rules applied 377 place count 438 transition count 948
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 380 place count 438 transition count 945
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 381 place count 438 transition count 944
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 382 place count 437 transition count 944
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 390 place count 437 transition count 936
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 399 place count 428 transition count 936
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 412 place count 428 transition count 936
Applied a total of 412 rules in 346 ms. Remains 428 /628 variables (removed 200) and now considering 936/1136 (removed 200) transitions.
// Phase 1: matrix 936 rows 428 cols
[2024-05-21 00:57:19] [INFO ] Computed 60 invariants in 14 ms
[2024-05-21 00:57:19] [INFO ] Implicit Places using invariants in 707 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 181, 187, 190, 192, 197, 198, 250, 268, 274, 277, 279, 284, 285, 337, 354, 360, 363, 365]
[2024-05-21 00:57:19] [INFO ] Actually due to overlaps returned [104, 197, 284, 105, 198, 285, 89, 95, 100, 101, 181, 187, 192, 268, 274, 279, 354, 360, 365, 72, 250, 337]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 712 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 406/678 places, 936/1136 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 390 transition count 920
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 390 transition count 920
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 386 transition count 916
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 386 transition count 916
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 54 place count 379 transition count 909
Free-agglomeration rule applied 12 times.
Iterating global reduction 0 with 12 rules applied. Total rules applied 66 place count 379 transition count 897
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 78 place count 367 transition count 897
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 81 place count 367 transition count 894
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 364 transition count 894
Applied a total of 84 rules in 423 ms. Remains 364 /406 variables (removed 42) and now considering 894/936 (removed 42) transitions.
// Phase 1: matrix 894 rows 364 cols
[2024-05-21 00:57:20] [INFO ] Computed 38 invariants in 14 ms
[2024-05-21 00:57:20] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-21 00:57:20] [INFO ] Invariant cache hit.
[2024-05-21 00:57:22] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 364/678 places, 894/1136 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4151 ms. Remains : 364/678 places, 894/1136 transitions.
[2024-05-21 00:57:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (19672 resets) in 2078 ms. (481 steps per ms)
BEST_FIRST walk for 3000003 steps (17420 resets) in 2442 ms. (1227 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 00:57:26] [INFO ] Invariant cache hit.
[2024-05-21 00:57:26] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 00:57:26] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 00:57:27] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-21 00:57:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:57:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-05-21 00:57:27] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 18 ms returned sat
[2024-05-21 00:57:27] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2024-05-21 00:57:27] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 88 ms.
[2024-05-21 00:57:28] [INFO ] Added : 16 causal constraints over 5 iterations in 498 ms. Result :sat
Minimization took 683 ms.
[2024-05-21 00:57:28] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:57:28] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 00:57:29] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-21 00:57:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:57:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-21 00:57:29] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 20 ms returned sat
[2024-05-21 00:57:29] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2024-05-21 00:57:29] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 81 ms.
[2024-05-21 00:57:30] [INFO ] Added : 11 causal constraints over 3 iterations in 343 ms. Result :sat
Minimization took 494 ms.
[2024-05-21 00:57:30] [INFO ] [Real]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-21 00:57:30] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-21 00:57:31] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2024-05-21 00:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:57:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 00:57:31] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 00:57:32] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2024-05-21 00:57:32] [INFO ] Computed and/alt/rep : 193/933/193 causal constraints (skipped 679 transitions) in 83 ms.
[2024-05-21 00:57:32] [INFO ] Added : 23 causal constraints over 5 iterations in 600 ms. Result :sat
Minimization took 742 ms.
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, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 894/894 transitions.
Applied a total of 0 rules in 23 ms. Remains 364 /364 variables (removed 0) and now considering 894/894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 364/364 places, 894/894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 894/894 transitions.
Applied a total of 0 rules in 19 ms. Remains 364 /364 variables (removed 0) and now considering 894/894 (removed 0) transitions.
[2024-05-21 00:57:33] [INFO ] Invariant cache hit.
[2024-05-21 00:57:34] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-21 00:57:34] [INFO ] Invariant cache hit.
[2024-05-21 00:57:36] [INFO ] Implicit Places using invariants and state equation in 1531 ms returned []
Implicit Place search using SMT with State Equation took 2126 ms to find 0 implicit places.
[2024-05-21 00:57:36] [INFO ] Redundant transitions in 108 ms returned []
Running 872 sub problems to find dead transitions.
[2024-05-21 00:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 872 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 872 unsolved
[2024-05-21 00:57:48] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 2 ms to minimize.
[2024-05-21 00:57:58] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1258 variables, and 34 constraints, problems are : Problem set: 4 solved, 868 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 872/872 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 2/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/34 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 3/37 constraints. Problems are: Problem set: 4 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/40 constraints. Problems are: Problem set: 4 solved, 868 unsolved
[2024-05-21 00:58:30] [INFO ] Deduced a trap composed of 90 places in 303 ms of which 7 ms to minimize.
[2024-05-21 00:58:31] [INFO ] Deduced a trap composed of 103 places in 428 ms of which 7 ms to minimize.
[2024-05-21 00:58:33] [INFO ] Deduced a trap composed of 13 places in 464 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1258 variables, and 43 constraints, problems are : Problem set: 4 solved, 868 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 0/872 constraints, Known Traps: 5/5 constraints]
After SMT, in 60941ms problems are : Problem set: 4 solved, 868 unsolved
Search for dead transitions found 4 dead transitions in 60993ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 364/364 places, 890/894 transitions.
Applied a total of 0 rules in 20 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 00:58:37] [INFO ] Redundant transitions in 24 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63345 ms. Remains : 364/364 places, 890/894 transitions.
// Phase 1: matrix 890 rows 364 cols
[2024-05-21 00:58:37] [INFO ] Computed 38 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (19450 resets) in 2080 ms. (480 steps per ms)
BEST_FIRST walk for 3000003 steps (17321 resets) in 2715 ms. (1104 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 00:58:42] [INFO ] Invariant cache hit.
[2024-05-21 00:58:42] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:58:42] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 00:58:42] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-21 00:58:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:58:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:58:42] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 00:58:42] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-05-21 00:58:43] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 90 ms.
[2024-05-21 00:58:43] [INFO ] Added : 21 causal constraints over 5 iterations in 489 ms. Result :sat
Minimization took 765 ms.
[2024-05-21 00:58:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 00:58:44] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 13 ms returned sat
[2024-05-21 00:58:44] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-05-21 00:58:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:58:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:58:44] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 15 ms returned sat
[2024-05-21 00:58:45] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2024-05-21 00:58:45] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 90 ms.
[2024-05-21 00:58:45] [INFO ] Added : 11 causal constraints over 3 iterations in 333 ms. Result :sat
Minimization took 543 ms.
[2024-05-21 00:58:46] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2024-05-21 00:58:46] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-21 00:58:46] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-05-21 00:58:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:58:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-21 00:58:46] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-21 00:58:47] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2024-05-21 00:58:47] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 79 ms.
[2024-05-21 00:58:48] [INFO ] Added : 27 causal constraints over 6 iterations in 601 ms. Result :sat
Minimization took 752 ms.
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:[1, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 364/364 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 13 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 00:58:49] [INFO ] Invariant cache hit.
[2024-05-21 00:58:49] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-21 00:58:49] [INFO ] Invariant cache hit.
[2024-05-21 00:58:50] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2024-05-21 00:58:50] [INFO ] Redundant transitions in 9 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-21 00:58:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 00:59:01] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1254 variables, and 33 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 00:59:40] [INFO ] Deduced a trap composed of 96 places in 289 ms of which 4 ms to minimize.
[2024-05-21 00:59:41] [INFO ] Deduced a trap composed of 82 places in 283 ms of which 4 ms to minimize.
[2024-05-21 00:59:43] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 5 ms to minimize.
[2024-05-21 00:59:50] [INFO ] Deduced a trap composed of 83 places in 398 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1254 variables, and 43 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 5/5 constraints]
After SMT, in 60659ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62348 ms. Remains : 364/364 places, 890/890 transitions.
[2024-05-21 00:59:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-04a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (19420 resets) in 1940 ms. (515 steps per ms)
BEST_FIRST walk for 2000002 steps (11623 resets) in 1641 ms. (1218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-21 00:59:55] [INFO ] Invariant cache hit.
[2024-05-21 00:59:55] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-05-21 00:59:55] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-21 00:59:55] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-21 00:59:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:59:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-05-21 00:59:55] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 19 ms returned sat
[2024-05-21 00:59:56] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2024-05-21 00:59:56] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 65 ms.
[2024-05-21 00:59:56] [INFO ] Added : 11 causal constraints over 3 iterations in 254 ms. Result :sat
Minimization took 593 ms.
[2024-05-21 00:59:57] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:59:57] [INFO ] [Real]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 00:59:57] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-21 00:59:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 00:59:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-21 00:59:57] [INFO ] [Nat]Absence check using 9 positive and 29 generalized place invariants in 14 ms returned sat
[2024-05-21 00:59:57] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-21 00:59:58] [INFO ] Computed and/alt/rep : 192/947/192 causal constraints (skipped 676 transitions) in 72 ms.
[2024-05-21 00:59:58] [INFO ] Added : 27 causal constraints over 6 iterations in 514 ms. Result :sat
Minimization took 761 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 12 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 364/364 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 890/890 transitions.
Applied a total of 0 rules in 10 ms. Remains 364 /364 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2024-05-21 00:59:59] [INFO ] Invariant cache hit.
[2024-05-21 01:00:00] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-21 01:00:00] [INFO ] Invariant cache hit.
[2024-05-21 01:00:01] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-05-21 01:00:01] [INFO ] Redundant transitions in 14 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-21 01:00:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 01:00:12] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 363/1254 variables, and 33 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 26/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/363 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 4 (OVERLAPS) 1/364 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 868 unsolved
[2024-05-21 01:00:56] [INFO ] Deduced a trap composed of 96 places in 512 ms of which 6 ms to minimize.
[2024-05-21 01:00:57] [INFO ] Deduced a trap composed of 82 places in 445 ms of which 5 ms to minimize.
[2024-05-21 01:01:00] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/1254 variables, and 42 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/364 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 4/4 constraints]
After SMT, in 60799ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60817ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62517 ms. Remains : 364/364 places, 890/890 transitions.
RANDOM walk for 40000 steps (780 resets) in 1654 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (232 resets) in 513 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (234 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (247 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (230 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
[2024-05-21 01:01:03] [INFO ] Flatten gal took : 326 ms
[2024-05-21 01:01:03] [INFO ] Flatten gal took : 152 ms
[2024-05-21 01:01:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4696393215284689452.gal : 94 ms
[2024-05-21 01:01:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7850357014080986919.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4696393215284689452.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7850357014080986919.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7850357014080986919.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 44
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :44 after 328
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :328 after 8856
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :8856 after 17712
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :17712 after 20070
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :20070 after 20632
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :20632 after 26252
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :26252 after 380002
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :380002 after 4.73798e+06
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,4.96907e+07,1.64768,36700,2,23129,18,81514,6,0,2349,78053,0
Total reachable state count : 49690669

Verifying 4 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,44,1.65391,36700,2,688,18,81514,7,0,2352,78053,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,44,1.65595,36700,2,688,18,81514,8,0,2353,78053,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,6,1.65743,36700,2,477,18,81514,9,0,2355,78053,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,6,1.6584,36700,2,477,18,81514,10,0,2356,78053,0
Interrupted probabilistic random walk after 177971 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 177971 steps, saw 130116 distinct states, run finished after 3011 ms. (steps per millisecond=59 ) properties seen :0
FORMULA ASLink-PT-04a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-04a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 338951 ms.

BK_STOP 1716253266112

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04a, 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 r004-smll-171620117700061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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