fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701500031
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ASLink-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11774.520 3600000.00 3670214.00 2470.30 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 '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701500031.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
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 r010-tajo-165245701500031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 6.7K Apr 30 07:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 07:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 07:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 07:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 795K May 10 09:33 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 1652727412817

Running Version 0
[2022-05-16 18:56:54] [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]
[2022-05-16 18:56:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 18:56:54] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2022-05-16 18:56:54] [INFO ] Transformed 2430 places.
[2022-05-16 18:56:54] [INFO ] Transformed 3040 transitions.
[2022-05-16 18:56:54] [INFO ] Found NUPN structural information;
[2022-05-16 18:56:54] [INFO ] Parsed PT model containing 2430 places and 3040 transitions in 225 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3040 rows 2430 cols
[2022-05-16 18:56:54] [INFO ] Computed 238 place invariants in 215 ms
Incomplete random walk after 10000 steps, including 17 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :9
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-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05b-UpperBounds-03 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 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 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 19 ms. (steps per millisecond=526 ) 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 3 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 3 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 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
// Phase 1: matrix 3040 rows 2430 cols
[2022-05-16 18:56:55] [INFO ] Computed 238 place invariants in 57 ms
[2022-05-16 18:56:55] [INFO ] [Real]Absence check using 56 positive place invariants in 56 ms returned sat
[2022-05-16 18:56:55] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 64 ms returned sat
[2022-05-16 18:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:56:57] [INFO ] [Real]Absence check using state equation in 1834 ms returned sat
[2022-05-16 18:56:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 56 positive place invariants in 61 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 73 ms returned sat
[2022-05-16 18:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:02] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
[2022-05-16 18:57:03] [INFO ] [Real]Absence check using 56 positive place invariants in 56 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 107 ms returned sat
[2022-05-16 18:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:04] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2022-05-16 18:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:05] [INFO ] [Nat]Absence check using 56 positive place invariants in 59 ms returned sat
[2022-05-16 18:57:05] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 58 ms returned sat
[2022-05-16 18:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:09] [INFO ] [Nat]Absence check using state equation in 4566 ms returned unknown
[2022-05-16 18:57:10] [INFO ] [Real]Absence check using 56 positive place invariants in 59 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 85 ms returned sat
[2022-05-16 18:57:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:11] [INFO ] [Real]Absence check using state equation in 1466 ms returned sat
[2022-05-16 18:57:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 59 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 81 ms returned sat
[2022-05-16 18:57:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:17] [INFO ] [Nat]Absence check using state equation in 4525 ms returned unknown
[2022-05-16 18:57:17] [INFO ] [Real]Absence check using 56 positive place invariants in 43 ms returned sat
[2022-05-16 18:57:17] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 111 ms returned sat
[2022-05-16 18:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:19] [INFO ] [Real]Absence check using state equation in 1524 ms returned sat
[2022-05-16 18:57:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2022-05-16 18:57:19] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 84 ms returned sat
[2022-05-16 18:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:24] [INFO ] [Nat]Absence check using state equation in 4443 ms returned unknown
[2022-05-16 18:57:24] [INFO ] [Real]Absence check using 56 positive place invariants in 90 ms returned sat
[2022-05-16 18:57:24] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 82 ms returned sat
[2022-05-16 18:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:26] [INFO ] [Real]Absence check using state equation in 1459 ms returned sat
[2022-05-16 18:57:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:26] [INFO ] [Nat]Absence check using 56 positive place invariants in 60 ms returned sat
[2022-05-16 18:57:26] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 78 ms returned sat
[2022-05-16 18:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:31] [INFO ] [Nat]Absence check using state equation in 4504 ms returned unknown
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 56 positive place invariants in 42 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 60 ms returned sat
[2022-05-16 18:57:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:33] [INFO ] [Real]Absence check using state equation in 1655 ms returned sat
[2022-05-16 18:57:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:34] [INFO ] [Nat]Absence check using 56 positive place invariants in 58 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 83 ms returned sat
[2022-05-16 18:57:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:35] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2022-05-16 18:57:36] [INFO ] Deduced a trap composed of 42 places in 794 ms of which 4 ms to minimize.
[2022-05-16 18:57:37] [INFO ] Deduced a trap composed of 130 places in 666 ms of which 10 ms to minimize.
[2022-05-16 18:57:38] [INFO ] Deduced a trap composed of 93 places in 688 ms of which 2 ms to minimize.
[2022-05-16 18:57:39] [INFO ] Deduced a trap composed of 52 places in 936 ms of which 11 ms to minimize.
[2022-05-16 18:57:39] [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 5
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)
[2022-05-16 18:57:40] [INFO ] [Real]Absence check using 56 positive place invariants in 52 ms returned sat
[2022-05-16 18:57:40] [INFO ] [Real]Absence check using 56 positive and 182 generalized place invariants in 74 ms returned sat
[2022-05-16 18:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:42] [INFO ] [Real]Absence check using state equation in 1952 ms returned sat
[2022-05-16 18:57:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:57:42] [INFO ] [Nat]Absence check using 56 positive place invariants in 56 ms returned sat
[2022-05-16 18:57:42] [INFO ] [Nat]Absence check using 56 positive and 182 generalized place invariants in 74 ms returned sat
[2022-05-16 18:57:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:57:47] [INFO ] [Nat]Absence check using state equation in 4471 ms returned unknown
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 2430 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Drop transitions removed 561 transitions
Trivial Post-agglo rules discarded 561 transitions
Performed 561 trivial Post agglomeration. Transition count delta: 561
Iterating post reduction 0 with 561 rules applied. Total rules applied 561 place count 2430 transition count 2479
Reduce places removed 561 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 587 rules applied. Total rules applied 1148 place count 1869 transition count 2453
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1157 place count 1862 transition count 2451
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1159 place count 1860 transition count 2451
Performed 559 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 559 Pre rules applied. Total rules applied 1159 place count 1860 transition count 1892
Deduced a syphon composed of 559 places in 4 ms
Ensure Unique test removed 52 places
Reduce places removed 611 places and 0 transitions.
Iterating global reduction 4 with 1170 rules applied. Total rules applied 2329 place count 1249 transition count 1892
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 37 rules applied. Total rules applied 2366 place count 1244 transition count 1860
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 5 with 32 rules applied. Total rules applied 2398 place count 1212 transition count 1860
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2398 place count 1212 transition count 1841
Deduced a syphon composed of 19 places in 14 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 57 rules applied. Total rules applied 2455 place count 1174 transition count 1841
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2455 place count 1174 transition count 1822
Deduced a syphon composed of 19 places in 11 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2493 place count 1155 transition count 1822
Discarding 76 places :
Symmetric choice reduction at 6 with 76 rule applications. Total rules 2569 place count 1079 transition count 1746
Iterating global reduction 6 with 76 rules applied. Total rules applied 2645 place count 1079 transition count 1746
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2646 place count 1079 transition count 1745
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 2646 place count 1079 transition count 1719
Deduced a syphon composed of 26 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 53 rules applied. Total rules applied 2699 place count 1052 transition count 1719
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2699 place count 1052 transition count 1718
Deduced a syphon composed of 1 places in 16 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 2702 place count 1050 transition count 1718
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2708 place count 1044 transition count 1679
Iterating global reduction 7 with 6 rules applied. Total rules applied 2714 place count 1044 transition count 1679
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 2714 place count 1044 transition count 1675
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 2722 place count 1040 transition count 1675
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2723 place count 1039 transition count 1667
Iterating global reduction 7 with 1 rules applied. Total rules applied 2724 place count 1039 transition count 1667
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2725 place count 1038 transition count 1659
Iterating global reduction 7 with 1 rules applied. Total rules applied 2726 place count 1038 transition count 1659
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2727 place count 1037 transition count 1651
Iterating global reduction 7 with 1 rules applied. Total rules applied 2728 place count 1037 transition count 1651
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2729 place count 1036 transition count 1643
Iterating global reduction 7 with 1 rules applied. Total rules applied 2730 place count 1036 transition count 1643
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2731 place count 1035 transition count 1635
Iterating global reduction 7 with 1 rules applied. Total rules applied 2732 place count 1035 transition count 1635
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2733 place count 1034 transition count 1627
Iterating global reduction 7 with 1 rules applied. Total rules applied 2734 place count 1034 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2735 place count 1033 transition count 1619
Iterating global reduction 7 with 1 rules applied. Total rules applied 2736 place count 1033 transition count 1619
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2737 place count 1032 transition count 1611
Iterating global reduction 7 with 1 rules applied. Total rules applied 2738 place count 1032 transition count 1611
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2739 place count 1031 transition count 1603
Iterating global reduction 7 with 1 rules applied. Total rules applied 2740 place count 1031 transition count 1603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2741 place count 1030 transition count 1595
Iterating global reduction 7 with 1 rules applied. Total rules applied 2742 place count 1030 transition count 1595
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2743 place count 1029 transition count 1587
Iterating global reduction 7 with 1 rules applied. Total rules applied 2744 place count 1029 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2745 place count 1028 transition count 1579
Iterating global reduction 7 with 1 rules applied. Total rules applied 2746 place count 1028 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2747 place count 1027 transition count 1571
Iterating global reduction 7 with 1 rules applied. Total rules applied 2748 place count 1027 transition count 1571
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2749 place count 1026 transition count 1563
Iterating global reduction 7 with 1 rules applied. Total rules applied 2750 place count 1026 transition count 1563
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2751 place count 1025 transition count 1555
Iterating global reduction 7 with 1 rules applied. Total rules applied 2752 place count 1025 transition count 1555
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2753 place count 1024 transition count 1547
Iterating global reduction 7 with 1 rules applied. Total rules applied 2754 place count 1024 transition count 1547
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 7 with 283 rules applied. Total rules applied 3037 place count 882 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3038 place count 881 transition count 1405
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 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
Iterating global reduction 7 with 1 rules applied. Total rules applied 3042 place count 879 transition count 1404
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 3044 place count 879 transition count 1402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3045 place count 878 transition count 1402
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 3047 place count 877 transition count 1411
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 3053 place count 877 transition count 1405
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 3059 place count 871 transition count 1405
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3065 place count 871 transition count 1399
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3071 place count 865 transition count 1399
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3072 place count 864 transition count 1398
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 15 rules applied. Total rules applied 3087 place count 854 transition count 1393
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 3092 place count 849 transition count 1393
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 14 Pre rules applied. Total rules applied 3092 place count 849 transition count 1379
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 13 with 29 rules applied. Total rules applied 3121 place count 834 transition count 1379
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 13 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 14 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 14 with 2 rules applied. Total rules applied 3129 place count 827 transition count 1378
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 14 with 22 rules applied. Total rules applied 3151 place count 816 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 14 with 4 rule applications. Total rules 3155 place count 812 transition count 1363
Iterating global reduction 14 with 4 rules applied. Total rules applied 3159 place count 812 transition count 1363
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 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 14 with 5 rules applied. Total rules applied 3169 place count 807 transition count 1358
Applied a total of 3169 rules in 1811 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
[2022-05-16 18:57:49] [INFO ] Computed 141 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 12044 resets, run finished after 2686 ms. (steps per millisecond=372 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2296 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2281 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2309 resets, run finished after 1614 ms. (steps per millisecond=619 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2306 resets, run finished after 1315 ms. (steps per millisecond=760 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2290 resets, run finished after 1262 ms. (steps per millisecond=792 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 1330 ms. (steps per millisecond=751 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2318 resets, run finished after 1382 ms. (steps per millisecond=723 ) properties (out of 7) seen :1
FORMULA ASLink-PT-05b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 1358 rows 807 cols
[2022-05-16 18:58:00] [INFO ] Computed 141 place invariants in 29 ms
[2022-05-16 18:58:01] [INFO ] [Real]Absence check using 35 positive place invariants in 134 ms returned sat
[2022-05-16 18:58:01] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 30 ms returned sat
[2022-05-16 18:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:01] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2022-05-16 18:58:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-16 18:58:01] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:02] [INFO ] [Nat]Absence check using state equation in 980 ms returned sat
[2022-05-16 18:58:03] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 159 ms.
[2022-05-16 18:58:12] [INFO ] Added : 80 causal constraints over 16 iterations in 9729 ms. Result :unknown
[2022-05-16 18:58:12] [INFO ] [Real]Absence check using 35 positive place invariants in 26 ms returned sat
[2022-05-16 18:58:12] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 25 ms returned sat
[2022-05-16 18:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:13] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-05-16 18:58:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:13] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2022-05-16 18:58:14] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 111 ms.
[2022-05-16 18:58:18] [INFO ] Added : 115 causal constraints over 23 iterations in 4129 ms. Result :sat
Minimization took 471 ms.
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 35 positive place invariants in 28 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 50 ms returned sat
[2022-05-16 18:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:19] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2022-05-16 18:58:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:19] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:58:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:20] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2022-05-16 18:58:20] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 114 ms.
[2022-05-16 18:58:29] [INFO ] Added : 281 causal constraints over 57 iterations in 9217 ms. Result :sat
Minimization took 555 ms.
[2022-05-16 18:58:30] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:30] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:58:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:30] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2022-05-16 18:58:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-16 18:58:31] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 25 ms returned sat
[2022-05-16 18:58:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:31] [INFO ] [Nat]Absence check using state equation in 537 ms returned sat
[2022-05-16 18:58:31] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 81 ms.
[2022-05-16 18:58:36] [INFO ] Added : 168 causal constraints over 34 iterations in 4844 ms. Result :sat
Minimization took 835 ms.
[2022-05-16 18:58:37] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:37] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 25 ms returned sat
[2022-05-16 18:58:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:38] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-05-16 18:58:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 22 ms returned sat
[2022-05-16 18:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:38] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2022-05-16 18:58:38] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 102 ms.
[2022-05-16 18:58:43] [INFO ] Added : 167 causal constraints over 34 iterations in 5267 ms. Result :sat
Minimization took 687 ms.
[2022-05-16 18:58:44] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:58:44] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 27 ms returned sat
[2022-05-16 18:58:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:45] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2022-05-16 18:58:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:58:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-16 18:58:45] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 30 ms returned sat
[2022-05-16 18:58:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:58:46] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2022-05-16 18:58:46] [INFO ] Computed and/alt/rep : 549/2197/549 causal constraints (skipped 780 transitions) in 85 ms.
[2022-05-16 18:58:54] [INFO ] Deduced a trap composed of 139 places in 295 ms of which 2 ms to minimize.
[2022-05-16 18:58:54] [INFO ] Deduced a trap composed of 104 places in 154 ms of which 0 ms to minimize.
[2022-05-16 18:58:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 728 ms
[2022-05-16 18:58:55] [INFO ] Added : 348 causal constraints over 70 iterations in 8849 ms. Result :sat
Minimization took 511 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 112700 steps, including 1630 resets, run finished after 385 ms. (steps per millisecond=292 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 307400 steps, including 5020 resets, run finished after 900 ms. (steps per millisecond=341 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 187000 steps, including 3093 resets, run finished after 507 ms. (steps per millisecond=368 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 229500 steps, including 2329 resets, run finished after 592 ms. (steps per millisecond=387 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 155100 steps, including 2921 resets, run finished after 388 ms. (steps per millisecond=399 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 219700 steps, including 2251 resets, run finished after 537 ms. (steps per millisecond=409 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 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 2 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
Applied a total of 2 rules in 41 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
[2022-05-16 18:58:59] [INFO ] Computed 141 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 12006 resets, run finished after 2530 ms. (steps per millisecond=395 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2298 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2308 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2279 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2297 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2297 resets, run finished after 1211 ms. (steps per millisecond=825 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2320 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 6) seen :0
// Phase 1: matrix 1357 rows 806 cols
[2022-05-16 18:59:08] [INFO ] Computed 141 place invariants in 41 ms
[2022-05-16 18:59:08] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-16 18:59:08] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:08] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2022-05-16 18:59:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:59:08] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:09] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-05-16 18:59:09] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 92 ms.
[2022-05-16 18:59:15] [INFO ] Added : 50 causal constraints over 10 iterations in 6522 ms. Result :sat
Minimization took 276 ms.
[2022-05-16 18:59:16] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-16 18:59:16] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:16] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-16 18:59:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:59:17] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:17] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2022-05-16 18:59:17] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 98 ms.
[2022-05-16 18:59:21] [INFO ] Added : 126 causal constraints over 26 iterations in 3446 ms. Result :sat
Minimization took 399 ms.
[2022-05-16 18:59:21] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-16 18:59:21] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:22] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2022-05-16 18:59:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:22] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2022-05-16 18:59:22] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 95 ms.
[2022-05-16 18:59:31] [INFO ] Added : 386 causal constraints over 78 iterations in 8800 ms. Result :sat
Minimization took 761 ms.
[2022-05-16 18:59:32] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:59:32] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 25 ms returned sat
[2022-05-16 18:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:33] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2022-05-16 18:59:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2022-05-16 18:59:33] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 25 ms returned sat
[2022-05-16 18:59:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:34] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2022-05-16 18:59:34] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 81 ms.
[2022-05-16 18:59:36] [INFO ] Added : 87 causal constraints over 18 iterations in 2412 ms. Result :sat
Minimization took 423 ms.
[2022-05-16 18:59:37] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-16 18:59:37] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:37] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2022-05-16 18:59:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-16 18:59:37] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:38] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2022-05-16 18:59:38] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 97 ms.
[2022-05-16 18:59:47] [INFO ] Added : 450 causal constraints over 90 iterations in 9420 ms. Result :sat
Minimization took 642 ms.
[2022-05-16 18:59:48] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-16 18:59:48] [INFO ] [Real]Absence check using 35 positive and 106 generalized place invariants in 23 ms returned sat
[2022-05-16 18:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:49] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-05-16 18:59:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 18:59:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-16 18:59:49] [INFO ] [Nat]Absence check using 35 positive and 106 generalized place invariants in 24 ms returned sat
[2022-05-16 18:59:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 18:59:49] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2022-05-16 18:59:50] [INFO ] Computed and/alt/rep : 548/2196/548 causal constraints (skipped 780 transitions) in 106 ms.
[2022-05-16 18:59:54] [INFO ] Added : 131 causal constraints over 27 iterations in 4621 ms. Result :sat
Minimization took 450 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 98200 steps, including 2495 resets, run finished after 298 ms. (steps per millisecond=329 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 301100 steps, including 4742 resets, run finished after 823 ms. (steps per millisecond=365 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 127800 steps, including 3527 resets, run finished after 317 ms. (steps per millisecond=403 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 201100 steps, including 1002 resets, run finished after 421 ms. (steps per millisecond=477 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 479800 steps, including 12568 resets, run finished after 1082 ms. (steps per millisecond=443 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 154200 steps, including 1954 resets, run finished after 324 ms. (steps per millisecond=475 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 806 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 806/806 places, 1357/1357 transitions.
Applied a total of 0 rules in 20 ms. Remains 806 /806 variables (removed 0) and now considering 1357/1357 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 806/806 places, 1357/1357 transitions.
Starting structural reductions, iteration 0 : 806/806 places, 1357/1357 transitions.
Applied a total of 0 rules in 20 ms. Remains 806 /806 variables (removed 0) and now considering 1357/1357 (removed 0) transitions.
// Phase 1: matrix 1357 rows 806 cols
[2022-05-16 18:59:58] [INFO ] Computed 141 place invariants in 38 ms
[2022-05-16 18:59:59] [INFO ] Implicit Places using invariants in 527 ms returned [1, 18, 19, 31, 48, 66, 136, 140, 149, 150, 152, 169, 187, 257, 261, 262, 273, 274, 276, 293, 311, 350, 390, 391, 402, 403, 405, 422, 440, 509, 513, 514, 525, 526, 528, 545, 563, 632, 636, 637, 640, 651, 652, 653, 671, 673, 677, 695, 696, 697, 698, 710, 716, 722, 728, 734, 740, 746, 752, 758, 764, 770]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 531 ms to find 62 implicit places.
[2022-05-16 18:59:59] [INFO ] Redundant transitions in 111 ms returned []
// Phase 1: matrix 1357 rows 744 cols
[2022-05-16 18:59:59] [INFO ] Computed 79 place invariants in 16 ms
[2022-05-16 18:59:59] [INFO ] Dead Transitions using invariants and state equation in 573 ms returned []
Starting structural reductions, iteration 1 : 744/806 places, 1357/1357 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 744 transition count 1247
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 225 place count 634 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 633 transition count 1242
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 226 place count 633 transition count 1215
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 3 with 55 rules applied. Total rules applied 281 place count 605 transition count 1215
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 293 place count 601 transition count 1207
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 301 place count 593 transition count 1207
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 316 place count 578 transition count 1192
Iterating global reduction 5 with 15 rules applied. Total rules applied 331 place count 578 transition count 1192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 334 place count 578 transition count 1189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 334 place count 578 transition count 1188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 336 place count 577 transition count 1188
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 339 place count 574 transition count 1182
Iterating global reduction 6 with 3 rules applied. Total rules applied 342 place count 574 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 343 place count 573 transition count 1181
Iterating global reduction 6 with 1 rules applied. Total rules applied 344 place count 573 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 345 place count 572 transition count 1179
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 572 transition count 1179
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 424 place count 533 transition count 1140
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 428 place count 529 transition count 1136
Iterating global reduction 6 with 4 rules applied. Total rules applied 432 place count 529 transition count 1136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 436 place count 529 transition count 1132
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 7 with 4 rules applied. Total rules applied 440 place count 527 transition count 1133
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 451 place count 527 transition count 1122
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 463 place count 515 transition count 1122
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 480 place count 515 transition count 1122
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 481 place count 515 transition count 1121
Applied a total of 481 rules in 167 ms. Remains 515 /744 variables (removed 229) and now considering 1121/1357 (removed 236) transitions.
// Phase 1: matrix 1121 rows 515 cols
[2022-05-16 18:59:59] [INFO ] Computed 73 place invariants in 15 ms
[2022-05-16 19:00:00] [INFO ] Implicit Places using invariants in 282 ms returned [73, 90, 96, 99, 101, 104, 105, 158, 175, 181, 184, 186, 191, 192, 265, 271, 274, 276, 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 285 ms to find 33 implicit places.
Starting structural reductions, iteration 2 : 482/806 places, 1121/1357 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 467 transition count 1106
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 467 transition count 1106
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 462 transition count 1101
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 462 transition count 1101
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 58 place count 453 transition count 1092
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 73 place count 453 transition count 1077
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 88 place count 438 transition count 1077
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 438 transition count 1073
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 96 place count 434 transition count 1073
Applied a total of 96 rules in 70 ms. Remains 434 /482 variables (removed 48) and now considering 1073/1121 (removed 48) transitions.
// Phase 1: matrix 1073 rows 434 cols
[2022-05-16 19:00:00] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-16 19:00:00] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 1073 rows 434 cols
[2022-05-16 19:00:00] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-16 19:00:01] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1132 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 434/806 places, 1073/1357 transitions.
Successfully produced net in file /tmp/petri1000_14451310289756694129.dot
Successfully produced net in file /tmp/petri1001_3858574886646510841.dot
Successfully produced net in file /tmp/petri1002_17681920521274568358.dot
Successfully produced net in file /tmp/petri1003_16390339113527833657.dot
Successfully produced net in file /tmp/petri1004_12146923240938647874.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1068 rows 434 cols
[2022-05-16 19:00:01] [INFO ] Computed 40 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 18542 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4409 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4468 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4469 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4475 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4526 resets, run finished after 697 ms. (steps per millisecond=1434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4558 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 6) seen :0
// Phase 1: matrix 1068 rows 434 cols
[2022-05-16 19:00:07] [INFO ] Computed 40 place invariants in 8 ms
[2022-05-16 19:00:07] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-16 19:00:07] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-16 19:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:07] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-05-16 19:00:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-16 19:00:07] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 8 ms returned sat
[2022-05-16 19:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:07] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2022-05-16 19:00:08] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 55 ms.
[2022-05-16 19:00:08] [INFO ] Added : 16 causal constraints over 4 iterations in 247 ms. Result :sat
Minimization took 103 ms.
[2022-05-16 19:00:08] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:08] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 16 ms returned sat
[2022-05-16 19:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:08] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-05-16 19:00:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-16 19:00:08] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 12 ms returned sat
[2022-05-16 19:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:09] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2022-05-16 19:00:09] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 87 ms.
[2022-05-16 19:00:09] [INFO ] Added : 22 causal constraints over 5 iterations in 606 ms. Result :sat
Minimization took 280 ms.
[2022-05-16 19:00:10] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:10] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 10 ms returned sat
[2022-05-16 19:00:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:10] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-16 19:00:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:10] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:10] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 10 ms returned sat
[2022-05-16 19:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:11] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-16 19:00:11] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 61 ms.
[2022-05-16 19:00:11] [INFO ] Added : 24 causal constraints over 5 iterations in 679 ms. Result :sat
Minimization took 177 ms.
[2022-05-16 19:00:12] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-16 19:00:12] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 11 ms returned sat
[2022-05-16 19:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:12] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-05-16 19:00:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-16 19:00:12] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 16 ms returned sat
[2022-05-16 19:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:12] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2022-05-16 19:00:13] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 75 ms.
[2022-05-16 19:00:13] [INFO ] Added : 40 causal constraints over 8 iterations in 682 ms. Result :sat
Minimization took 123 ms.
[2022-05-16 19:00:13] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:13] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 10 ms returned sat
[2022-05-16 19:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:14] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2022-05-16 19:00:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:14] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 9 ms returned sat
[2022-05-16 19:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:14] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2022-05-16 19:00:15] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 82 ms.
[2022-05-16 19:00:18] [INFO ] Added : 92 causal constraints over 19 iterations in 3176 ms. Result :sat
Minimization took 370 ms.
[2022-05-16 19:00:18] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2022-05-16 19:00:18] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 17 ms returned sat
[2022-05-16 19:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:18] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-16 19:00:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2022-05-16 19:00:19] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 8 ms returned sat
[2022-05-16 19:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:19] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2022-05-16 19:00:19] [INFO ] Computed and/alt/rep : 251/1248/251 causal constraints (skipped 788 transitions) in 89 ms.
[2022-05-16 19:00:20] [INFO ] Added : 27 causal constraints over 6 iterations in 671 ms. Result :sat
Minimization took 440 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 79600 steps, including 1003 resets, run finished after 197 ms. (steps per millisecond=404 ) properties (out of 6) seen :1 could not realise parikh vector
FORMULA ASLink-PT-05b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 121600 steps, including 3279 resets, run finished after 337 ms. (steps per millisecond=360 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 95100 steps, including 2508 resets, run finished after 255 ms. (steps per millisecond=372 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 95400 steps, including 2927 resets, run finished after 204 ms. (steps per millisecond=467 ) properties (out of 5) seen :4 could not realise parikh vector
FORMULA ASLink-PT-05b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-05b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 59800 steps, including 1003 resets, run finished after 95 ms. (steps per millisecond=629 ) properties (out of 1) seen :0 could not realise parikh vector
Incomplete Parikh walk after 63000 steps, including 2680 resets, run finished after 127 ms. (steps per millisecond=496 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 434/434 places, 1068/1068 transitions.
Graph (complete) has 2622 edges and 434 vertex of which 429 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 429 transition count 1067
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 428 transition count 1067
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 428 transition count 1064
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 425 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 424 transition count 1063
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 424 transition count 1063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 424 transition count 1062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 423 transition count 1061
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 19 place count 423 transition count 1061
Applied a total of 19 rules in 69 ms. Remains 423 /434 variables (removed 11) and now considering 1061/1068 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/434 places, 1061/1068 transitions.
// Phase 1: matrix 1061 rows 423 cols
[2022-05-16 19:00:21] [INFO ] Computed 40 place invariants in 16 ms
Incomplete random walk after 1000000 steps, including 18328 resets, run finished after 2202 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4469 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 1) seen :0
// Phase 1: matrix 1061 rows 423 cols
[2022-05-16 19:00:24] [INFO ] Computed 40 place invariants in 22 ms
[2022-05-16 19:00:25] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-16 19:00:25] [INFO ] [Real]Absence check using 12 positive and 28 generalized place invariants in 8 ms returned sat
[2022-05-16 19:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:25] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-16 19:00:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-05-16 19:00:25] [INFO ] [Nat]Absence check using 12 positive and 28 generalized place invariants in 8 ms returned sat
[2022-05-16 19:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:25] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-05-16 19:00:25] [INFO ] Computed and/alt/rep : 235/1126/235 causal constraints (skipped 797 transitions) in 99 ms.
[2022-05-16 19:00:27] [INFO ] Added : 49 causal constraints over 11 iterations in 1274 ms. Result :sat
Minimization took 232 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 42700 steps, including 1003 resets, run finished after 91 ms. (steps per millisecond=469 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1061/1061 transitions.
Applied a total of 0 rules in 16 ms. Remains 423 /423 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 423/423 places, 1061/1061 transitions.
Starting structural reductions, iteration 0 : 423/423 places, 1061/1061 transitions.
Applied a total of 0 rules in 15 ms. Remains 423 /423 variables (removed 0) and now considering 1061/1061 (removed 0) transitions.
// Phase 1: matrix 1061 rows 423 cols
[2022-05-16 19:00:27] [INFO ] Computed 40 place invariants in 20 ms
[2022-05-16 19:00:27] [INFO ] Implicit Places using invariants in 295 ms returned [206]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
[2022-05-16 19:00:27] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 1061 rows 422 cols
[2022-05-16 19:00:27] [INFO ] Computed 39 place invariants in 16 ms
[2022-05-16 19:00:28] [INFO ] Dead Transitions using invariants and state equation in 443 ms returned []
Starting structural reductions, iteration 1 : 422/423 places, 1061/1061 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 421 transition count 1060
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 421 transition count 1059
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 420 transition count 1059
Applied a total of 4 rules in 36 ms. Remains 420 /422 variables (removed 2) and now considering 1059/1061 (removed 2) transitions.
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:28] [INFO ] Computed 39 place invariants in 13 ms
[2022-05-16 19:00:28] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:28] [INFO ] Computed 39 place invariants in 10 ms
[2022-05-16 19:00:29] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 420/423 places, 1059/1061 transitions.
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:29] [INFO ] Computed 39 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 18541 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4510 resets, run finished after 722 ms. (steps per millisecond=1385 ) properties (out of 1) seen :0
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:32] [INFO ] Computed 39 place invariants in 23 ms
[2022-05-16 19:00:32] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:32] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-16 19:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:32] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-05-16 19:00:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:32] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 16 ms returned sat
[2022-05-16 19:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:33] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2022-05-16 19:00:33] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 1 ms to minimize.
[2022-05-16 19:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2022-05-16 19:00:33] [INFO ] Computed and/alt/rep : 226/1053/226 causal constraints (skipped 804 transitions) in 67 ms.
[2022-05-16 19:00:34] [INFO ] Added : 55 causal constraints over 12 iterations in 1112 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 88200 steps, including 1601 resets, run finished after 193 ms. (steps per millisecond=456 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 16 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1059/1059 transitions.
Starting structural reductions, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 16 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:35] [INFO ] Computed 39 place invariants in 20 ms
[2022-05-16 19:00:35] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:35] [INFO ] Computed 39 place invariants in 11 ms
[2022-05-16 19:00:36] [INFO ] Implicit Places using invariants and state equation in 782 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
[2022-05-16 19:00:36] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:36] [INFO ] Computed 39 place invariants in 7 ms
[2022-05-16 19:00:36] [INFO ] Dead Transitions using invariants and state equation in 398 ms returned []
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1059/1059 transitions.
Starting property specific reduction for ASLink-PT-05b-UpperBounds-11
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:36] [INFO ] Computed 39 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 179 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:36] [INFO ] Computed 39 place invariants in 10 ms
[2022-05-16 19:00:36] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 19:00:36] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 19:00:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:37] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-05-16 19:00:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2022-05-16 19:00:37] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 19:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:37] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2022-05-16 19:00:37] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2022-05-16 19:00:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2022-05-16 19:00:37] [INFO ] Computed and/alt/rep : 226/1053/226 causal constraints (skipped 804 transitions) in 74 ms.
[2022-05-16 19:00:38] [INFO ] Added : 55 causal constraints over 12 iterations in 815 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 88200 steps, including 1604 resets, run finished after 217 ms. (steps per millisecond=406 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 19 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1059/1059 transitions.
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:39] [INFO ] Computed 39 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 18413 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4487 resets, run finished after 811 ms. (steps per millisecond=1233 ) properties (out of 1) seen :0
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:42] [INFO ] Computed 39 place invariants in 22 ms
[2022-05-16 19:00:42] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 19:00:42] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 11 ms returned sat
[2022-05-16 19:00:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:42] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-16 19:00:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:00:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 19:00:42] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 13 ms returned sat
[2022-05-16 19:00:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:00:43] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2022-05-16 19:00:43] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 1 ms to minimize.
[2022-05-16 19:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2022-05-16 19:00:43] [INFO ] Computed and/alt/rep : 226/1053/226 causal constraints (skipped 804 transitions) in 51 ms.
[2022-05-16 19:00:44] [INFO ] Added : 55 causal constraints over 12 iterations in 951 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 88200 steps, including 1614 resets, run finished after 258 ms. (steps per millisecond=341 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 30 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1059/1059 transitions.
Starting structural reductions, iteration 0 : 420/420 places, 1059/1059 transitions.
Applied a total of 0 rules in 26 ms. Remains 420 /420 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:45] [INFO ] Computed 39 place invariants in 16 ms
[2022-05-16 19:00:45] [INFO ] Implicit Places using invariants in 283 ms returned []
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:45] [INFO ] Computed 39 place invariants in 10 ms
[2022-05-16 19:00:46] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2022-05-16 19:00:46] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1059 rows 420 cols
[2022-05-16 19:00:46] [INFO ] Computed 39 place invariants in 20 ms
[2022-05-16 19:00:46] [INFO ] Dead Transitions using invariants and state equation in 335 ms returned []
Finished structural reductions, in 1 iterations. Remains : 420/420 places, 1059/1059 transitions.
Ending property specific reduction for ASLink-PT-05b-UpperBounds-11 in 9858 ms.
[2022-05-16 19:00:46] [INFO ] Flatten gal took : 135 ms
[2022-05-16 19:00:46] [INFO ] Applying decomposition
[2022-05-16 19:00:47] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16935948305561863477.txt, -o, /tmp/graph16935948305561863477.bin, -w, /tmp/graph16935948305561863477.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16935948305561863477.bin, -l, -1, -v, -w, /tmp/graph16935948305561863477.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 19:00:47] [INFO ] Decomposing Gal with order
[2022-05-16 19:00:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:00:47] [INFO ] Removed a total of 2075 redundant transitions.
[2022-05-16 19:00:47] [INFO ] Flatten gal took : 155 ms
[2022-05-16 19:00:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 21 ms.
[2022-05-16 19:00:47] [INFO ] Time to serialize gal into /tmp/UpperBounds5831277708311516894.gal : 14 ms
[2022-05-16 19:00:47] [INFO ] Time to serialize properties into /tmp/UpperBounds13821965410277088768.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5831277708311516894.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13821965410277088768.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5831277708311516894.gal -t CGAL -reachable-file /tmp/UpperBounds13821965410277088768.prop --nowitness
Loading property file /tmp/UpperBounds13821965410277088768.prop.
Detected timeout of ITS tools.
[2022-05-16 19:22:04] [INFO ] Applying decomposition
[2022-05-16 19:22:04] [INFO ] Flatten gal took : 112 ms
[2022-05-16 19:22:05] [INFO ] Decomposing Gal with order
[2022-05-16 19:22:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 19:22:05] [INFO ] Removed a total of 1998 redundant transitions.
[2022-05-16 19:22:05] [INFO ] Flatten gal took : 158 ms
[2022-05-16 19:22:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 820 labels/synchronizations in 23 ms.
[2022-05-16 19:22:05] [INFO ] Time to serialize gal into /tmp/UpperBounds14611636110324830824.gal : 5 ms
[2022-05-16 19:22:05] [INFO ] Time to serialize properties into /tmp/UpperBounds8635295744548788195.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14611636110324830824.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8635295744548788195.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14611636110324830824.gal -t CGAL -reachable-file /tmp/UpperBounds8635295744548788195.prop --nowitness
Loading property file /tmp/UpperBounds8635295744548788195.prop.
Detected timeout of ITS tools.
[2022-05-16 19:43:22] [INFO ] Flatten gal took : 76 ms
[2022-05-16 19:43:22] [INFO ] Input system was already deterministic with 1059 transitions.
[2022-05-16 19:43:22] [INFO ] Transformed 420 places.
[2022-05-16 19:43:22] [INFO ] Transformed 1059 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-16 19:43:22] [INFO ] Time to serialize gal into /tmp/UpperBounds17976385816714754376.gal : 16 ms
[2022-05-16 19:43:22] [INFO ] Time to serialize properties into /tmp/UpperBounds9479107255790964654.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds17976385816714754376.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9479107255790964654.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds17976385816714754376.gal -t CGAL -reachable-file /tmp/UpperBounds9479107255790964654.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds9479107255790964654.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="gold2021"
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 gold2021"
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 r010-tajo-165245701500031"
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 ;