Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r046-smll-165252115900178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DES-PT-20b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900178
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 7.2K Apr 29 15:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 15:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 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 91K 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 DES-PT-20b-UpperBounds-00
FORMULA_NAME DES-PT-20b-UpperBounds-01
FORMULA_NAME DES-PT-20b-UpperBounds-02
FORMULA_NAME DES-PT-20b-UpperBounds-03
FORMULA_NAME DES-PT-20b-UpperBounds-04
FORMULA_NAME DES-PT-20b-UpperBounds-05
FORMULA_NAME DES-PT-20b-UpperBounds-06
FORMULA_NAME DES-PT-20b-UpperBounds-07
FORMULA_NAME DES-PT-20b-UpperBounds-08
FORMULA_NAME DES-PT-20b-UpperBounds-09
FORMULA_NAME DES-PT-20b-UpperBounds-10
FORMULA_NAME DES-PT-20b-UpperBounds-11
FORMULA_NAME DES-PT-20b-UpperBounds-12
FORMULA_NAME DES-PT-20b-UpperBounds-13
FORMULA_NAME DES-PT-20b-UpperBounds-14
FORMULA_NAME DES-PT-20b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526331363

Running Version 0
[2022-05-14 11:05:34] [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-14 11:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:05:35] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2022-05-14 11:05:35] [INFO ] Transformed 360 places.
[2022-05-14 11:05:35] [INFO ] Transformed 311 transitions.
[2022-05-14 11:05:35] [INFO ] Found NUPN structural information;
[2022-05-14 11:05:35] [INFO ] Parsed PT model containing 360 places and 311 transitions in 266 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 311 rows 360 cols
[2022-05-14 11:05:35] [INFO ] Computed 65 place invariants in 54 ms
Incomplete random walk after 10000 steps, including 86 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :12
FORMULA DES-PT-20b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
// Phase 1: matrix 311 rows 360 cols
[2022-05-14 11:05:35] [INFO ] Computed 65 place invariants in 29 ms
[2022-05-14 11:05:36] [INFO ] [Real]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:05:36] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-14 11:05:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:36] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2022-05-14 11:05:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:05:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 34 ms returned sat
[2022-05-14 11:05:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 107 ms returned sat
[2022-05-14 11:05:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:37] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2022-05-14 11:05:37] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 5 ms to minimize.
[2022-05-14 11:05:37] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 2 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 4 ms to minimize.
[2022-05-14 11:05:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1313 ms
[2022-05-14 11:05:38] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 34 ms.
[2022-05-14 11:05:41] [INFO ] Added : 255 causal constraints over 51 iterations in 2810 ms. Result :sat
Minimization took 46 ms.
[2022-05-14 11:05:41] [INFO ] [Real]Absence check using 39 positive place invariants in 35 ms returned sat
[2022-05-14 11:05:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2022-05-14 11:05:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:41] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-14 11:05:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:05:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 34 ms returned sat
[2022-05-14 11:05:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 124 ms returned sat
[2022-05-14 11:05:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:42] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2022-05-14 11:05:42] [INFO ] Deduced a trap composed of 20 places in 221 ms of which 1 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 1 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 1 ms to minimize.
[2022-05-14 11:05:43] [INFO ] Deduced a trap composed of 51 places in 150 ms of which 1 ms to minimize.
[2022-05-14 11:05:44] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 1 ms to minimize.
[2022-05-14 11:05:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1469 ms
[2022-05-14 11:05:44] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 40 ms.
[2022-05-14 11:05:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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-14 11:05:47] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2022-05-14 11:05:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 31 ms returned sat
[2022-05-14 11:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:47] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2022-05-14 11:05:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:05:47] [INFO ] [Nat]Absence check using 39 positive place invariants in 34 ms returned sat
[2022-05-14 11:05:47] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 250 ms returned sat
[2022-05-14 11:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:48] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2022-05-14 11:05:48] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 1 ms to minimize.
[2022-05-14 11:05:48] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2022-05-14 11:05:49] [INFO ] Deduced a trap composed of 32 places in 145 ms of which 1 ms to minimize.
[2022-05-14 11:05:49] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 2 ms to minimize.
[2022-05-14 11:05:49] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 1 ms to minimize.
[2022-05-14 11:05:49] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 0 ms to minimize.
[2022-05-14 11:05:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1060 ms
[2022-05-14 11:05:49] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 37 ms.
[2022-05-14 11:05:52] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 2 ms to minimize.
[2022-05-14 11:05:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2022-05-14 11:05:52] [INFO ] Added : 242 causal constraints over 49 iterations in 2695 ms. Result :sat
Minimization took 152 ms.
[2022-05-14 11:05:52] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-14 11:05:52] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 25 ms returned sat
[2022-05-14 11:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:52] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-14 11:05:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:05:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 30 ms returned sat
[2022-05-14 11:05:53] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 26 ms returned sat
[2022-05-14 11:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:05:53] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-14 11:05:53] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2022-05-14 11:05:53] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2022-05-14 11:05:53] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 0 ms to minimize.
[2022-05-14 11:05:53] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 0 ms to minimize.
[2022-05-14 11:05:53] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2022-05-14 11:05:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2022-05-14 11:05:54] [INFO ] Computed and/alt/rep : 305/595/305 causal constraints (skipped 5 transitions) in 32 ms.
[2022-05-14 11:05:56] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2022-05-14 11:05:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-14 11:05:56] [INFO ] Added : 229 causal constraints over 46 iterations in 2975 ms. Result :sat
Minimization took 399 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 110400 steps, including 1295 resets, run finished after 305 ms. (steps per millisecond=361 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.4 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 349 transition count 283
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 328 transition count 283
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 328 transition count 274
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 319 transition count 274
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 300 transition count 255
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 300 transition count 255
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 300 transition count 254
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 299 transition count 254
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 284 transition count 239
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 284 transition count 239
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 284 transition count 224
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 282 transition count 223
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 282 transition count 220
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 279 transition count 220
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 202 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 200 transition count 145
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 200 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 199 transition count 144
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 199 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 198 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 197 transition count 143
Applied a total of 320 rules in 209 ms. Remains 197 /360 variables (removed 163) and now considering 143/311 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/360 places, 143/311 transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:05:57] [INFO ] Computed 60 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 47881 resets, run finished after 2965 ms. (steps per millisecond=337 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9181 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9084 resets, run finished after 984 ms. (steps per millisecond=1016 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9067 resets, run finished after 984 ms. (steps per millisecond=1016 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9158 resets, run finished after 1339 ms. (steps per millisecond=746 ) properties (out of 4) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:05] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:06:05] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:06:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2022-05-14 11:06:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:05] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-14 11:06:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:06:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2022-05-14 11:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:05] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2022-05-14 11:06:05] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 30 ms.
[2022-05-14 11:06:06] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2022-05-14 11:06:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2022-05-14 11:06:06] [INFO ] Added : 111 causal constraints over 23 iterations in 652 ms. Result :sat
Minimization took 86 ms.
[2022-05-14 11:06:06] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-14 11:06:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-05-14 11:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:06] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-05-14 11:06:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:06:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2022-05-14 11:06:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:07] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2022-05-14 11:06:07] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:06:07] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2022-05-14 11:06:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2022-05-14 11:06:07] [INFO ] Added : 118 causal constraints over 24 iterations in 616 ms. Result :sat
Minimization took 85 ms.
[2022-05-14 11:06:07] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:06:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2022-05-14 11:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:07] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-14 11:06:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:06:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2022-05-14 11:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:08] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2022-05-14 11:06:08] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 14 ms.
[2022-05-14 11:06:08] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2022-05-14 11:06:08] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2022-05-14 11:06:08] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2022-05-14 11:06:08] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2022-05-14 11:06:09] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-14 11:06:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 481 ms
[2022-05-14 11:06:09] [INFO ] Added : 105 causal constraints over 21 iterations in 907 ms. Result :sat
Minimization took 54 ms.
[2022-05-14 11:06:09] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:06:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2022-05-14 11:06:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:09] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-05-14 11:06:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-14 11:06:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 88 ms returned sat
[2022-05-14 11:06:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:09] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-14 11:06:09] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:06:09] [INFO ] Added : 67 causal constraints over 14 iterations in 298 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 93300 steps, including 5022 resets, run finished after 397 ms. (steps per millisecond=235 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 75900 steps, including 4289 resets, run finished after 296 ms. (steps per millisecond=256 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 81500 steps, including 4004 resets, run finished after 260 ms. (steps per millisecond=313 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 82700 steps, including 4777 resets, run finished after 184 ms. (steps per millisecond=449 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:11] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:06:11] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:11] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:06:11] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2022-05-14 11:06:11] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:11] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:06:11] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting property specific reduction for DES-PT-20b-UpperBounds-00
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:11] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 491 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:11] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:06:11] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:06:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-14 11:06:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:12] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-14 11:06:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-14 11:06:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2022-05-14 11:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:12] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-14 11:06:12] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:06:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2022-05-14 11:06:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2022-05-14 11:06:12] [INFO ] Added : 111 causal constraints over 23 iterations in 614 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 82700 steps, including 4747 resets, run finished after 313 ms. (steps per millisecond=264 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 12 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:13] [INFO ] Computed 60 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 47918 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9187 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:16] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:06:16] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:06:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-14 11:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:17] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-14 11:06:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:06:17] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2022-05-14 11:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:17] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-14 11:06:17] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 23 ms.
[2022-05-14 11:06:17] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2022-05-14 11:06:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-05-14 11:06:17] [INFO ] Added : 111 causal constraints over 23 iterations in 670 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 82700 steps, including 4728 resets, run finished after 316 ms. (steps per millisecond=261 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 14 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 13 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:18] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:06:18] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:18] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:06:19] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2022-05-14 11:06:19] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:19] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:19] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-00 in 7404 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-03
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:19] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 481 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:19] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-14 11:06:19] [INFO ] [Real]Absence check using 36 positive place invariants in 12 ms returned sat
[2022-05-14 11:06:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-14 11:06:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:19] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2022-05-14 11:06:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:06:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2022-05-14 11:06:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:19] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2022-05-14 11:06:19] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 18 ms.
[2022-05-14 11:06:20] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2022-05-14 11:06:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-05-14 11:06:20] [INFO ] Added : 118 causal constraints over 24 iterations in 599 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 81500 steps, including 3987 resets, run finished after 309 ms. (steps per millisecond=263 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 13 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:20] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47761 resets, run finished after 2069 ms. (steps per millisecond=483 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 8995 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:23] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:06:23] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:06:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-14 11:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:24] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-14 11:06:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:24] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-14 11:06:24] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2022-05-14 11:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:24] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-14 11:06:24] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 9 ms.
[2022-05-14 11:06:24] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2022-05-14 11:06:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-05-14 11:06:24] [INFO ] Added : 118 causal constraints over 24 iterations in 516 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 81500 steps, including 3947 resets, run finished after 179 ms. (steps per millisecond=455 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:25] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:06:25] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:25] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:25] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2022-05-14 11:06:25] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:25] [INFO ] Computed 60 place invariants in 1 ms
[2022-05-14 11:06:25] [INFO ] Dead Transitions using invariants and state equation in 152 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-03 in 6747 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-06
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:25] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 471 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:26] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:26] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:06:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2022-05-14 11:06:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:26] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2022-05-14 11:06:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2022-05-14 11:06:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2022-05-14 11:06:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:26] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-05-14 11:06:26] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 12 ms.
[2022-05-14 11:06:27] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-05-14 11:06:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2022-05-14 11:06:27] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2022-05-14 11:06:27] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2022-05-14 11:06:27] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-14 11:06:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 424 ms
[2022-05-14 11:06:27] [INFO ] Added : 105 causal constraints over 21 iterations in 900 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 75900 steps, including 4271 resets, run finished after 186 ms. (steps per millisecond=408 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 11 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:27] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47904 resets, run finished after 2505 ms. (steps per millisecond=399 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9136 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:31] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:06:31] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:06:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2022-05-14 11:06:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:31] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-05-14 11:06:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:06:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2022-05-14 11:06:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:31] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-14 11:06:31] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 12 ms.
[2022-05-14 11:06:32] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 0 ms to minimize.
[2022-05-14 11:06:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2022-05-14 11:06:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2022-05-14 11:06:32] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2022-05-14 11:06:32] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2022-05-14 11:06:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 462 ms
[2022-05-14 11:06:32] [INFO ] Added : 105 causal constraints over 21 iterations in 994 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 75900 steps, including 4288 resets, run finished after 171 ms. (steps per millisecond=443 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:33] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:33] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2022-05-14 11:06:33] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:34] [INFO ] Dead Transitions using invariants and state equation in 230 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-06 in 8033 ms.
Starting property specific reduction for DES-PT-20b-UpperBounds-10
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:34] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 439 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:34] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:34] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:06:34] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-05-14 11:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:34] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2022-05-14 11:06:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:06:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 89 ms returned sat
[2022-05-14 11:06:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:34] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2022-05-14 11:06:34] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 12 ms.
[2022-05-14 11:06:34] [INFO ] Added : 67 causal constraints over 14 iterations in 352 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 93300 steps, including 5062 resets, run finished after 332 ms. (steps per millisecond=281 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:35] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47625 resets, run finished after 2788 ms. (steps per millisecond=358 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9210 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties (out of 1) seen :0
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:39] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:06:39] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:06:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2022-05-14 11:06:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:39] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2022-05-14 11:06:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:06:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-05-14 11:06:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2022-05-14 11:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:06:40] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-05-14 11:06:40] [INFO ] Computed and/alt/rep : 129/263/129 causal constraints (skipped 11 transitions) in 16 ms.
[2022-05-14 11:06:40] [INFO ] Added : 67 causal constraints over 14 iterations in 392 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 93300 steps, including 5113 resets, run finished after 344 ms. (steps per millisecond=271 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 197 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Starting structural reductions, iteration 0 : 197/197 places, 143/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 197 /197 variables (removed 0) and now considering 143/143 (removed 0) transitions.
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:40] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:41] [INFO ] Implicit Places using invariants in 346 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:41] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:41] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 840 ms to find 0 implicit places.
[2022-05-14 11:06:41] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 143 rows 197 cols
[2022-05-14 11:06:41] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:06:41] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 197/197 places, 143/143 transitions.
Ending property specific reduction for DES-PT-20b-UpperBounds-10 in 7950 ms.
[2022-05-14 11:06:42] [INFO ] Flatten gal took : 122 ms
[2022-05-14 11:06:42] [INFO ] Applying decomposition
[2022-05-14 11:06:42] [INFO ] Flatten gal took : 49 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/graph14578132173647949122.txt, -o, /tmp/graph14578132173647949122.bin, -w, /tmp/graph14578132173647949122.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/graph14578132173647949122.bin, -l, -1, -v, -w, /tmp/graph14578132173647949122.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:06:42] [INFO ] Decomposing Gal with order
[2022-05-14 11:06:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:06:42] [INFO ] Removed a total of 45 redundant transitions.
[2022-05-14 11:06:42] [INFO ] Flatten gal took : 105 ms
[2022-05-14 11:06:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 18 ms.
[2022-05-14 11:06:43] [INFO ] Time to serialize gal into /tmp/UpperBounds8368835410295196220.gal : 16 ms
[2022-05-14 11:06:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15311215528290995819.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/UpperBounds8368835410295196220.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15311215528290995819.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/UpperBounds8368835410295196220.gal -t CGAL -reachable-file /tmp/UpperBounds15311215528290995819.prop --nowitness
Loading property file /tmp/UpperBounds15311215528290995819.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.63856e+12,17.4944,442436,69629,1887,1.33519e+06,6487,310,864706,207,35957,0
Total reachable state count : 9638559829248

Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-00 :0 <= u2.p77 <= 1
FORMULA DES-PT-20b-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-UpperBounds-00,0,18.6108,440356,1,0,1.33519e+06,16098,493,864706,267,48832,1903
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-03 :0 <= u48.p29 <= 1
FORMULA DES-PT-20b-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-UpperBounds-03,0,19.4659,440356,1,0,1.33519e+06,31070,535,864706,319,99983,3007
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-06 :0 <= u2.p79 <= 1
FORMULA DES-PT-20b-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-UpperBounds-06,0,19.4666,440356,1,0,1.33519e+06,31084,551,864706,348,100010,3035
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-20b-UpperBounds-10 :0 <= u12.p59 <= 1
FORMULA DES-PT-20b-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-UpperBounds-10,0,19.6041,440356,1,0,1.33519e+06,31142,579,864706,375,100494,3164

BK_STOP 1652526424078

--------------------
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="DES-PT-20b"
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 DES-PT-20b, 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 r046-smll-165252115900178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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