fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813597400053
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ASLink-PT-03b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4030.979 513146.00 1677838.00 79.10 1 1 1 1 1 1 ? 1 1 1 1 1 1 1 ? 1 normal

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-167813597400053.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-03b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K 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 8.8K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:07 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 544K 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-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678603795319

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-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:49:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 06:49:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:49:58] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-12 06:49:58] [INFO ] Transformed 1638 places.
[2023-03-12 06:49:58] [INFO ] Transformed 2094 transitions.
[2023-03-12 06:49:58] [INFO ] Found NUPN structural information;
[2023-03-12 06:49:58] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2094 rows 1638 cols
[2023-03-12 06:49:59] [INFO ] Computed 160 place invariants in 87 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :12
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
[2023-03-12 06:49:59] [INFO ] Invariant cache hit.
[2023-03-12 06:50:00] [INFO ] [Real]Absence check using 37 positive place invariants in 68 ms returned sat
[2023-03-12 06:50:00] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 129 ms returned sat
[2023-03-12 06:50:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:01] [INFO ] [Real]Absence check using state equation in 1239 ms returned sat
[2023-03-12 06:50:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 57 ms returned sat
[2023-03-12 06:50:02] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 74 ms returned sat
[2023-03-12 06:50:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:04] [INFO ] [Nat]Absence check using state equation in 2776 ms returned sat
[2023-03-12 06:50:05] [INFO ] Deduced a trap composed of 26 places in 911 ms of which 44 ms to minimize.
[2023-03-12 06:50:06] [INFO ] Deduced a trap composed of 26 places in 730 ms of which 1 ms to minimize.
[2023-03-12 06:50:06] [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: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:50:07] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2023-03-12 06:50:07] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 70 ms returned sat
[2023-03-12 06:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:08] [INFO ] [Real]Absence check using state equation in 1509 ms returned sat
[2023-03-12 06:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 29 ms returned sat
[2023-03-12 06:50:09] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 64 ms returned sat
[2023-03-12 06:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:10] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2023-03-12 06:50:11] [INFO ] Deduced a trap composed of 67 places in 1205 ms of which 3 ms to minimize.
[2023-03-12 06:50:12] [INFO ] Deduced a trap composed of 49 places in 869 ms of which 27 ms to minimize.
[2023-03-12 06:50:13] [INFO ] Deduced a trap composed of 176 places in 780 ms of which 5 ms to minimize.
[2023-03-12 06:50:14] [INFO ] Deduced a trap composed of 153 places in 720 ms of which 1 ms to minimize.
[2023-03-12 06:50:14] [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: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:50:14] [INFO ] [Real]Absence check using 37 positive place invariants in 30 ms returned sat
[2023-03-12 06:50:15] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 98 ms returned sat
[2023-03-12 06:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:16] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2023-03-12 06:50:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 39 ms returned sat
[2023-03-12 06:50:16] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 93 ms returned sat
[2023-03-12 06:50:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:21] [INFO ] [Nat]Absence check using state equation in 4460 ms returned unknown
[2023-03-12 06:50:21] [INFO ] [Real]Absence check using 37 positive place invariants in 26 ms returned sat
[2023-03-12 06:50:21] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 43 ms returned sat
[2023-03-12 06:50:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:23] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2023-03-12 06:50:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 52 ms returned sat
[2023-03-12 06:50:23] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 51 ms returned sat
[2023-03-12 06:50:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:26] [INFO ] [Nat]Absence check using state equation in 2411 ms returned sat
[2023-03-12 06:50:26] [INFO ] Deduced a trap composed of 40 places in 672 ms of which 10 ms to minimize.
[2023-03-12 06:50:27] [INFO ] Deduced a trap composed of 18 places in 783 ms of which 15 ms to minimize.
[2023-03-12 06:50:28] [INFO ] Deduced a trap composed of 21 places in 667 ms of which 1 ms to minimize.
[2023-03-12 06:50:28] [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 3
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 370 transitions
Trivial Post-agglo rules discarded 370 transitions
Performed 370 trivial Post agglomeration. Transition count delta: 370
Iterating post reduction 0 with 370 rules applied. Total rules applied 370 place count 1638 transition count 1724
Reduce places removed 370 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 388 rules applied. Total rules applied 758 place count 1268 transition count 1706
Reduce places removed 5 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 8 rules applied. Total rules applied 766 place count 1263 transition count 1703
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 769 place count 1260 transition count 1703
Performed 374 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 374 Pre rules applied. Total rules applied 769 place count 1260 transition count 1329
Deduced a syphon composed of 374 places in 2 ms
Ensure Unique test removed 32 places
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 4 with 780 rules applied. Total rules applied 1549 place count 854 transition count 1329
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 4 with 25 rules applied. Total rules applied 1574 place count 850 transition count 1308
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 1595 place count 829 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1595 place count 829 transition count 1296
Deduced a syphon composed of 12 places in 5 ms
Ensure Unique test removed 10 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1629 place count 807 transition count 1296
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1631 place count 805 transition count 1296
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1631 place count 805 transition count 1284
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1655 place count 793 transition count 1284
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1706 place count 742 transition count 1233
Iterating global reduction 7 with 51 rules applied. Total rules applied 1757 place count 742 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1758 place count 742 transition count 1232
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 1758 place count 742 transition count 1214
Deduced a syphon composed of 18 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1795 place count 723 transition count 1214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1795 place count 723 transition count 1213
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1798 place count 721 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1802 place count 717 transition count 1186
Iterating global reduction 8 with 4 rules applied. Total rules applied 1806 place count 717 transition count 1186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1806 place count 717 transition count 1183
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1812 place count 714 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1813 place count 713 transition count 1175
Iterating global reduction 8 with 1 rules applied. Total rules applied 1814 place count 713 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1815 place count 712 transition count 1167
Iterating global reduction 8 with 1 rules applied. Total rules applied 1816 place count 712 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1817 place count 711 transition count 1159
Iterating global reduction 8 with 1 rules applied. Total rules applied 1818 place count 711 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1819 place count 710 transition count 1151
Iterating global reduction 8 with 1 rules applied. Total rules applied 1820 place count 710 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1821 place count 709 transition count 1143
Iterating global reduction 8 with 1 rules applied. Total rules applied 1822 place count 709 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1823 place count 708 transition count 1135
Iterating global reduction 8 with 1 rules applied. Total rules applied 1824 place count 708 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1825 place count 707 transition count 1127
Iterating global reduction 8 with 1 rules applied. Total rules applied 1826 place count 707 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1827 place count 706 transition count 1119
Iterating global reduction 8 with 1 rules applied. Total rules applied 1828 place count 706 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1829 place count 705 transition count 1111
Iterating global reduction 8 with 1 rules applied. Total rules applied 1830 place count 705 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1831 place count 704 transition count 1103
Iterating global reduction 8 with 1 rules applied. Total rules applied 1832 place count 704 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1833 place count 703 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 1834 place count 703 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1835 place count 702 transition count 1087
Iterating global reduction 8 with 1 rules applied. Total rules applied 1836 place count 702 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1837 place count 701 transition count 1079
Iterating global reduction 8 with 1 rules applied. Total rules applied 1838 place count 701 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1839 place count 700 transition count 1071
Iterating global reduction 8 with 1 rules applied. Total rules applied 1840 place count 700 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1841 place count 699 transition count 1063
Iterating global reduction 8 with 1 rules applied. Total rules applied 1842 place count 699 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1843 place count 698 transition count 1055
Iterating global reduction 8 with 1 rules applied. Total rules applied 1844 place count 698 transition count 1055
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 8 with 178 rules applied. Total rules applied 2022 place count 609 transition count 966
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2023 place count 608 transition count 965
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2025 place count 607 transition count 965
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2026 place count 606 transition count 964
Iterating global reduction 8 with 1 rules applied. Total rules applied 2027 place count 606 transition count 964
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2029 place count 606 transition count 962
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2030 place count 605 transition count 962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 2032 place count 604 transition count 971
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2036 place count 604 transition count 967
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2040 place count 600 transition count 967
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2043 place count 600 transition count 964
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2046 place count 597 transition count 964
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2047 place count 596 transition count 963
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 12 with 9 rules applied. Total rules applied 2056 place count 590 transition count 960
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2059 place count 587 transition count 960
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 2059 place count 587 transition count 951
Deduced a syphon composed of 9 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 14 with 19 rules applied. Total rules applied 2078 place count 577 transition count 951
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 14 with 4 rules applied. Total rules applied 2082 place count 573 transition count 951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2082 place count 573 transition count 950
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2084 place count 572 transition count 950
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 15 with 14 rules applied. Total rules applied 2098 place count 565 transition count 943
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 2101 place count 562 transition count 940
Iterating global reduction 15 with 3 rules applied. Total rules applied 2104 place count 562 transition count 940
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 2107 place count 562 transition count 937
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2110 place count 559 transition count 937
Applied a total of 2110 rules in 1262 ms. Remains 559 /1638 variables (removed 1079) and now considering 937/2094 (removed 1157) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 559/1638 places, 937/2094 transitions.
// Phase 1: matrix 937 rows 559 cols
[2023-03-12 06:50:29] [INFO ] Computed 98 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 14109 resets, run finished after 2455 ms. (steps per millisecond=407 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3865 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3821 resets, run finished after 1186 ms. (steps per millisecond=843 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3838 resets, run finished after 1190 ms. (steps per millisecond=840 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3854 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 4) seen :1
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-12 06:50:36] [INFO ] Invariant cache hit.
[2023-03-12 06:50:37] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-12 06:50:37] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 24 ms returned sat
[2023-03-12 06:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:37] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-12 06:50:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:37] [INFO ] [Nat]Absence check using 25 positive place invariants in 25 ms returned sat
[2023-03-12 06:50:37] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 24 ms returned sat
[2023-03-12 06:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:38] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-12 06:50:38] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 159 ms.
[2023-03-12 06:50:42] [INFO ] Deduced a trap composed of 123 places in 329 ms of which 1 ms to minimize.
[2023-03-12 06:50:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-12 06:50:42] [INFO ] Added : 205 causal constraints over 41 iterations in 4120 ms. Result :sat
Minimization took 237 ms.
[2023-03-12 06:50:42] [INFO ] [Real]Absence check using 25 positive place invariants in 7 ms returned sat
[2023-03-12 06:50:42] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 79 ms returned sat
[2023-03-12 06:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:43] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2023-03-12 06:50:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:43] [INFO ] [Nat]Absence check using 25 positive place invariants in 15 ms returned sat
[2023-03-12 06:50:43] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 79 ms returned sat
[2023-03-12 06:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:43] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-12 06:50:44] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 109 ms.
[2023-03-12 06:50:47] [INFO ] Added : 212 causal constraints over 43 iterations in 3254 ms. Result :sat
Minimization took 424 ms.
[2023-03-12 06:50:47] [INFO ] [Real]Absence check using 25 positive place invariants in 10 ms returned sat
[2023-03-12 06:50:47] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 21 ms returned sat
[2023-03-12 06:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:48] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2023-03-12 06:50:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:50:48] [INFO ] [Nat]Absence check using 25 positive place invariants in 155 ms returned sat
[2023-03-12 06:50:49] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 462 ms returned sat
[2023-03-12 06:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:50:51] [INFO ] [Nat]Absence check using state equation in 1962 ms returned sat
[2023-03-12 06:50:51] [INFO ] Computed and/alt/rep : 363/1393/363 causal constraints (skipped 553 transitions) in 75 ms.
[2023-03-12 06:50:54] [INFO ] Added : 212 causal constraints over 43 iterations in 3727 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 559 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 559/559 places, 937/937 transitions.
Drop transitions 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 559 transition count 936
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 558 transition count 936
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 2 with 2 rules applied. Total rules applied 4 place count 557 transition count 935
Applied a total of 4 rules in 31 ms. Remains 557 /559 variables (removed 2) and now considering 935/937 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 557/559 places, 935/937 transitions.
// Phase 1: matrix 935 rows 557 cols
[2023-03-12 06:50:56] [INFO ] Computed 98 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 14064 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3911 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3838 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3826 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 3) seen :0
[2023-03-12 06:51:01] [INFO ] Invariant cache hit.
[2023-03-12 06:51:01] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-12 06:51:01] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 28 ms returned sat
[2023-03-12 06:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:01] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-12 06:51:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:01] [INFO ] [Nat]Absence check using 25 positive place invariants in 14 ms returned sat
[2023-03-12 06:51:01] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 45 ms returned sat
[2023-03-12 06:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:02] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2023-03-12 06:51:02] [INFO ] Computed and/alt/rep : 361/1391/361 causal constraints (skipped 553 transitions) in 143 ms.
[2023-03-12 06:51:06] [INFO ] Added : 211 causal constraints over 43 iterations in 3828 ms. Result :sat
Minimization took 246 ms.
[2023-03-12 06:51:06] [INFO ] [Real]Absence check using 25 positive place invariants in 23 ms returned sat
[2023-03-12 06:51:06] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 20 ms returned sat
[2023-03-12 06:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:07] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2023-03-12 06:51:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:07] [INFO ] [Nat]Absence check using 25 positive place invariants in 8 ms returned sat
[2023-03-12 06:51:07] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 25 ms returned sat
[2023-03-12 06:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:07] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-12 06:51:07] [INFO ] Computed and/alt/rep : 361/1391/361 causal constraints (skipped 553 transitions) in 97 ms.
[2023-03-12 06:51:12] [INFO ] Added : 223 causal constraints over 45 iterations in 4221 ms. Result :sat
Minimization took 538 ms.
[2023-03-12 06:51:12] [INFO ] [Real]Absence check using 25 positive place invariants in 30 ms returned sat
[2023-03-12 06:51:12] [INFO ] [Real]Absence check using 25 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-12 06:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:13] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-12 06:51:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:13] [INFO ] [Nat]Absence check using 25 positive place invariants in 73 ms returned sat
[2023-03-12 06:51:13] [INFO ] [Nat]Absence check using 25 positive and 73 generalized place invariants in 165 ms returned sat
[2023-03-12 06:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:13] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-12 06:51:13] [INFO ] Computed and/alt/rep : 361/1391/361 causal constraints (skipped 553 transitions) in 64 ms.
[2023-03-12 06:51:17] [INFO ] Added : 200 causal constraints over 40 iterations in 3550 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 557 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 935/935 transitions.
Applied a total of 0 rules in 18 ms. Remains 557 /557 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 557/557 places, 935/935 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 557/557 places, 935/935 transitions.
Applied a total of 0 rules in 18 ms. Remains 557 /557 variables (removed 0) and now considering 935/935 (removed 0) transitions.
[2023-03-12 06:51:18] [INFO ] Invariant cache hit.
[2023-03-12 06:51:19] [INFO ] Implicit Places using invariants in 817 ms returned [1, 18, 19, 31, 48, 66, 137, 141, 150, 152, 154, 171, 189, 260, 264, 265, 276, 277, 279, 296, 314, 383, 387, 388, 391, 402, 403, 404, 422, 424, 428, 446, 447, 448, 449, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515, 521]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 838 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/557 places, 935/935 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 511 transition count 858
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 158 place count 434 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 160 place count 432 transition count 854
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 160 place count 432 transition count 835
Deduced a syphon composed of 19 places in 18 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 199 place count 412 transition count 835
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 211 place count 408 transition count 827
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 219 place count 400 transition count 827
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 234 place count 385 transition count 812
Iterating global reduction 5 with 15 rules applied. Total rules applied 249 place count 385 transition count 812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 252 place count 385 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 252 place count 385 transition count 808
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 254 place count 384 transition count 808
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 257 place count 381 transition count 802
Iterating global reduction 6 with 3 rules applied. Total rules applied 260 place count 381 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 261 place count 380 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 380 transition count 801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 263 place count 379 transition count 799
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 379 transition count 799
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 318 place count 352 transition count 772
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 321 place count 349 transition count 769
Iterating global reduction 6 with 3 rules applied. Total rules applied 324 place count 349 transition count 769
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 327 place count 349 transition count 766
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 331 place count 347 transition count 767
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 338 place count 347 transition count 760
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 346 place count 339 transition count 760
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 347 place count 339 transition count 759
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 356 place count 339 transition count 759
Applied a total of 356 rules in 204 ms. Remains 339 /511 variables (removed 172) and now considering 759/935 (removed 176) transitions.
// Phase 1: matrix 759 rows 339 cols
[2023-03-12 06:51:19] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-12 06:51:20] [INFO ] Implicit Places using invariants in 363 ms returned [72, 91, 97, 100, 102, 105, 106, 159, 178, 184, 187, 189, 194, 195, 247, 264, 270, 273, 275]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 365 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 320/557 places, 759/935 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 311 transition count 750
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 311 transition count 750
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 308 transition count 747
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 308 transition count 747
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 302 transition count 741
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 302 transition count 732
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 293 transition count 732
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 293 transition count 729
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 290 transition count 729
Applied a total of 60 rules in 93 ms. Remains 290 /320 variables (removed 30) and now considering 729/759 (removed 30) transitions.
// Phase 1: matrix 729 rows 290 cols
[2023-03-12 06:51:20] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-12 06:51:20] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-03-12 06:51:20] [INFO ] Invariant cache hit.
[2023-03-12 06:51:21] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 290/557 places, 729/935 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2729 ms. Remains : 290/557 places, 729/935 transitions.
Successfully produced net in file /tmp/petri1000_579719066989497298.dot
Successfully produced net in file /tmp/petri1001_8303286110060727610.dot
Successfully produced net in file /tmp/petri1002_121692415671818671.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 726 rows 290 cols
[2023-03-12 06:51:21] [INFO ] Computed 27 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 21637 resets, run finished after 1842 ms. (steps per millisecond=542 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6940 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6904 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6968 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 3) seen :0
[2023-03-12 06:51:25] [INFO ] Invariant cache hit.
[2023-03-12 06:51:25] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 06:51:25] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 61 ms returned sat
[2023-03-12 06:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:26] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2023-03-12 06:51:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 20 ms returned sat
[2023-03-12 06:51:26] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-12 06:51:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:26] [INFO ] [Nat]Absence check using state equation in 600 ms returned sat
[2023-03-12 06:51:27] [INFO ] Computed and/alt/rep : 143/730/143 causal constraints (skipped 562 transitions) in 52 ms.
[2023-03-12 06:51:27] [INFO ] Added : 13 causal constraints over 3 iterations in 363 ms. Result :sat
Minimization took 152 ms.
[2023-03-12 06:51:27] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 06:51:27] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-12 06:51:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:27] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-12 06:51:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 06:51:28] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 43 ms returned sat
[2023-03-12 06:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:28] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-12 06:51:28] [INFO ] Computed and/alt/rep : 143/730/143 causal constraints (skipped 562 transitions) in 68 ms.
[2023-03-12 06:51:28] [INFO ] Added : 10 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 70 ms.
[2023-03-12 06:51:28] [INFO ] [Real]Absence check using 9 positive place invariants in 36 ms returned sat
[2023-03-12 06:51:28] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-12 06:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:29] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2023-03-12 06:51:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 67 ms returned sat
[2023-03-12 06:51:29] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 25 ms returned sat
[2023-03-12 06:51:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:29] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2023-03-12 06:51:29] [INFO ] Computed and/alt/rep : 143/730/143 causal constraints (skipped 562 transitions) in 53 ms.
[2023-03-12 06:51:30] [INFO ] Added : 14 causal constraints over 3 iterations in 369 ms. Result :sat
Minimization took 117 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 726/726 transitions.
Graph (complete) has 1787 edges and 290 vertex of which 287 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 287 transition count 726
Applied a total of 4 rules in 21 ms. Remains 287 /290 variables (removed 3) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 287/290 places, 726/726 transitions.
// Phase 1: matrix 726 rows 287 cols
[2023-03-12 06:51:30] [INFO ] Computed 27 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 21781 resets, run finished after 1777 ms. (steps per millisecond=562 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6927 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6853 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6877 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 3) seen :0
[2023-03-12 06:51:34] [INFO ] Invariant cache hit.
[2023-03-12 06:51:34] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-12 06:51:34] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 42 ms returned sat
[2023-03-12 06:51:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:35] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-12 06:51:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 06:51:35] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-12 06:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:35] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2023-03-12 06:51:35] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 67 ms.
[2023-03-12 06:51:35] [INFO ] Added : 26 causal constraints over 6 iterations in 492 ms. Result :sat
Minimization took 103 ms.
[2023-03-12 06:51:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 06:51:36] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 7 ms returned sat
[2023-03-12 06:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:36] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-12 06:51:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 06:51:36] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 26 ms returned sat
[2023-03-12 06:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:36] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-12 06:51:36] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 86 ms.
[2023-03-12 06:51:42] [INFO ] Added : 10 causal constraints over 2 iterations in 6251 ms. Result :unknown
[2023-03-12 06:51:43] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2023-03-12 06:51:43] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 70 ms returned sat
[2023-03-12 06:51:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:43] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-12 06:51:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 06:51:43] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 12 ms returned sat
[2023-03-12 06:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:44] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-12 06:51:44] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 66 ms.
[2023-03-12 06:51:44] [INFO ] Added : 8 causal constraints over 2 iterations in 235 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 726/726 transitions.
Applied a total of 0 rules in 9 ms. Remains 287 /287 variables (removed 0) and now considering 726/726 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 287/287 places, 726/726 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 726/726 transitions.
Applied a total of 0 rules in 9 ms. Remains 287 /287 variables (removed 0) and now considering 726/726 (removed 0) transitions.
[2023-03-12 06:51:45] [INFO ] Invariant cache hit.
[2023-03-12 06:51:45] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-12 06:51:45] [INFO ] Invariant cache hit.
[2023-03-12 06:51:46] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1295 ms to find 0 implicit places.
[2023-03-12 06:51:46] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-12 06:51:46] [INFO ] Invariant cache hit.
[2023-03-12 06:51:46] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1704 ms. Remains : 287/287 places, 726/726 transitions.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-06
[2023-03-12 06:51:46] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 234 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 72 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-12 06:51:46] [INFO ] Invariant cache hit.
[2023-03-12 06:51:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 06:51:46] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 16 ms returned sat
[2023-03-12 06:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:47] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-12 06:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 06:51:47] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 20 ms returned sat
[2023-03-12 06:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:47] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-12 06:51:47] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 78 ms.
[2023-03-12 06:51:48] [INFO ] Added : 26 causal constraints over 6 iterations in 457 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 726/726 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 287 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 285 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 285 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 284 transition count 723
Applied a total of 6 rules in 24 ms. Remains 284 /287 variables (removed 3) and now considering 723/726 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 284/287 places, 723/726 transitions.
// Phase 1: matrix 723 rows 284 cols
[2023-03-12 06:51:48] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 21794 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6970 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 1) seen :0
[2023-03-12 06:51:51] [INFO ] Invariant cache hit.
[2023-03-12 06:51:51] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 06:51:51] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 10 ms returned sat
[2023-03-12 06:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:51] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-03-12 06:51:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 06:51:51] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 79 ms returned sat
[2023-03-12 06:51:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:52] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2023-03-12 06:51:52] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 85 ms.
[2023-03-12 06:51:52] [INFO ] Added : 21 causal constraints over 5 iterations in 463 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 8 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-12 06:51:52] [INFO ] Invariant cache hit.
[2023-03-12 06:51:53] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-12 06:51:53] [INFO ] Invariant cache hit.
[2023-03-12 06:51:54] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2023-03-12 06:51:54] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-12 06:51:54] [INFO ] Invariant cache hit.
[2023-03-12 06:51:54] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1956 ms. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-06 in 7996 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-14
// Phase 1: matrix 726 rows 287 cols
[2023-03-12 06:51:54] [INFO ] Computed 27 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 211 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-12 06:51:54] [INFO ] Invariant cache hit.
[2023-03-12 06:51:54] [INFO ] [Real]Absence check using 8 positive place invariants in 12 ms returned sat
[2023-03-12 06:51:54] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-12 06:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:55] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-12 06:51:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:51:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 06:51:55] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-12 06:51:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:51:55] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-12 06:51:55] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 59 ms.
[2023-03-12 06:52:00] [INFO ] Added : 10 causal constraints over 2 iterations in 4556 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 726/726 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 287 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 285 transition count 724
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 285 transition count 723
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 284 transition count 723
Applied a total of 6 rules in 14 ms. Remains 284 /287 variables (removed 3) and now considering 723/726 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 284/287 places, 723/726 transitions.
// Phase 1: matrix 723 rows 284 cols
[2023-03-12 06:52:00] [INFO ] Computed 27 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 21775 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6835 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
[2023-03-12 06:52:02] [INFO ] Invariant cache hit.
[2023-03-12 06:52:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 06:52:03] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-12 06:52:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:03] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-12 06:52:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:52:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 06:52:03] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-12 06:52:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:03] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2023-03-12 06:52:03] [INFO ] Computed and/alt/rep : 140/725/140 causal constraints (skipped 562 transitions) in 58 ms.
[2023-03-12 06:52:03] [INFO ] Added : 24 causal constraints over 5 iterations in 420 ms. Result :sat
Minimization took 102 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 9 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 284/284 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 723/723 transitions.
Applied a total of 0 rules in 21 ms. Remains 284 /284 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-12 06:52:04] [INFO ] Invariant cache hit.
[2023-03-12 06:52:04] [INFO ] Implicit Places using invariants in 299 ms returned []
[2023-03-12 06:52:04] [INFO ] Invariant cache hit.
[2023-03-12 06:52:05] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
[2023-03-12 06:52:05] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-12 06:52:05] [INFO ] Invariant cache hit.
[2023-03-12 06:52:05] [INFO ] Dead Transitions using invariants and state equation in 369 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1463 ms. Remains : 284/284 places, 723/723 transitions.
Ending property specific reduction for ASLink-PT-03b-UpperBounds-14 in 10813 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-15
// Phase 1: matrix 726 rows 287 cols
[2023-03-12 06:52:05] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 227 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-12 06:52:05] [INFO ] Invariant cache hit.
[2023-03-12 06:52:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 06:52:05] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 30 ms returned sat
[2023-03-12 06:52:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:06] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-12 06:52:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:52:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 06:52:06] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 82 ms returned sat
[2023-03-12 06:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:06] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-12 06:52:06] [INFO ] Computed and/alt/rep : 143/728/143 causal constraints (skipped 562 transitions) in 77 ms.
[2023-03-12 06:52:06] [INFO ] Added : 8 causal constraints over 2 iterations in 249 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 726/726 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 287 transition count 724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 285 transition count 724
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 285 transition count 722
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 283 transition count 722
Applied a total of 8 rules in 14 ms. Remains 283 /287 variables (removed 4) and now considering 722/726 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 283/287 places, 722/726 transitions.
// Phase 1: matrix 722 rows 283 cols
[2023-03-12 06:52:07] [INFO ] Computed 27 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 21502 resets, run finished after 1689 ms. (steps per millisecond=592 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6951 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
[2023-03-12 06:52:09] [INFO ] Invariant cache hit.
[2023-03-12 06:52:09] [INFO ] [Real]Absence check using 9 positive place invariants in 17 ms returned sat
[2023-03-12 06:52:09] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 87 ms returned sat
[2023-03-12 06:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:10] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2023-03-12 06:52:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 06:52:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 06:52:10] [INFO ] [Nat]Absence check using 9 positive and 18 generalized place invariants in 24 ms returned sat
[2023-03-12 06:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 06:52:10] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2023-03-12 06:52:10] [INFO ] Computed and/alt/rep : 139/724/139 causal constraints (skipped 562 transitions) in 74 ms.
[2023-03-12 06:52:11] [INFO ] Added : 43 causal constraints over 12 iterations in 927 ms. Result :sat
Minimization took 133 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 722/722 transitions.
Applied a total of 0 rules in 22 ms. Remains 283 /283 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 283/283 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 722/722 transitions.
Applied a total of 0 rules in 24 ms. Remains 283 /283 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2023-03-12 06:52:11] [INFO ] Invariant cache hit.
[2023-03-12 06:52:12] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-12 06:52:12] [INFO ] Invariant cache hit.
[2023-03-12 06:52:12] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2023-03-12 06:52:12] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-12 06:52:12] [INFO ] Invariant cache hit.
[2023-03-12 06:52:12] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1221 ms. Remains : 283/283 places, 722/722 transitions.
[2023-03-12 06:52:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 21710 resets, run finished after 1597 ms. (steps per millisecond=626 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6929 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 1) seen :0
[2023-03-12 06:52:15] [INFO ] Invariant cache hit.
[2023-03-12 06:52:15] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-12 06:52:15] [INFO ] [Real]Absence check using 9 positive and 18 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for ASLink-PT-03b-UpperBounds-15 in 9725 ms.
[2023-03-12 06:52:15] [INFO ] Flatten gal took : 88 ms
[2023-03-12 06:52:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-12 06:52:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 287 places, 726 transitions and 2965 arcs took 3 ms.
Total runtime 137364 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/740/ub_0_ --maxsum=/tmp/740/ub_1_
Could not compute solution for formula : ASLink-PT-03b-UpperBounds-06
Could not compute solution for formula : ASLink-PT-03b-UpperBounds-14

BK_STOP 1678604308465

--------------------
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:
++ 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
++ sed s/.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
ub formula name ASLink-PT-03b-UpperBounds-06
ub formula formula --maxsum=/tmp/740/ub_0_
ub formula name ASLink-PT-03b-UpperBounds-14
ub formula formula --maxsum=/tmp/740/ub_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 287 places, 726 transitions and 2965 arcs
pnml2lts-sym: Petri net ASLink_PT_03b analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 726->726 groups
pnml2lts-sym: Regrouping took 0.140 real 0.130 user 0.010 sys
pnml2lts-sym: state vector length is 287; there are 726 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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-03b"
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-03b, 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-167813597400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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