fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989500085
Last Updated
Jun 28, 2021

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1314.760 151940.00 182062.00 592.60 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/mcc2021-input.r007-tall-162037989500085.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-05b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989500085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 96K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 795K May 5 16:51 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-05b-UpperBounds-00
FORMULA_NAME ASLink-PT-05b-UpperBounds-01
FORMULA_NAME ASLink-PT-05b-UpperBounds-02
FORMULA_NAME ASLink-PT-05b-UpperBounds-03
FORMULA_NAME ASLink-PT-05b-UpperBounds-04
FORMULA_NAME ASLink-PT-05b-UpperBounds-05
FORMULA_NAME ASLink-PT-05b-UpperBounds-06
FORMULA_NAME ASLink-PT-05b-UpperBounds-07
FORMULA_NAME ASLink-PT-05b-UpperBounds-08
FORMULA_NAME ASLink-PT-05b-UpperBounds-09
FORMULA_NAME ASLink-PT-05b-UpperBounds-10
FORMULA_NAME ASLink-PT-05b-UpperBounds-11
FORMULA_NAME ASLink-PT-05b-UpperBounds-12
FORMULA_NAME ASLink-PT-05b-UpperBounds-13
FORMULA_NAME ASLink-PT-05b-UpperBounds-14
FORMULA_NAME ASLink-PT-05b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620414449993

Running Version 0
[2021-05-07 19:07:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 19:07:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 19:07:31] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2021-05-07 19:07:31] [INFO ] Transformed 2430 places.
[2021-05-07 19:07:31] [INFO ] Transformed 3040 transitions.
[2021-05-07 19:07:31] [INFO ] Found NUPN structural information;
[2021-05-07 19:07:31] [INFO ] Parsed PT model containing 2430 places and 3040 transitions in 216 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3040 rows 2430 cols
[2021-05-07 19:07:32] [INFO ] Computed 238 place invariants in 203 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :11
FORMULA ASLink-PT-05b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
// Phase 1: matrix 3040 rows 2430 cols
[2021-05-07 19:07:32] [INFO ] Computed 238 place invariants in 213 ms
[2021-05-07 19:07:33] [INFO ] [Real]Absence check using 56 positive place invariants in 59 ms returned sat
[2021-05-07 19:07:33] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 70 ms returned sat
[2021-05-07 19:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:34] [INFO ] [Real]Absence check using state equation in 1472 ms returned sat
[2021-05-07 19:07:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:07:35] [INFO ] [Nat]Absence check using 56 positive place invariants in 49 ms returned sat
[2021-05-07 19:07:35] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2021-05-07 19:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:39] [INFO ] [Nat]Absence check using state equation in 4441 ms returned unknown
[2021-05-07 19:07:40] [INFO ] [Real]Absence check using 56 positive place invariants in 47 ms returned sat
[2021-05-07 19:07:40] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2021-05-07 19:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:41] [INFO ] [Real]Absence check using state equation in 1440 ms returned sat
[2021-05-07 19:07:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:07:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 51 ms returned sat
[2021-05-07 19:07:42] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 67 ms returned sat
[2021-05-07 19:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:47] [INFO ] [Nat]Absence check using state equation in 4488 ms returned unknown
[2021-05-07 19:07:47] [INFO ] [Real]Absence check using 56 positive place invariants in 45 ms returned sat
[2021-05-07 19:07:47] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 62 ms returned sat
[2021-05-07 19:07:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:48] [INFO ] [Real]Absence check using state equation in 1428 ms returned sat
[2021-05-07 19:07:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:07:49] [INFO ] [Nat]Absence check using 56 positive place invariants in 47 ms returned sat
[2021-05-07 19:07:49] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 62 ms returned sat
[2021-05-07 19:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:51] [INFO ] [Nat]Absence check using state equation in 1864 ms returned sat
[2021-05-07 19:07:52] [INFO ] Deduced a trap composed of 76 places in 747 ms of which 5 ms to minimize.
[2021-05-07 19:07:53] [INFO ] Deduced a trap composed of 124 places in 807 ms of which 6 ms to minimize.
[2021-05-07 19:07:53] [INFO ] Deduced a trap composed of 123 places in 620 ms of which 2 ms to minimize.
[2021-05-07 19:07:54] [INFO ] Deduced a trap composed of 47 places in 625 ms of which 2 ms to minimize.
[2021-05-07 19:07:54] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-07 19:07:54] [INFO ] [Real]Absence check using 56 positive place invariants in 49 ms returned sat
[2021-05-07 19:07:55] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 66 ms returned sat
[2021-05-07 19:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:07:56] [INFO ] [Real]Absence check using state equation in 1423 ms returned sat
[2021-05-07 19:07:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:07:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 49 ms returned sat
[2021-05-07 19:07:57] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 63 ms returned sat
[2021-05-07 19:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:01] [INFO ] [Nat]Absence check using state equation in 4574 ms returned unknown
[2021-05-07 19:08:01] [INFO ] [Real]Absence check using 56 positive place invariants in 48 ms returned sat
[2021-05-07 19:08:02] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 68 ms returned sat
[2021-05-07 19:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:03] [INFO ] [Real]Absence check using state equation in 1524 ms returned sat
[2021-05-07 19:08:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 49 ms returned sat
[2021-05-07 19:08:04] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 60 ms returned sat
[2021-05-07 19:08:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:08] [INFO ] [Nat]Absence check using state equation in 4585 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 2430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions removed 562 transitions
Trivial Post-agglo rules discarded 562 transitions
Performed 562 trivial Post agglomeration. Transition count delta: 562
Iterating post reduction 0 with 562 rules applied. Total rules applied 562 place count 2430 transition count 2478
Reduce places removed 562 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 588 rules applied. Total rules applied 1150 place count 1868 transition count 2452
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1158 place count 1861 transition count 2451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1159 place count 1860 transition count 2451
Performed 560 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 560 Pre rules applied. Total rules applied 1159 place count 1860 transition count 1891
Deduced a syphon composed of 560 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 613 places and 0 transitions.
Iterating global reduction 4 with 1173 rules applied. Total rules applied 2332 place count 1247 transition count 1891
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2370 place count 1242 transition count 1858
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 5 with 33 rules applied. Total rules applied 2403 place count 1209 transition count 1858
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2403 place count 1209 transition count 1838
Deduced a syphon composed of 20 places in 9 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2463 place count 1169 transition count 1838
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2463 place count 1169 transition count 1818
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2503 place count 1149 transition count 1818
Discarding 76 places :
Symmetric choice reduction at 6 with 76 rule applications. Total rules 2579 place count 1073 transition count 1742
Iterating global reduction 6 with 76 rules applied. Total rules applied 2655 place count 1073 transition count 1742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2656 place count 1073 transition count 1741
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 25 Pre rules applied. Total rules applied 2656 place count 1073 transition count 1716
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 51 rules applied. Total rules applied 2707 place count 1047 transition count 1716
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2707 place count 1047 transition count 1715
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 2710 place count 1045 transition count 1715
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2716 place count 1039 transition count 1676
Iterating global reduction 7 with 6 rules applied. Total rules applied 2722 place count 1039 transition count 1676
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 2722 place count 1039 transition count 1671
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2732 place count 1034 transition count 1671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2733 place count 1033 transition count 1663
Iterating global reduction 7 with 1 rules applied. Total rules applied 2734 place count 1033 transition count 1663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2735 place count 1032 transition count 1655
Iterating global reduction 7 with 1 rules applied. Total rules applied 2736 place count 1032 transition count 1655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2737 place count 1031 transition count 1647
Iterating global reduction 7 with 1 rules applied. Total rules applied 2738 place count 1031 transition count 1647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2739 place count 1030 transition count 1639
Iterating global reduction 7 with 1 rules applied. Total rules applied 2740 place count 1030 transition count 1639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2741 place count 1029 transition count 1631
Iterating global reduction 7 with 1 rules applied. Total rules applied 2742 place count 1029 transition count 1631
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2743 place count 1028 transition count 1623
Iterating global reduction 7 with 1 rules applied. Total rules applied 2744 place count 1028 transition count 1623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2745 place count 1027 transition count 1615
Iterating global reduction 7 with 1 rules applied. Total rules applied 2746 place count 1027 transition count 1615
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2747 place count 1026 transition count 1607
Iterating global reduction 7 with 1 rules applied. Total rules applied 2748 place count 1026 transition count 1607
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2749 place count 1025 transition count 1599
Iterating global reduction 7 with 1 rules applied. Total rules applied 2750 place count 1025 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2751 place count 1024 transition count 1591
Iterating global reduction 7 with 1 rules applied. Total rules applied 2752 place count 1024 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2753 place count 1023 transition count 1583
Iterating global reduction 7 with 1 rules applied. Total rules applied 2754 place count 1023 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2755 place count 1022 transition count 1575
Iterating global reduction 7 with 1 rules applied. Total rules applied 2756 place count 1022 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2757 place count 1021 transition count 1567
Iterating global reduction 7 with 1 rules applied. Total rules applied 2758 place count 1021 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2759 place count 1020 transition count 1559
Iterating global reduction 7 with 1 rules applied. Total rules applied 2760 place count 1020 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2761 place count 1019 transition count 1551
Iterating global reduction 7 with 1 rules applied. Total rules applied 2762 place count 1019 transition count 1551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2763 place count 1018 transition count 1543
Iterating global reduction 7 with 1 rules applied. Total rules applied 2764 place count 1018 transition count 1543
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 2 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 7 with 276 rules applied. Total rules applied 3040 place count 880 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3041 place count 879 transition count 1404
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3043 place count 878 transition count 1404
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3044 place count 877 transition count 1403
Iterating global reduction 7 with 1 rules applied. Total rules applied 3045 place count 877 transition count 1403
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 7 with 2 rules applied. Total rules applied 3047 place count 877 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3048 place count 876 transition count 1401
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 9 with 2 rules applied. Total rules applied 3050 place count 875 transition count 1410
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3057 place count 875 transition count 1403
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3064 place count 868 transition count 1403
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 3069 place count 868 transition count 1398
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 3074 place count 863 transition count 1398
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3075 place count 862 transition count 1397
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 13 rules applied. Total rules applied 3088 place count 853 transition count 1393
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 3093 place count 849 transition count 1392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3094 place count 848 transition count 1392
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 13 Pre rules applied. Total rules applied 3094 place count 848 transition count 1379
Deduced a syphon composed of 13 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 14 with 27 rules applied. Total rules applied 3121 place count 834 transition count 1379
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 3127 place count 828 transition count 1379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3127 place count 828 transition count 1378
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3129 place count 827 transition count 1378
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 15 with 20 rules applied. Total rules applied 3149 place count 817 transition count 1368
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3154 place count 812 transition count 1363
Iterating global reduction 15 with 5 rules applied. Total rules applied 3159 place count 812 transition count 1363
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 3164 place count 812 transition count 1358
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 3169 place count 807 transition count 1358
Applied a total of 3169 rules in 2001 ms. Remains 807 /2430 variables (removed 1623) and now considering 1358/3040 (removed 1682) transitions.
Finished structural reductions, in 1 iterations. Remains : 807/2430 places, 1358/3040 transitions.
// Phase 1: matrix 1358 rows 807 cols
[2021-05-07 19:08:10] [INFO ] Computed 141 place invariants in 84 ms
Incomplete random walk after 1000000 steps, including 11807 resets, run finished after 3521 ms. (steps per millisecond=284 ) properties (out of 5) seen :1
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2250 resets, run finished after 1438 ms. (steps per millisecond=695 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2259 resets, run finished after 1365 ms. (steps per millisecond=732 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2223 resets, run finished after 1358 ms. (steps per millisecond=736 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2223 resets, run finished after 1381 ms. (steps per millisecond=724 ) properties (out of 4) seen :0
// Phase 1: matrix 1358 rows 807 cols
[2021-05-07 19:08:19] [INFO ] Computed 141 place invariants in 24 ms
[2021-05-07 19:08:19] [INFO ] [Real]Absence check using 37 positive place invariants in 12 ms returned sat
[2021-05-07 19:08:19] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 20 ms returned sat
[2021-05-07 19:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:20] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2021-05-07 19:08:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:20] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 18 ms returned sat
[2021-05-07 19:08:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:21] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2021-05-07 19:08:21] [INFO ] Computed and/alt/rep : 552/2188/552 causal constraints (skipped 777 transitions) in 90 ms.
[2021-05-07 19:08:27] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 0 ms to minimize.
[2021-05-07 19:08:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2021-05-07 19:08:27] [INFO ] Added : 401 causal constraints over 81 iterations in 6361 ms. Result :sat
Minimization took 598 ms.
[2021-05-07 19:08:28] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:28] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 18 ms returned sat
[2021-05-07 19:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:28] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2021-05-07 19:08:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:28] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2021-05-07 19:08:28] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:29] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2021-05-07 19:08:29] [INFO ] Computed and/alt/rep : 552/2188/552 causal constraints (skipped 777 transitions) in 76 ms.
[2021-05-07 19:08:34] [INFO ] Deduced a trap composed of 118 places in 288 ms of which 5 ms to minimize.
[2021-05-07 19:08:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2021-05-07 19:08:34] [INFO ] Added : 343 causal constraints over 69 iterations in 4939 ms. Result :sat
Minimization took 473 ms.
[2021-05-07 19:08:35] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:35] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:08:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:35] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-07 19:08:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:35] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:08:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:36] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2021-05-07 19:08:36] [INFO ] Computed and/alt/rep : 552/2188/552 causal constraints (skipped 777 transitions) in 66 ms.
[2021-05-07 19:08:42] [INFO ] Added : 20 causal constraints over 4 iterations in 6447 ms. Result :unknown
[2021-05-07 19:08:42] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:42] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:43] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2021-05-07 19:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2021-05-07 19:08:43] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 18 ms returned sat
[2021-05-07 19:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:43] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2021-05-07 19:08:44] [INFO ] Computed and/alt/rep : 552/2188/552 causal constraints (skipped 777 transitions) in 79 ms.
[2021-05-07 19:08:48] [INFO ] Added : 274 causal constraints over 55 iterations in 4904 ms. Result :sat
Minimization took 596 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 191300 steps, including 1002 resets, run finished after 664 ms. (steps per millisecond=288 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 108300 steps, including 1002 resets, run finished after 373 ms. (steps per millisecond=290 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 188200 steps, including 2714 resets, run finished after 652 ms. (steps per millisecond=288 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 197100 steps, including 2486 resets, run finished after 679 ms. (steps per millisecond=290 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 807 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 807/807 places, 1358/1358 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 806 transition count 1357
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 806 transition count 1357
Applied a total of 3 rules in 65 ms. Remains 806 /807 variables (removed 1) and now considering 1357/1358 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 806/807 places, 1357/1358 transitions.
// Phase 1: matrix 1357 rows 806 cols
[2021-05-07 19:08:51] [INFO ] Computed 141 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 11659 resets, run finished after 3493 ms. (steps per millisecond=286 ) properties (out of 4) seen :1
FORMULA ASLink-PT-05b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2240 resets, run finished after 1282 ms. (steps per millisecond=780 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2232 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2216 resets, run finished after 1289 ms. (steps per millisecond=775 ) properties (out of 3) seen :0
// Phase 1: matrix 1357 rows 806 cols
[2021-05-07 19:08:59] [INFO ] Computed 141 place invariants in 20 ms
[2021-05-07 19:08:59] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:59] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:08:59] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2021-05-07 19:08:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:08:59] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:08:59] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 18 ms returned sat
[2021-05-07 19:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:00] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2021-05-07 19:09:00] [INFO ] Computed and/alt/rep : 551/2192/551 causal constraints (skipped 777 transitions) in 75 ms.
[2021-05-07 19:09:06] [INFO ] Deduced a trap composed of 95 places in 199 ms of which 1 ms to minimize.
[2021-05-07 19:09:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 316 ms
[2021-05-07 19:09:06] [INFO ] Added : 414 causal constraints over 83 iterations in 5905 ms. Result :sat
Minimization took 525 ms.
[2021-05-07 19:09:07] [INFO ] [Real]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:07] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:09:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:07] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2021-05-07 19:09:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:07] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:07] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:08] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2021-05-07 19:09:08] [INFO ] Computed and/alt/rep : 551/2192/551 causal constraints (skipped 777 transitions) in 69 ms.
[2021-05-07 19:09:13] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 1 ms to minimize.
[2021-05-07 19:09:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2021-05-07 19:09:13] [INFO ] Added : 344 causal constraints over 69 iterations in 5379 ms. Result :sat
Minimization took 612 ms.
[2021-05-07 19:09:14] [INFO ] [Real]Absence check using 37 positive place invariants in 10 ms returned sat
[2021-05-07 19:09:14] [INFO ] [Real]Absence check using 37 positive and 104 generalized place invariants in 20 ms returned sat
[2021-05-07 19:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:14] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2021-05-07 19:09:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:14] [INFO ] [Nat]Absence check using 37 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:15] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-07 19:09:15] [INFO ] Computed and/alt/rep : 551/2192/551 causal constraints (skipped 777 transitions) in 67 ms.
[2021-05-07 19:09:16] [INFO ] Added : 102 causal constraints over 21 iterations in 1780 ms. Result :sat
Minimization took 540 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 290300 steps, including 2687 resets, run finished after 1021 ms. (steps per millisecond=284 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 433200 steps, including 1002 resets, run finished after 1425 ms. (steps per millisecond=304 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 278800 steps, including 3628 resets, run finished after 965 ms. (steps per millisecond=288 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 806/806 places, 1357/1357 transitions.
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 804 transition count 1356
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 3 place count 804 transition count 1353
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 9 place count 801 transition count 1353
Applied a total of 9 rules in 47 ms. Remains 801 /806 variables (removed 5) and now considering 1353/1357 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/806 places, 1353/1357 transitions.
// Phase 1: matrix 1353 rows 801 cols
[2021-05-07 19:09:21] [INFO ] Computed 140 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 11949 resets, run finished after 3313 ms. (steps per millisecond=301 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2320 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2319 resets, run finished after 1260 ms. (steps per millisecond=793 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2322 resets, run finished after 1251 ms. (steps per millisecond=799 ) properties (out of 3) seen :0
// Phase 1: matrix 1353 rows 801 cols
[2021-05-07 19:09:28] [INFO ] Computed 140 place invariants in 24 ms
[2021-05-07 19:09:28] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2021-05-07 19:09:28] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 20 ms returned sat
[2021-05-07 19:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:28] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2021-05-07 19:09:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:28] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 20 ms returned sat
[2021-05-07 19:09:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:29] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-07 19:09:29] [INFO ] Computed and/alt/rep : 547/2192/547 causal constraints (skipped 777 transitions) in 69 ms.
[2021-05-07 19:09:31] [INFO ] Added : 157 causal constraints over 32 iterations in 2487 ms. Result :sat
Minimization took 467 ms.
[2021-05-07 19:09:32] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2021-05-07 19:09:32] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 22 ms returned sat
[2021-05-07 19:09:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:32] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2021-05-07 19:09:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:32] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 18 ms returned sat
[2021-05-07 19:09:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:33] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-07 19:09:33] [INFO ] Computed and/alt/rep : 547/2192/547 causal constraints (skipped 777 transitions) in 67 ms.
[2021-05-07 19:09:35] [INFO ] Added : 101 causal constraints over 21 iterations in 1863 ms. Result :sat
Minimization took 361 ms.
[2021-05-07 19:09:35] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:35] [INFO ] [Real]Absence check using 36 positive and 104 generalized place invariants in 19 ms returned sat
[2021-05-07 19:09:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:36] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-07 19:09:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2021-05-07 19:09:36] [INFO ] [Nat]Absence check using 36 positive and 104 generalized place invariants in 20 ms returned sat
[2021-05-07 19:09:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:37] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2021-05-07 19:09:37] [INFO ] Computed and/alt/rep : 547/2192/547 causal constraints (skipped 777 transitions) in 73 ms.
[2021-05-07 19:09:42] [INFO ] Added : 395 causal constraints over 79 iterations in 5313 ms. Result :sat
Minimization took 538 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 292800 steps, including 4101 resets, run finished after 1019 ms. (steps per millisecond=287 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 298500 steps, including 4106 resets, run finished after 1040 ms. (steps per millisecond=287 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 238400 steps, including 1002 resets, run finished after 679 ms. (steps per millisecond=351 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 801 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 801/801 places, 1353/1353 transitions.
Applied a total of 0 rules in 25 ms. Remains 801 /801 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 801/801 places, 1353/1353 transitions.
Starting structural reductions, iteration 0 : 801/801 places, 1353/1353 transitions.
Applied a total of 0 rules in 24 ms. Remains 801 /801 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
// Phase 1: matrix 1353 rows 801 cols
[2021-05-07 19:09:46] [INFO ] Computed 140 place invariants in 19 ms
[2021-05-07 19:09:46] [INFO ] Implicit Places using invariants in 641 ms returned [1, 19, 20, 32, 49, 67, 136, 140, 149, 150, 170, 188, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 635, 646, 647, 648, 666, 668, 672, 690, 691, 692, 693, 705, 711, 717, 723, 729, 735, 741, 747, 753, 759, 765]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 645 ms to find 61 implicit places.
[2021-05-07 19:09:46] [INFO ] Redundant transitions in 103 ms returned []
// Phase 1: matrix 1353 rows 740 cols
[2021-05-07 19:09:46] [INFO ] Computed 79 place invariants in 13 ms
[2021-05-07 19:09:47] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Starting structural reductions, iteration 1 : 740/801 places, 1353/1353 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 740 transition count 1250
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 209 place count 637 transition count 1247
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 209 place count 637 transition count 1220
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 264 place count 609 transition count 1220
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 276 place count 605 transition count 1212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 284 place count 597 transition count 1212
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 300 place count 581 transition count 1196
Iterating global reduction 4 with 16 rules applied. Total rules applied 316 place count 581 transition count 1196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 319 place count 581 transition count 1193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 319 place count 581 transition count 1192
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 321 place count 580 transition count 1192
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 325 place count 576 transition count 1185
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 576 transition count 1185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 331 place count 574 transition count 1183
Iterating global reduction 5 with 2 rules applied. Total rules applied 333 place count 574 transition count 1183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 334 place count 574 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 335 place count 573 transition count 1180
Iterating global reduction 6 with 1 rules applied. Total rules applied 336 place count 573 transition count 1180
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 418 place count 532 transition count 1139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 419 place count 532 transition count 1138
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 423 place count 528 transition count 1134
Iterating global reduction 7 with 4 rules applied. Total rules applied 427 place count 528 transition count 1134
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 431 place count 528 transition count 1130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 435 place count 526 transition count 1131
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 436 place count 526 transition count 1130
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 446 place count 526 transition count 1120
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 457 place count 515 transition count 1120
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 473 place count 515 transition count 1120
Applied a total of 473 rules in 189 ms. Remains 515 /740 variables (removed 225) and now considering 1120/1353 (removed 233) transitions.
// Phase 1: matrix 1120 rows 515 cols
[2021-05-07 19:09:47] [INFO ] Computed 73 place invariants in 11 ms
[2021-05-07 19:09:48] [INFO ] Implicit Places using invariants in 432 ms returned [73, 90, 96, 99, 101, 104, 105, 161, 182, 188, 191, 193, 198, 199, 251, 268, 274, 277, 279, 284, 285, 337, 354, 360, 363, 365, 370, 371, 423, 440, 446, 449, 451]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 435 ms to find 33 implicit places.
Starting structural reductions, iteration 2 : 482/801 places, 1120/1353 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 466 transition count 1104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 466 transition count 1104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 461 transition count 1099
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 461 transition count 1099
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 60 place count 452 transition count 1090
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 75 place count 452 transition count 1075
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 90 place count 437 transition count 1075
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 437 transition count 1071
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 433 transition count 1071
Applied a total of 98 rules in 87 ms. Remains 433 /482 variables (removed 49) and now considering 1071/1120 (removed 49) transitions.
// Phase 1: matrix 1071 rows 433 cols
[2021-05-07 19:09:48] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-07 19:09:48] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 1071 rows 433 cols
[2021-05-07 19:09:48] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-07 19:09:49] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 433/801 places, 1071/1353 transitions.
Successfully produced net in file /tmp/petri1000_5975517185034483887.dot
Successfully produced net in file /tmp/petri1001_6459965326135389807.dot
Successfully produced net in file /tmp/petri1002_13130355328068529161.dot
Successfully produced net in file /tmp/petri1003_17654531658844400901.dot
Successfully produced net in file /tmp/petri1004_14168779261607540627.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1066 rows 433 cols
[2021-05-07 19:09:49] [INFO ] Computed 40 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 18551 resets, run finished after 2663 ms. (steps per millisecond=375 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4436 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4440 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4428 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 3) seen :0
// Phase 1: matrix 1066 rows 433 cols
[2021-05-07 19:09:54] [INFO ] Computed 40 place invariants in 9 ms
[2021-05-07 19:09:54] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-07 19:09:54] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:54] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2021-05-07 19:09:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-07 19:09:54] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:55] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2021-05-07 19:09:55] [INFO ] Computed and/alt/rep : 255/1303/255 causal constraints (skipped 782 transitions) in 53 ms.
[2021-05-07 19:09:56] [INFO ] Added : 55 causal constraints over 14 iterations in 1271 ms. Result :sat
Minimization took 293 ms.
[2021-05-07 19:09:56] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-07 19:09:56] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:56] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2021-05-07 19:09:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-07 19:09:57] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:57] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2021-05-07 19:09:57] [INFO ] Computed and/alt/rep : 255/1303/255 causal constraints (skipped 782 transitions) in 54 ms.
[2021-05-07 19:09:57] [INFO ] Added : 19 causal constraints over 4 iterations in 434 ms. Result :sat
Minimization took 321 ms.
[2021-05-07 19:09:58] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2021-05-07 19:09:58] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:58] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2021-05-07 19:09:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 19:09:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2021-05-07 19:09:58] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 7 ms returned sat
[2021-05-07 19:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 19:09:58] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2021-05-07 19:09:58] [INFO ] Computed and/alt/rep : 255/1303/255 causal constraints (skipped 782 transitions) in 53 ms.
[2021-05-07 19:10:00] [INFO ] Added : 71 causal constraints over 15 iterations in 1332 ms. Result :sat
Minimization took 242 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 170600 steps, including 3262 resets, run finished after 493 ms. (steps per millisecond=346 ) properties (out of 3) seen :3 could not realise parikh vector
FORMULA ASLink-PT-05b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620414601933

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05b"
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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05b, 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 r007-tall-162037989500085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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