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

About the Execution of ITS-Tools for ASLink-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1740.195 280555.00 340258.00 63.20 1 1 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.r005-oct2-167813592700133.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 itstools
Input is ASLink-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 1.2M 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-08b-UpperBounds-00
FORMULA_NAME ASLink-PT-08b-UpperBounds-01
FORMULA_NAME ASLink-PT-08b-UpperBounds-02
FORMULA_NAME ASLink-PT-08b-UpperBounds-03
FORMULA_NAME ASLink-PT-08b-UpperBounds-04
FORMULA_NAME ASLink-PT-08b-UpperBounds-05
FORMULA_NAME ASLink-PT-08b-UpperBounds-06
FORMULA_NAME ASLink-PT-08b-UpperBounds-07
FORMULA_NAME ASLink-PT-08b-UpperBounds-08
FORMULA_NAME ASLink-PT-08b-UpperBounds-09
FORMULA_NAME ASLink-PT-08b-UpperBounds-10
FORMULA_NAME ASLink-PT-08b-UpperBounds-11
FORMULA_NAME ASLink-PT-08b-UpperBounds-12
FORMULA_NAME ASLink-PT-08b-UpperBounds-13
FORMULA_NAME ASLink-PT-08b-UpperBounds-14
FORMULA_NAME ASLink-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678500838946

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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 02:14:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 02:14:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:14:01] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2023-03-11 02:14:01] [INFO ] Transformed 3618 places.
[2023-03-11 02:14:01] [INFO ] Transformed 4459 transitions.
[2023-03-11 02:14:01] [INFO ] Found NUPN structural information;
[2023-03-11 02:14:02] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 494 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 4459 rows 3618 cols
[2023-03-11 02:14:02] [INFO ] Computed 355 place invariants in 182 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 16) seen :9
FORMULA ASLink-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
[2023-03-11 02:14:02] [INFO ] Invariant cache hit.
[2023-03-11 02:14:03] [INFO ] [Real]Absence check using 83 positive place invariants in 248 ms returned sat
[2023-03-11 02:14:04] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 211 ms returned sat
[2023-03-11 02:14:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:07] [INFO ] [Real]Absence check using state equation in 3738 ms returned unknown
[2023-03-11 02:14:08] [INFO ] [Real]Absence check using 83 positive place invariants in 77 ms returned sat
[2023-03-11 02:14:08] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 231 ms returned sat
[2023-03-11 02:14:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:12] [INFO ] [Real]Absence check using state equation in 3918 ms returned unknown
[2023-03-11 02:14:13] [INFO ] [Real]Absence check using 83 positive place invariants in 122 ms returned sat
[2023-03-11 02:14:13] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 192 ms returned sat
[2023-03-11 02:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:17] [INFO ] [Real]Absence check using state equation in 3900 ms returned sat
[2023-03-11 02:14:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:14:18] [INFO ] [Nat]Absence check using 83 positive place invariants in 121 ms returned sat
[2023-03-11 02:14:19] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 349 ms returned sat
[2023-03-11 02:14:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:22] [INFO ] [Nat]Absence check using state equation in 3965 ms returned unknown
[2023-03-11 02:14:23] [INFO ] [Real]Absence check using 83 positive place invariants in 72 ms returned sat
[2023-03-11 02:14:23] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 144 ms returned sat
[2023-03-11 02:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:27] [INFO ] [Real]Absence check using state equation in 3345 ms returned sat
[2023-03-11 02:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:14:28] [INFO ] [Nat]Absence check using 83 positive place invariants in 122 ms returned sat
[2023-03-11 02:14:28] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 610 ms returned sat
[2023-03-11 02:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:31] [INFO ] [Nat]Absence check using state equation in 3243 ms returned sat
[2023-03-11 02:14:35] [INFO ] Deduced a trap composed of 32 places in 2991 ms of which 48 ms to minimize.
[2023-03-11 02:14:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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)
[2023-03-11 02:14:35] [INFO ] [Real]Absence check using 83 positive place invariants in 106 ms returned sat
[2023-03-11 02:14:36] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 130 ms returned sat
[2023-03-11 02:14:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:39] [INFO ] [Real]Absence check using state equation in 3305 ms returned sat
[2023-03-11 02:14:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:14:40] [INFO ] [Nat]Absence check using 83 positive place invariants in 79 ms returned sat
[2023-03-11 02:14:40] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 319 ms returned sat
[2023-03-11 02:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:44] [INFO ] [Nat]Absence check using state equation in 4033 ms returned unknown
[2023-03-11 02:14:45] [INFO ] [Real]Absence check using 83 positive place invariants in 79 ms returned sat
[2023-03-11 02:14:45] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 142 ms returned sat
[2023-03-11 02:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:48] [INFO ] [Real]Absence check using state equation in 2864 ms returned sat
[2023-03-11 02:14:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:14:48] [INFO ] [Nat]Absence check using 83 positive place invariants in 75 ms returned sat
[2023-03-11 02:14:49] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 243 ms returned sat
[2023-03-11 02:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:53] [INFO ] [Nat]Absence check using state equation in 4215 ms returned unknown
[2023-03-11 02:14:53] [INFO ] [Real]Absence check using 83 positive place invariants in 79 ms returned sat
[2023-03-11 02:14:54] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 283 ms returned sat
[2023-03-11 02:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:14:57] [INFO ] [Real]Absence check using state equation in 3058 ms returned sat
[2023-03-11 02:14:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:14:58] [INFO ] [Nat]Absence check using 83 positive place invariants in 103 ms returned sat
[2023-03-11 02:14:58] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 183 ms returned sat
[2023-03-11 02:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:02] [INFO ] [Nat]Absence check using state equation in 3727 ms returned sat
[2023-03-11 02:15:04] [INFO ] Deduced a trap composed of 99 places in 2118 ms of which 3 ms to minimize.
[2023-03-11 02:15:04] [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 6
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, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 844 place count 3618 transition count 3615
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 882 rules applied. Total rules applied 1726 place count 2774 transition count 3577
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1737 place count 2764 transition count 3576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1738 place count 2763 transition count 3576
Performed 839 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 839 Pre rules applied. Total rules applied 1738 place count 2763 transition count 2737
Deduced a syphon composed of 839 places in 9 ms
Ensure Unique test removed 82 places
Reduce places removed 921 places and 0 transitions.
Iterating global reduction 4 with 1760 rules applied. Total rules applied 3498 place count 1842 transition count 2737
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 60 rules applied. Total rules applied 3558 place count 1833 transition count 2686
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 52 rules applied. Total rules applied 3610 place count 1782 transition count 2685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3611 place count 1781 transition count 2685
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3611 place count 1781 transition count 2653
Deduced a syphon composed of 32 places in 8 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 3707 place count 1717 transition count 2653
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3707 place count 1717 transition count 2621
Deduced a syphon composed of 32 places in 15 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 3771 place count 1685 transition count 2621
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 3887 place count 1569 transition count 2505
Iterating global reduction 7 with 116 rules applied. Total rules applied 4003 place count 1569 transition count 2505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4004 place count 1569 transition count 2504
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 4004 place count 1569 transition count 2466
Deduced a syphon composed of 38 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 77 rules applied. Total rules applied 4081 place count 1530 transition count 2466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4081 place count 1530 transition count 2465
Deduced a syphon composed of 1 places in 7 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 4084 place count 1528 transition count 2465
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4093 place count 1519 transition count 2408
Iterating global reduction 8 with 9 rules applied. Total rules applied 4102 place count 1519 transition count 2408
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 4102 place count 1519 transition count 2400
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 4118 place count 1511 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4119 place count 1510 transition count 2392
Iterating global reduction 8 with 1 rules applied. Total rules applied 4120 place count 1510 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4121 place count 1509 transition count 2384
Iterating global reduction 8 with 1 rules applied. Total rules applied 4122 place count 1509 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4123 place count 1508 transition count 2376
Iterating global reduction 8 with 1 rules applied. Total rules applied 4124 place count 1508 transition count 2376
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4125 place count 1507 transition count 2368
Iterating global reduction 8 with 1 rules applied. Total rules applied 4126 place count 1507 transition count 2368
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4127 place count 1506 transition count 2360
Iterating global reduction 8 with 1 rules applied. Total rules applied 4128 place count 1506 transition count 2360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4129 place count 1505 transition count 2352
Iterating global reduction 8 with 1 rules applied. Total rules applied 4130 place count 1505 transition count 2352
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4131 place count 1504 transition count 2344
Iterating global reduction 8 with 1 rules applied. Total rules applied 4132 place count 1504 transition count 2344
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4133 place count 1503 transition count 2336
Iterating global reduction 8 with 1 rules applied. Total rules applied 4134 place count 1503 transition count 2336
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4135 place count 1502 transition count 2328
Iterating global reduction 8 with 1 rules applied. Total rules applied 4136 place count 1502 transition count 2328
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4137 place count 1501 transition count 2320
Iterating global reduction 8 with 1 rules applied. Total rules applied 4138 place count 1501 transition count 2320
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4139 place count 1500 transition count 2312
Iterating global reduction 8 with 1 rules applied. Total rules applied 4140 place count 1500 transition count 2312
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4141 place count 1499 transition count 2304
Iterating global reduction 8 with 1 rules applied. Total rules applied 4142 place count 1499 transition count 2304
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4143 place count 1498 transition count 2296
Iterating global reduction 8 with 1 rules applied. Total rules applied 4144 place count 1498 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4145 place count 1497 transition count 2288
Iterating global reduction 8 with 1 rules applied. Total rules applied 4146 place count 1497 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4147 place count 1496 transition count 2280
Iterating global reduction 8 with 1 rules applied. Total rules applied 4148 place count 1496 transition count 2280
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4149 place count 1495 transition count 2272
Iterating global reduction 8 with 1 rules applied. Total rules applied 4150 place count 1495 transition count 2272
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 208
Deduced a syphon composed of 208 places in 5 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 8 with 416 rules applied. Total rules applied 4566 place count 1287 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4567 place count 1286 transition count 2063
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4569 place count 1285 transition count 2063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4570 place count 1284 transition count 2062
Iterating global reduction 8 with 1 rules applied. Total rules applied 4571 place count 1284 transition count 2062
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 4573 place count 1284 transition count 2060
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4574 place count 1283 transition count 2060
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4576 place count 1282 transition count 2069
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 4586 place count 1282 transition count 2059
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4596 place count 1272 transition count 2059
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 4603 place count 1272 transition count 2052
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 4610 place count 1265 transition count 2052
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4611 place count 1264 transition count 2051
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 21 rules applied. Total rules applied 4632 place count 1249 transition count 2045
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 7 rules applied. Total rules applied 4639 place count 1243 transition count 2044
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4640 place count 1242 transition count 2044
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 23 Pre rules applied. Total rules applied 4640 place count 1242 transition count 2021
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 15 with 46 rules applied. Total rules applied 4686 place count 1219 transition count 2021
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 15 with 8 rules applied. Total rules applied 4694 place count 1211 transition count 2021
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 4724 place count 1196 transition count 2006
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 4732 place count 1188 transition count 1998
Iterating global reduction 16 with 8 rules applied. Total rules applied 4740 place count 1188 transition count 1998
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4748 place count 1188 transition count 1990
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 4756 place count 1180 transition count 1990
Applied a total of 4756 rules in 3428 ms. Remains 1180 /3618 variables (removed 2438) and now considering 1990/4459 (removed 2469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3429 ms. Remains : 1180/3618 places, 1990/4459 transitions.
// Phase 1: matrix 1990 rows 1180 cols
[2023-03-11 02:15:07] [INFO ] Computed 206 place invariants in 51 ms
Incomplete random walk after 1000000 steps, including 10322 resets, run finished after 4003 ms. (steps per millisecond=249 ) properties (out of 7) seen :4
FORMULA ASLink-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1283 resets, run finished after 1829 ms. (steps per millisecond=546 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1273 resets, run finished after 1799 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1278 resets, run finished after 1797 ms. (steps per millisecond=556 ) properties (out of 3) seen :0
[2023-03-11 02:15:17] [INFO ] Invariant cache hit.
[2023-03-11 02:15:17] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2023-03-11 02:15:17] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 78 ms returned sat
[2023-03-11 02:15:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:18] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2023-03-11 02:15:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:15:18] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-11 02:15:18] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 37 ms returned sat
[2023-03-11 02:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:19] [INFO ] [Nat]Absence check using state equation in 959 ms returned sat
[2023-03-11 02:15:19] [INFO ] Computed and/alt/rep : 790/2966/790 causal constraints (skipped 1159 transitions) in 208 ms.
[2023-03-11 02:15:35] [INFO ] Added : 612 causal constraints over 123 iterations in 15970 ms. Result :sat
Minimization took 653 ms.
[2023-03-11 02:15:36] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-11 02:15:36] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 122 ms returned sat
[2023-03-11 02:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:37] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2023-03-11 02:15:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:15:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2023-03-11 02:15:38] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 100 ms returned sat
[2023-03-11 02:15:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:39] [INFO ] [Nat]Absence check using state equation in 1353 ms returned sat
[2023-03-11 02:15:39] [INFO ] Computed and/alt/rep : 790/2966/790 causal constraints (skipped 1159 transitions) in 129 ms.
[2023-03-11 02:15:55] [INFO ] Added : 580 causal constraints over 116 iterations in 16004 ms. Result :sat
Minimization took 939 ms.
[2023-03-11 02:15:56] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-11 02:15:56] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 87 ms returned sat
[2023-03-11 02:15:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:15:57] [INFO ] [Real]Absence check using state equation in 759 ms returned sat
[2023-03-11 02:15:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:15:58] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2023-03-11 02:15:58] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 48 ms returned sat
[2023-03-11 02:15:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:16:02] [INFO ] [Nat]Absence check using state equation in 4041 ms returned sat
[2023-03-11 02:16:02] [INFO ] Computed and/alt/rep : 790/2966/790 causal constraints (skipped 1159 transitions) in 96 ms.
[2023-03-11 02:16:19] [INFO ] Added : 390 causal constraints over 78 iterations in 17446 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1180/1180 places, 1990/1990 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 1180 transition count 1988
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1988
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1177 transition count 1987
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 1177 transition count 1987
Applied a total of 7 rules in 173 ms. Remains 1177 /1180 variables (removed 3) and now considering 1987/1990 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 1177/1180 places, 1987/1990 transitions.
// Phase 1: matrix 1987 rows 1177 cols
[2023-03-11 02:16:28] [INFO ] Computed 206 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 10301 resets, run finished after 3947 ms. (steps per millisecond=253 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1282 resets, run finished after 1831 ms. (steps per millisecond=546 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1281 resets, run finished after 1896 ms. (steps per millisecond=527 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1273 resets, run finished after 1488 ms. (steps per millisecond=672 ) properties (out of 3) seen :0
[2023-03-11 02:16:38] [INFO ] Invariant cache hit.
[2023-03-11 02:16:38] [INFO ] [Real]Absence check using 54 positive place invariants in 35 ms returned sat
[2023-03-11 02:16:38] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 52 ms returned sat
[2023-03-11 02:16:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:16:39] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2023-03-11 02:16:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:16:39] [INFO ] [Nat]Absence check using 54 positive place invariants in 16 ms returned sat
[2023-03-11 02:16:39] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 85 ms returned sat
[2023-03-11 02:16:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:16:40] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2023-03-11 02:16:40] [INFO ] Computed and/alt/rep : 787/2975/787 causal constraints (skipped 1159 transitions) in 133 ms.
[2023-03-11 02:16:56] [INFO ] Added : 647 causal constraints over 130 iterations in 15660 ms. Result :sat
Minimization took 676 ms.
[2023-03-11 02:16:57] [INFO ] [Real]Absence check using 54 positive place invariants in 14 ms returned sat
[2023-03-11 02:16:57] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 102 ms returned sat
[2023-03-11 02:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:16:58] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2023-03-11 02:16:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:16:58] [INFO ] [Nat]Absence check using 54 positive place invariants in 15 ms returned sat
[2023-03-11 02:16:58] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 28 ms returned sat
[2023-03-11 02:16:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:16:59] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2023-03-11 02:16:59] [INFO ] Computed and/alt/rep : 787/2975/787 causal constraints (skipped 1159 transitions) in 95 ms.
[2023-03-11 02:17:09] [INFO ] Added : 110 causal constraints over 22 iterations in 9983 ms. Result :unknown
[2023-03-11 02:17:09] [INFO ] [Real]Absence check using 54 positive place invariants in 18 ms returned sat
[2023-03-11 02:17:09] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 36 ms returned sat
[2023-03-11 02:17:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:10] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2023-03-11 02:17:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:17:10] [INFO ] [Nat]Absence check using 54 positive place invariants in 54 ms returned sat
[2023-03-11 02:17:10] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 29 ms returned sat
[2023-03-11 02:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:11] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2023-03-11 02:17:12] [INFO ] Deduced a trap composed of 113 places in 539 ms of which 2 ms to minimize.
[2023-03-11 02:17:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 678 ms
[2023-03-11 02:17:12] [INFO ] Computed and/alt/rep : 787/2975/787 causal constraints (skipped 1159 transitions) in 118 ms.
[2023-03-11 02:17:15] [INFO ] Added : 70 causal constraints over 14 iterations in 3122 ms. Result :sat
Minimization took 1357 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
FORMULA ASLink-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 1177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 1987/1987 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1176 transition count 1986
Applied a total of 2 rules in 91 ms. Remains 1176 /1177 variables (removed 1) and now considering 1986/1987 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 1176/1177 places, 1986/1987 transitions.
// Phase 1: matrix 1986 rows 1176 cols
[2023-03-11 02:17:21] [INFO ] Computed 206 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 10205 resets, run finished after 3613 ms. (steps per millisecond=276 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1278 resets, run finished after 1466 ms. (steps per millisecond=682 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1281 resets, run finished after 1635 ms. (steps per millisecond=611 ) properties (out of 2) seen :0
[2023-03-11 02:17:28] [INFO ] Invariant cache hit.
[2023-03-11 02:17:28] [INFO ] [Real]Absence check using 54 positive place invariants in 25 ms returned sat
[2023-03-11 02:17:28] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 50 ms returned sat
[2023-03-11 02:17:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:28] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2023-03-11 02:17:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:17:29] [INFO ] [Nat]Absence check using 54 positive place invariants in 30 ms returned sat
[2023-03-11 02:17:29] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 30 ms returned sat
[2023-03-11 02:17:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:30] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2023-03-11 02:17:30] [INFO ] Computed and/alt/rep : 786/2974/786 causal constraints (skipped 1159 transitions) in 191 ms.
[2023-03-11 02:17:36] [INFO ] Added : 234 causal constraints over 47 iterations in 6545 ms. Result :sat
Minimization took 867 ms.
[2023-03-11 02:17:38] [INFO ] [Real]Absence check using 54 positive place invariants in 33 ms returned sat
[2023-03-11 02:17:38] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 79 ms returned sat
[2023-03-11 02:17:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:38] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2023-03-11 02:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:17:39] [INFO ] [Nat]Absence check using 54 positive place invariants in 17 ms returned sat
[2023-03-11 02:17:39] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 40 ms returned sat
[2023-03-11 02:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:17:40] [INFO ] [Nat]Absence check using state equation in 1676 ms returned sat
[2023-03-11 02:17:41] [INFO ] Computed and/alt/rep : 786/2974/786 causal constraints (skipped 1159 transitions) in 137 ms.
[2023-03-11 02:18:00] [INFO ] Added : 620 causal constraints over 124 iterations in 20026 ms.(timeout) Result :sat
Minimization took 1679 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1176/1176 places, 1986/1986 transitions.
Applied a total of 0 rules in 44 ms. Remains 1176 /1176 variables (removed 0) and now considering 1986/1986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1176/1176 places, 1986/1986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1176/1176 places, 1986/1986 transitions.
Applied a total of 0 rules in 40 ms. Remains 1176 /1176 variables (removed 0) and now considering 1986/1986 (removed 0) transitions.
[2023-03-11 02:18:07] [INFO ] Invariant cache hit.
[2023-03-11 02:18:08] [INFO ] Implicit Places using invariants in 1253 ms returned [1, 18, 19, 22, 32, 49, 67, 143, 157, 158, 160, 177, 195, 264, 268, 269, 280, 281, 283, 300, 318, 387, 391, 392, 403, 404, 406, 423, 441, 510, 514, 515, 526, 527, 529, 546, 564, 633, 637, 638, 649, 650, 652, 669, 687, 756, 760, 761, 772, 773, 775, 792, 810, 879, 883, 884, 895, 896, 898, 915, 933, 1002, 1006, 1007, 1010, 1021, 1022, 1023, 1041, 1043, 1047, 1065, 1066, 1067, 1068, 1080, 1086, 1092, 1098, 1104, 1110, 1116, 1122, 1128, 1134, 1140]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 1271 ms to find 86 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1090/1176 places, 1986/1986 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1090 transition count 1829
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 320 place count 933 transition count 1823
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 320 place count 933 transition count 1785
Deduced a syphon composed of 38 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 397 place count 894 transition count 1785
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 2 with 12 rules applied. Total rules applied 409 place count 890 transition count 1777
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 417 place count 882 transition count 1777
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 432 place count 867 transition count 1762
Iterating global reduction 4 with 15 rules applied. Total rules applied 447 place count 867 transition count 1762
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 450 place count 867 transition count 1759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 450 place count 867 transition count 1758
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 452 place count 866 transition count 1758
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 455 place count 863 transition count 1752
Iterating global reduction 5 with 3 rules applied. Total rules applied 458 place count 863 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 459 place count 862 transition count 1751
Iterating global reduction 5 with 1 rules applied. Total rules applied 460 place count 862 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 461 place count 861 transition count 1749
Iterating global reduction 5 with 1 rules applied. Total rules applied 462 place count 861 transition count 1749
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 584 place count 800 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 800 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 592 place count 793 transition count 1680
Iterating global reduction 6 with 7 rules applied. Total rules applied 599 place count 793 transition count 1680
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 606 place count 793 transition count 1673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 610 place count 791 transition count 1674
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 628 place count 791 transition count 1656
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 647 place count 772 transition count 1656
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 671 place count 772 transition count 1656
Applied a total of 671 rules in 344 ms. Remains 772 /1090 variables (removed 318) and now considering 1656/1986 (removed 330) transitions.
// Phase 1: matrix 1656 rows 772 cols
[2023-03-11 02:18:09] [INFO ] Computed 114 place invariants in 15 ms
[2023-03-11 02:18:09] [INFO ] Implicit Places using invariants in 873 ms returned [89, 95, 98, 100, 103, 110, 111, 164, 181, 187, 190, 192, 197, 198, 250, 267, 273, 276, 278, 283, 284, 336, 353, 359, 362, 364, 369, 370, 422, 439, 445, 448, 450, 455, 456, 508, 525, 531, 534, 536, 541, 542, 594, 611, 617, 620, 622, 627, 628, 680, 697, 703, 706, 708]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 898 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 718/1176 places, 1656/1986 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 693 transition count 1631
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 693 transition count 1631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 685 transition count 1623
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 685 transition count 1623
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 96 place count 670 transition count 1608
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 670 transition count 1607
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 121 place count 670 transition count 1583
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 145 place count 646 transition count 1583
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 646 transition count 1576
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 159 place count 639 transition count 1576
Applied a total of 159 rules in 221 ms. Remains 639 /718 variables (removed 79) and now considering 1576/1656 (removed 80) transitions.
// Phase 1: matrix 1576 rows 639 cols
[2023-03-11 02:18:10] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-11 02:18:10] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-11 02:18:10] [INFO ] Invariant cache hit.
[2023-03-11 02:18:13] [INFO ] Implicit Places using invariants and state equation in 2558 ms returned []
Implicit Place search using SMT with State Equation took 3163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 639/1176 places, 1576/1986 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5937 ms. Remains : 639/1176 places, 1576/1986 transitions.
Successfully produced net in file /tmp/petri1000_17388936513164755576.dot
Successfully produced net in file /tmp/petri1001_14732593774840671108.dot
Successfully produced net in file /tmp/petri1002_3487796806284926002.dot
Successfully produced net in file /tmp/petri1003_18220655606136820395.dot
Successfully produced net in file /tmp/petri1004_16633773022639542892.dot
Successfully produced net in file /tmp/petri1005_14355312725534124612.dot
Successfully produced net in file /tmp/petri1006_14249960954876110978.dot
Successfully produced net in file /tmp/petri1007_6861468314998333279.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
// Phase 1: matrix 1568 rows 639 cols
[2023-03-11 02:18:13] [INFO ] Computed 60 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 16760 resets, run finished after 2742 ms. (steps per millisecond=364 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2796 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2795 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 2) seen :0
[2023-03-11 02:18:18] [INFO ] Invariant cache hit.
[2023-03-11 02:18:18] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-11 02:18:18] [INFO ] [Real]Absence check using 14 positive and 46 generalized place invariants in 31 ms returned sat
[2023-03-11 02:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:18] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-11 02:18:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:18:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-11 02:18:19] [INFO ] [Nat]Absence check using 14 positive and 46 generalized place invariants in 37 ms returned sat
[2023-03-11 02:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:20] [INFO ] [Nat]Absence check using state equation in 1152 ms returned sat
[2023-03-11 02:18:20] [INFO ] Computed and/alt/rep : 367/1625/367 causal constraints (skipped 1160 transitions) in 117 ms.
[2023-03-11 02:18:22] [INFO ] Added : 62 causal constraints over 13 iterations in 1758 ms. Result :sat
Minimization took 302 ms.
[2023-03-11 02:18:22] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-11 02:18:22] [INFO ] [Real]Absence check using 14 positive and 46 generalized place invariants in 30 ms returned sat
[2023-03-11 02:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:23] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-11 02:18:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:18:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 02:18:23] [INFO ] [Nat]Absence check using 14 positive and 46 generalized place invariants in 25 ms returned sat
[2023-03-11 02:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:23] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2023-03-11 02:18:24] [INFO ] Computed and/alt/rep : 367/1625/367 causal constraints (skipped 1160 transitions) in 103 ms.
[2023-03-11 02:18:25] [INFO ] Added : 53 causal constraints over 12 iterations in 1972 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1568/1568 transitions.
Graph (complete) has 3878 edges and 639 vertex of which 631 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 631 transition count 1568
Applied a total of 9 rules in 53 ms. Remains 631 /639 variables (removed 8) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 631/639 places, 1568/1568 transitions.
// Phase 1: matrix 1568 rows 631 cols
[2023-03-11 02:18:27] [INFO ] Computed 60 place invariants in 53 ms
Incomplete random walk after 1000000 steps, including 16753 resets, run finished after 2651 ms. (steps per millisecond=377 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2794 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2778 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 2) seen :0
[2023-03-11 02:18:31] [INFO ] Invariant cache hit.
[2023-03-11 02:18:31] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-11 02:18:31] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 73 ms returned sat
[2023-03-11 02:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:32] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2023-03-11 02:18:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:18:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 02:18:32] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 18 ms returned sat
[2023-03-11 02:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:33] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2023-03-11 02:18:33] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 119 ms.
[2023-03-11 02:18:34] [INFO ] Added : 43 causal constraints over 9 iterations in 1328 ms. Result :sat
Minimization took 239 ms.
[2023-03-11 02:18:35] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-11 02:18:35] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 21 ms returned sat
[2023-03-11 02:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:36] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2023-03-11 02:18:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:18:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-11 02:18:36] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 20 ms returned sat
[2023-03-11 02:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:18:37] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2023-03-11 02:18:37] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 131 ms.
[2023-03-11 02:18:38] [INFO ] Added : 39 causal constraints over 8 iterations in 1289 ms. Result :sat
Minimization took 434 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ASLink-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 277858 ms.

BK_STOP 1678501119501

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-08b, 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 r005-oct2-167813592700133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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