Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 357K Mar 5 18:22 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-03a-UpperBounds-00
FORMULA_NAME ASLink-PT-03a-UpperBounds-01
FORMULA_NAME ASLink-PT-03a-UpperBounds-02
FORMULA_NAME ASLink-PT-03a-UpperBounds-03
FORMULA_NAME ASLink-PT-03a-UpperBounds-04
FORMULA_NAME ASLink-PT-03a-UpperBounds-05
FORMULA_NAME ASLink-PT-03a-UpperBounds-06
FORMULA_NAME ASLink-PT-03a-UpperBounds-07
FORMULA_NAME ASLink-PT-03a-UpperBounds-08
FORMULA_NAME ASLink-PT-03a-UpperBounds-09
FORMULA_NAME ASLink-PT-03a-UpperBounds-10
FORMULA_NAME ASLink-PT-03a-UpperBounds-11
FORMULA_NAME ASLink-PT-03a-UpperBounds-12
FORMULA_NAME ASLink-PT-03a-UpperBounds-13
FORMULA_NAME ASLink-PT-03a-UpperBounds-14
FORMULA_NAME ASLink-PT-03a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678602842579

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:34:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:34:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:34:05] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-12 06:34:05] [INFO ] Transformed 821 places.
[2023-03-12 06:34:05] [INFO ] Transformed 1281 transitions.
[2023-03-12 06:34:05] [INFO ] Found NUPN structural information;
[2023-03-12 06:34:05] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-12 06:34:05] [INFO ] Computed 156 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 82 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :10
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
[2023-03-12 06:34:05] [INFO ] Invariant cache hit.
[2023-03-12 06:34:06] [INFO ] [Real]Absence check using 36 positive place invariants in 28 ms returned sat
[2023-03-12 06:34:06] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 49 ms returned sat
[2023-03-12 06:34:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:07] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2023-03-12 06:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 06:34:07] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 25 ms returned sat
[2023-03-12 06:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:12] [INFO ] [Nat]Absence check using state equation in 4852 ms returned unknown
[2023-03-12 06:34:12] [INFO ] [Real]Absence check using 36 positive place invariants in 50 ms returned sat
[2023-03-12 06:34:12] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 59 ms returned sat
[2023-03-12 06:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:13] [INFO ] [Real]Absence check using state equation in 593 ms returned sat
[2023-03-12 06:34:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2023-03-12 06:34:13] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 36 ms returned sat
[2023-03-12 06:34:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:18] [INFO ] [Nat]Absence check using state equation in 4739 ms returned unknown
[2023-03-12 06:34:18] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 06:34:18] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 53 ms returned sat
[2023-03-12 06:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:19] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-12 06:34:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 24 ms returned sat
[2023-03-12 06:34:19] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 34 ms returned sat
[2023-03-12 06:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:24] [INFO ] [Nat]Absence check using state equation in 4728 ms returned unknown
[2023-03-12 06:34:24] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 06:34:24] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 46 ms returned sat
[2023-03-12 06:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:25] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2023-03-12 06:34:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 26 ms returned sat
[2023-03-12 06:34:25] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 26 ms returned sat
[2023-03-12 06:34:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:30] [INFO ] [Nat]Absence check using state equation in 4800 ms returned unknown
[2023-03-12 06:34:30] [INFO ] [Real]Absence check using 36 positive place invariants in 47 ms returned sat
[2023-03-12 06:34:30] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 43 ms returned sat
[2023-03-12 06:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:31] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2023-03-12 06:34:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-12 06:34:31] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 25 ms returned sat
[2023-03-12 06:34:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:32] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2023-03-12 06:34:33] [INFO ] Deduced a trap composed of 24 places in 517 ms of which 17 ms to minimize.
[2023-03-12 06:34:36] [INFO ] Deduced a trap composed of 41 places in 378 ms of which 1 ms to minimize.
[2023-03-12 06:34:37] [INFO ] Deduced a trap composed of 5 places in 570 ms of which 14 ms to minimize.
[2023-03-12 06:34:37] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 06:34:37] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2023-03-12 06:34:37] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 68 ms returned sat
[2023-03-12 06:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:37] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-12 06:34:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-12 06:34:38] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 61 ms returned sat
[2023-03-12 06:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:39] [INFO ] [Nat]Absence check using state equation in 1357 ms returned sat
[2023-03-12 06:34:39] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 176 ms.
[2023-03-12 06:34: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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 803 transition count 1199
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 157 place count 734 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 4 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Drop transitions 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 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 331 place count 630 transition count 1099
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 338 place count 629 transition count 1099
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions 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 344 place count 628 transition count 1094
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 347 place count 625 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 348 place count 624 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 349 place count 624 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 350 place count 623 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 623 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 352 place count 622 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 353 place count 622 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 354 place count 621 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 355 place count 621 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 356 place count 620 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 357 place count 620 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 358 place count 619 transition count 1046
Iterating global reduction 7 with 1 rules applied. Total rules applied 359 place count 619 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 360 place count 618 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 361 place count 618 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 362 place count 617 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 617 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 364 place count 616 transition count 1022
Iterating global reduction 7 with 1 rules applied. Total rules applied 365 place count 616 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 615 transition count 1014
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 615 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 368 place count 614 transition count 1006
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 614 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 370 place count 613 transition count 998
Iterating global reduction 7 with 1 rules applied. Total rules applied 371 place count 613 transition count 998
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 612 transition count 990
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 612 transition count 990
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 374 place count 611 transition count 982
Iterating global reduction 7 with 1 rules applied. Total rules applied 375 place count 611 transition count 982
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 610 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 610 transition count 974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 378 place count 609 transition count 966
Iterating global reduction 7 with 1 rules applied. Total rules applied 379 place count 609 transition count 966
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 8 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 421 place count 588 transition count 945
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 588 transition count 943
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 425 place count 586 transition count 943
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 429 place count 586 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 585 transition count 942
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 436 place count 579 transition count 942
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 436 place count 579 transition count 931
Deduced a syphon composed of 11 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 459 place count 567 transition count 931
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 463 place count 563 transition count 931
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 463 place count 563 transition count 930
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 465 place count 562 transition count 930
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 473 place count 558 transition count 926
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 476 place count 555 transition count 923
Iterating global reduction 10 with 3 rules applied. Total rules applied 479 place count 555 transition count 923
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 482 place count 555 transition count 920
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 485 place count 552 transition count 920
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 488 place count 552 transition count 920
Applied a total of 488 rules in 1005 ms. Remains 552 /821 variables (removed 269) and now considering 920/1268 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1006 ms. Remains : 552/821 places, 920/1268 transitions.
// Phase 1: matrix 920 rows 552 cols
[2023-03-12 06:34:43] [INFO ] Computed 98 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 13981 resets, run finished after 2212 ms. (steps per millisecond=452 ) properties (out of 6) seen :2
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 3895 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3939 resets, run finished after 849 ms. (steps per millisecond=1177 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3892 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3860 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 4) seen :0
[2023-03-12 06:34:49] [INFO ] Invariant cache hit.
[2023-03-12 06:34:49] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-12 06:34:49] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 37 ms returned sat
[2023-03-12 06:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:50] [INFO ] [Real]Absence check using state equation in 794 ms returned sat
[2023-03-12 06:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-12 06:34:50] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 48 ms returned sat
[2023-03-12 06:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:51] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-12 06:34:51] [INFO ] Deduced a trap composed of 105 places in 221 ms of which 16 ms to minimize.
[2023-03-12 06:34:51] [INFO ] Deduced a trap composed of 110 places in 227 ms of which 1 ms to minimize.
[2023-03-12 06:34:51] [INFO ] Deduced a trap composed of 105 places in 166 ms of which 0 ms to minimize.
[2023-03-12 06:34:52] [INFO ] Deduced a trap composed of 106 places in 234 ms of which 0 ms to minimize.
[2023-03-12 06:34:52] [INFO ] Deduced a trap composed of 98 places in 167 ms of which 14 ms to minimize.
[2023-03-12 06:34:52] [INFO ] Deduced a trap composed of 98 places in 225 ms of which 0 ms to minimize.
[2023-03-12 06:34:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1517 ms
[2023-03-12 06:34:52] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 64 ms.
[2023-03-12 06:34:56] [INFO ] Added : 205 causal constraints over 41 iterations in 3375 ms. Result :sat
Minimization took 251 ms.
[2023-03-12 06:34:56] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-12 06:34:56] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 15 ms returned sat
[2023-03-12 06:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:56] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-12 06:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:34:57] [INFO ] [Nat]Absence check using 26 positive place invariants in 41 ms returned sat
[2023-03-12 06:34:57] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 63 ms returned sat
[2023-03-12 06:34:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:34:57] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-03-12 06:34:57] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 114 ms.
[2023-03-12 06:34:59] [INFO ] Added : 124 causal constraints over 25 iterations in 2165 ms. Result :sat
Minimization took 165 ms.
[2023-03-12 06:35:00] [INFO ] [Real]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-12 06:35:00] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 18 ms returned sat
[2023-03-12 06:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:00] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2023-03-12 06:35:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:00] [INFO ] [Nat]Absence check using 26 positive place invariants in 31 ms returned sat
[2023-03-12 06:35:00] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 59 ms returned sat
[2023-03-12 06:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:00] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2023-03-12 06:35:01] [INFO ] Deduced a trap composed of 97 places in 232 ms of which 0 ms to minimize.
[2023-03-12 06:35:01] [INFO ] Deduced a trap composed of 107 places in 252 ms of which 0 ms to minimize.
[2023-03-12 06:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 574 ms
[2023-03-12 06:35:01] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 84 ms.
[2023-03-12 06:35:07] [INFO ] Deduced a trap composed of 95 places in 149 ms of which 0 ms to minimize.
[2023-03-12 06:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2023-03-12 06:35:08] [INFO ] Added : 251 causal constraints over 51 iterations in 6594 ms. Result :sat
Minimization took 271 ms.
[2023-03-12 06:35:08] [INFO ] [Real]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:08] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 116 ms returned sat
[2023-03-12 06:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:09] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2023-03-12 06:35:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:09] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:09] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 39 ms returned sat
[2023-03-12 06:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:09] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2023-03-12 06:35:09] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 67 ms.
[2023-03-12 06:35:12] [INFO ] Added : 124 causal constraints over 25 iterations in 2704 ms. Result :sat
Minimization took 178 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 920/920 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 552 transition count 919
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 551 transition count 919
Applied a total of 2 rules in 46 ms. Remains 551 /552 variables (removed 1) and now considering 919/920 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 551/552 places, 919/920 transitions.
// Phase 1: matrix 919 rows 551 cols
[2023-03-12 06:35:13] [INFO ] Computed 98 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 14060 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3883 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3866 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 2) seen :0
[2023-03-12 06:35:17] [INFO ] Invariant cache hit.
[2023-03-12 06:35:17] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-12 06:35:18] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 407 ms returned sat
[2023-03-12 06:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:18] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2023-03-12 06:35:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:19] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 25 ms returned sat
[2023-03-12 06:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:19] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-12 06:35:19] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 60 ms.
[2023-03-12 06:35:21] [INFO ] Added : 150 causal constraints over 30 iterations in 2590 ms. Result :sat
Minimization took 246 ms.
[2023-03-12 06:35:22] [INFO ] [Real]Absence check using 23 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:22] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 34 ms returned sat
[2023-03-12 06:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:23] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2023-03-12 06:35:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2023-03-12 06:35:23] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 35 ms returned sat
[2023-03-12 06:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:24] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2023-03-12 06:35:24] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 60 ms.
[2023-03-12 06:35:29] [INFO ] Added : 271 causal constraints over 55 iterations in 5249 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 17 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 551/551 places, 919/919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 16 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2023-03-12 06:35:30] [INFO ] Invariant cache hit.
[2023-03-12 06:35:31] [INFO ] Implicit Places using invariants in 1146 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 386, 397, 398, 399, 417, 419, 422, 440, 441, 442, 443, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1157 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 505/551 places, 919/919 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 505 transition count 844
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 430 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 429 transition count 843
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 152 place count 429 transition count 824
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 3 with 39 rules applied. Total rules applied 191 place count 409 transition count 824
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 203 place count 405 transition count 816
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 211 place count 397 transition count 816
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 226 place count 382 transition count 801
Iterating global reduction 5 with 15 rules applied. Total rules applied 241 place count 382 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 244 place count 382 transition count 798
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 244 place count 382 transition count 797
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 381 transition count 797
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 249 place count 378 transition count 794
Iterating global reduction 6 with 3 rules applied. Total rules applied 252 place count 378 transition count 794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 253 place count 377 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 377 transition count 793
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 376 transition count 792
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 376 transition count 792
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 320 place count 344 transition count 760
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 344 transition count 757
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 326 place count 341 transition count 754
Iterating global reduction 7 with 3 rules applied. Total rules applied 329 place count 341 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 332 place count 341 transition count 751
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 338 place count 341 transition count 745
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 345 place count 334 transition count 745
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 355 place count 334 transition count 745
Applied a total of 355 rules in 248 ms. Remains 334 /505 variables (removed 171) and now considering 745/919 (removed 174) transitions.
// Phase 1: matrix 745 rows 334 cols
[2023-03-12 06:35:31] [INFO ] Computed 46 place invariants in 28 ms
[2023-03-12 06:35:32] [INFO ] Implicit Places using invariants in 400 ms returned [72, 90, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 401 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 315/551 places, 745/919 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 306 transition count 736
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 306 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 303 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 303 transition count 733
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 0 with 12 rules applied. Total rules applied 36 place count 297 transition count 727
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 297 transition count 718
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 288 transition count 718
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 288 transition count 715
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 285 transition count 715
Applied a total of 60 rules in 78 ms. Remains 285 /315 variables (removed 30) and now considering 715/745 (removed 30) transitions.
// Phase 1: matrix 715 rows 285 cols
[2023-03-12 06:35:32] [INFO ] Computed 27 place invariants in 8 ms
[2023-03-12 06:35:32] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-12 06:35:32] [INFO ] Invariant cache hit.
[2023-03-12 06:35:32] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 285/551 places, 715/919 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2703 ms. Remains : 285/551 places, 715/919 transitions.
Successfully produced net in file /tmp/petri1000_5376295652251210243.dot
Successfully produced net in file /tmp/petri1001_7445723134441801141.dot
Successfully produced net in file /tmp/petri1002_4152301870011237609.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 712 rows 285 cols
[2023-03-12 06:35:32] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 21092 resets, run finished after 1581 ms. (steps per millisecond=632 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7325 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7278 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 2) seen :0
[2023-03-12 06:35:36] [INFO ] Invariant cache hit.
[2023-03-12 06:35:36] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 06:35:36] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-12 06:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:36] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2023-03-12 06:35:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 06:35:36] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-12 06:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:36] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2023-03-12 06:35:36] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 62 ms.
[2023-03-12 06:35:37] [INFO ] Added : 16 causal constraints over 4 iterations in 421 ms. Result :sat
Minimization took 121 ms.
[2023-03-12 06:35:37] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-12 06:35:37] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-12 06:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:37] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-12 06:35:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:37] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-12 06:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:38] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2023-03-12 06:35:38] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 59 ms.
[2023-03-12 06:35:38] [INFO ] Added : 13 causal constraints over 3 iterations in 316 ms. Result :sat
Minimization took 101 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Graph (complete) has 1769 edges and 285 vertex of which 282 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 282 transition count 712
Applied a total of 4 rules in 18 ms. Remains 282 /285 variables (removed 3) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 282/285 places, 712/712 transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-12 06:35:38] [INFO ] Computed 27 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 20991 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7377 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7289 resets, run finished after 749 ms. (steps per millisecond=1335 ) properties (out of 2) seen :0
[2023-03-12 06:35:42] [INFO ] Invariant cache hit.
[2023-03-12 06:35:42] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:42] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 111 ms returned sat
[2023-03-12 06:35:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:42] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-12 06:35:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 06:35:42] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-12 06:35:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:42] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-12 06:35:43] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 46 ms.
[2023-03-12 06:35:43] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2023-03-12 06:35:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
[2023-03-12 06:35:43] [INFO ] Added : 48 causal constraints over 10 iterations in 919 ms. Result :sat
Minimization took 98 ms.
[2023-03-12 06:35:44] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:44] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2023-03-12 06:35:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 06:35:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:44] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-12 06:35:44] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 64 ms.
[2023-03-12 06:35:45] [INFO ] Added : 16 causal constraints over 4 iterations in 336 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-12 06:35:45] [INFO ] Invariant cache hit.
[2023-03-12 06:35:45] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-12 06:35:45] [INFO ] Invariant cache hit.
[2023-03-12 06:35:46] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-12 06:35:46] [INFO ] Redundant transitions in 47 ms returned []
[2023-03-12 06:35:46] [INFO ] Invariant cache hit.
[2023-03-12 06:35:46] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1257 ms. Remains : 282/282 places, 712/712 transitions.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-04
[2023-03-12 06:35:46] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 213 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-12 06:35:46] [INFO ] Invariant cache hit.
[2023-03-12 06:35:46] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:46] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 13 ms returned sat
[2023-03-12 06:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:47] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-12 06:35:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:47] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-12 06:35:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:47] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-12 06:35:47] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 57 ms.
[2023-03-12 06:35:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2023-03-12 06:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-12 06:35:48] [INFO ] Added : 48 causal constraints over 10 iterations in 930 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 282/282 places, 712/712 transitions.
[2023-03-12 06:35:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 21353 resets, run finished after 1529 ms. (steps per millisecond=654 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7346 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 1) seen :0
[2023-03-12 06:35:51] [INFO ] Invariant cache hit.
[2023-03-12 06:35:51] [INFO ] [Real]Absence check using 10 positive place invariants in 53 ms returned sat
[2023-03-12 06:35:51] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 63 ms returned sat
[2023-03-12 06:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:51] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-12 06:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-12 06:35:51] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 5 ms returned sat
[2023-03-12 06:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:51] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2023-03-12 06:35:51] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 64 ms.
[2023-03-12 06:35:52] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2023-03-12 06:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-12 06:35:52] [INFO ] Added : 48 causal constraints over 10 iterations in 1022 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-12 06:35:53] [INFO ] Invariant cache hit.
[2023-03-12 06:35:53] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-12 06:35:53] [INFO ] Invariant cache hit.
[2023-03-12 06:35:54] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1293 ms to find 0 implicit places.
[2023-03-12 06:35:54] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-12 06:35:54] [INFO ] Invariant cache hit.
[2023-03-12 06:35:54] [INFO ] Dead Transitions using invariants and state equation in 309 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1620 ms. Remains : 282/282 places, 712/712 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-04 in 8001 ms.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-13
[2023-03-12 06:35:54] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 200 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 06:35:54] [INFO ] Invariant cache hit.
[2023-03-12 06:35:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:54] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-12 06:35:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:55] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-12 06:35:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 06:35:55] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 60 ms returned sat
[2023-03-12 06:35:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:55] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-12 06:35:55] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 57 ms.
[2023-03-12 06:35:55] [INFO ] Added : 16 causal constraints over 4 iterations in 347 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 281 transition count 711
Applied a total of 2 rules in 17 ms. Remains 281 /282 variables (removed 1) and now considering 711/712 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 281/282 places, 711/712 transitions.
// Phase 1: matrix 711 rows 281 cols
[2023-03-12 06:35:56] [INFO ] Computed 27 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 21253 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7386 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
[2023-03-12 06:35:58] [INFO ] Invariant cache hit.
[2023-03-12 06:35:58] [INFO ] [Real]Absence check using 8 positive place invariants in 44 ms returned sat
[2023-03-12 06:35:58] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-12 06:35:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:35:59] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-12 06:35:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:35:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 06:35:59] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-12 06:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:36:00] [INFO ] [Nat]Absence check using state equation in 1020 ms returned sat
[2023-03-12 06:36:00] [INFO ] Computed and/alt/rep : 133/674/133 causal constraints (skipped 560 transitions) in 43 ms.
[2023-03-12 06:36:00] [INFO ] Added : 10 causal constraints over 2 iterations in 187 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 281/281 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 8 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2023-03-12 06:36:00] [INFO ] Invariant cache hit.
[2023-03-12 06:36:00] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-12 06:36:00] [INFO ] Invariant cache hit.
[2023-03-12 06:36:01] [INFO ] Implicit Places using invariants and state equation in 719 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2023-03-12 06:36:01] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-12 06:36:01] [INFO ] Invariant cache hit.
[2023-03-12 06:36:01] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1254 ms. Remains : 281/281 places, 711/711 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-13 in 7195 ms.
[2023-03-12 06:36:02] [INFO ] Flatten gal took : 98 ms
[2023-03-12 06:36:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 06:36:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 282 places, 712 transitions and 2910 arcs took 3 ms.
Total runtime 116986 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/720/ub_0_ --maxsum=/tmp/720/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 13748076 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096732 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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-03a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-03a, 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 r009-oct2-167813597300045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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