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-165252115900184.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-30b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900184
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 5.2K Apr 29 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K 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 103K 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-30b-UpperBounds-00
FORMULA_NAME DES-PT-30b-UpperBounds-01
FORMULA_NAME DES-PT-30b-UpperBounds-02
FORMULA_NAME DES-PT-30b-UpperBounds-03
FORMULA_NAME DES-PT-30b-UpperBounds-04
FORMULA_NAME DES-PT-30b-UpperBounds-05
FORMULA_NAME DES-PT-30b-UpperBounds-06
FORMULA_NAME DES-PT-30b-UpperBounds-07
FORMULA_NAME DES-PT-30b-UpperBounds-08
FORMULA_NAME DES-PT-30b-UpperBounds-09
FORMULA_NAME DES-PT-30b-UpperBounds-10
FORMULA_NAME DES-PT-30b-UpperBounds-11
FORMULA_NAME DES-PT-30b-UpperBounds-12
FORMULA_NAME DES-PT-30b-UpperBounds-13
FORMULA_NAME DES-PT-30b-UpperBounds-14
FORMULA_NAME DES-PT-30b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652526471182

Running Version 0
[2022-05-14 11:07: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-14 11:07:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 11:07:54] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2022-05-14 11:07:54] [INFO ] Transformed 399 places.
[2022-05-14 11:07:54] [INFO ] Transformed 350 transitions.
[2022-05-14 11:07:54] [INFO ] Found NUPN structural information;
[2022-05-14 11:07:54] [INFO ] Parsed PT model containing 399 places and 350 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
// Phase 1: matrix 350 rows 399 cols
[2022-05-14 11:07:54] [INFO ] Computed 65 place invariants in 59 ms
Incomplete random walk after 10000 steps, including 90 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :12
FORMULA DES-PT-30b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 9 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
// Phase 1: matrix 350 rows 399 cols
[2022-05-14 11:07:55] [INFO ] Computed 65 place invariants in 16 ms
[2022-05-14 11:07:55] [INFO ] [Real]Absence check using 39 positive place invariants in 46 ms returned sat
[2022-05-14 11:07:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2022-05-14 11:07:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:07:55] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-05-14 11:07:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:07:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:07:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 438 ms returned sat
[2022-05-14 11:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:07:57] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2022-05-14 11:07:57] [INFO ] Deduced a trap composed of 13 places in 306 ms of which 5 ms to minimize.
[2022-05-14 11:07:58] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 1 ms to minimize.
[2022-05-14 11:07:58] [INFO ] Deduced a trap composed of 14 places in 243 ms of which 3 ms to minimize.
[2022-05-14 11:07:59] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 1 ms to minimize.
[2022-05-14 11:07:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1533 ms
[2022-05-14 11:07:59] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 59 ms.
[2022-05-14 11:08:01] [INFO ] Added : 185 causal constraints over 37 iterations in 1935 ms. Result :unknown
[2022-05-14 11:08:01] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2022-05-14 11:08:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2022-05-14 11:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:01] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-05-14 11:08:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:08:01] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 38 ms returned sat
[2022-05-14 11:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:02] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-14 11:08:02] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 1 ms to minimize.
[2022-05-14 11:08:02] [INFO ] Deduced a trap composed of 17 places in 142 ms of which 1 ms to minimize.
[2022-05-14 11:08:02] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2022-05-14 11:08:03] [INFO ] Deduced a trap composed of 8 places in 308 ms of which 2 ms to minimize.
[2022-05-14 11:08:03] [INFO ] Deduced a trap composed of 12 places in 184 ms of which 1 ms to minimize.
[2022-05-14 11:08:03] [INFO ] Deduced a trap composed of 21 places in 203 ms of which 1 ms to minimize.
[2022-05-14 11:08:03] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 1 ms to minimize.
[2022-05-14 11:08:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1570 ms
[2022-05-14 11:08:03] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 42 ms.
[2022-05-14 11:08:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:08:06] [INFO ] [Real]Absence check using 39 positive place invariants in 30 ms returned sat
[2022-05-14 11:08:06] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-14 11:08:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:07] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-14 11:08:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:07] [INFO ] [Nat]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-14 11:08:07] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 138 ms returned sat
[2022-05-14 11:08:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:07] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 0 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2022-05-14 11:08:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 595 ms
[2022-05-14 11:08:08] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 28 ms.
[2022-05-14 11:08:11] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 1 ms to minimize.
[2022-05-14 11:08:12] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 1 ms to minimize.
[2022-05-14 11:08:12] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 2 ms to minimize.
[2022-05-14 11:08:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
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:08:12] [INFO ] [Real]Absence check using 39 positive place invariants in 29 ms returned sat
[2022-05-14 11:08:12] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 28 ms returned sat
[2022-05-14 11:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:12] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2022-05-14 11:08:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:13] [INFO ] [Nat]Absence check using 39 positive place invariants in 37 ms returned sat
[2022-05-14 11:08:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 40 ms returned sat
[2022-05-14 11:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:13] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2022-05-14 11:08:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2022-05-14 11:08:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-14 11:08:13] [INFO ] Computed and/alt/rep : 344/703/344 causal constraints (skipped 5 transitions) in 43 ms.
[2022-05-14 11:08:17] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 1 ms to minimize.
[2022-05-14 11:08:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2022-05-14 11:08:18] [INFO ] Added : 337 causal constraints over 68 iterations in 4068 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 432400 steps, including 4362 resets, run finished after 1345 ms. (steps per millisecond=321 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA DES-PT-30b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 151800 steps, including 1523 resets, run finished after 317 ms. (steps per millisecond=478 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 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 388 transition count 322
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 367 transition count 322
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 367 transition count 313
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 358 transition count 313
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 339 transition count 294
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 339 transition count 294
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 339 transition count 293
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 338 transition count 293
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 323 transition count 278
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 323 transition count 278
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 323 transition count 263
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 321 transition count 262
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 321 transition count 259
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 318 transition count 259
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 241 transition count 182
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 239 transition count 184
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 239 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 238 transition count 183
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 238 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 237 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 236 transition count 182
Applied a total of 320 rules in 327 ms. Remains 236 /399 variables (removed 163) and now considering 182/350 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/399 places, 182/350 transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:20] [INFO ] Computed 60 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 47804 resets, run finished after 2911 ms. (steps per millisecond=343 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9093 resets, run finished after 1325 ms. (steps per millisecond=754 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9000 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9126 resets, run finished after 1157 ms. (steps per millisecond=864 ) properties (out of 3) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:26] [INFO ] Computed 60 place invariants in 9 ms
[2022-05-14 11:08:26] [INFO ] [Real]Absence check using 36 positive place invariants in 24 ms returned sat
[2022-05-14 11:08:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2022-05-14 11:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:26] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-14 11:08:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-14 11:08:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2022-05-14 11:08:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:27] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2022-05-14 11:08:27] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 15 ms.
[2022-05-14 11:08:27] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2022-05-14 11:08:28] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2022-05-14 11:08:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2022-05-14 11:08:28] [INFO ] Added : 111 causal constraints over 23 iterations in 932 ms. Result :sat
Minimization took 127 ms.
[2022-05-14 11:08:28] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:08:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2022-05-14 11:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:28] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2022-05-14 11:08:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:08:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 236 ms returned sat
[2022-05-14 11:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:29] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2022-05-14 11:08:29] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 28 ms.
[2022-05-14 11:08:29] [INFO ] Added : 131 causal constraints over 27 iterations in 874 ms. Result :sat
Minimization took 123 ms.
[2022-05-14 11:08:30] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:08:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2022-05-14 11:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:30] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-14 11:08:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:08:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 143 ms returned sat
[2022-05-14 11:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:30] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-14 11:08:30] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 20 ms.
[2022-05-14 11:08:31] [INFO ] Added : 111 causal constraints over 23 iterations in 540 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 122600 steps, including 6385 resets, run finished after 491 ms. (steps per millisecond=249 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 127300 steps, including 8574 resets, run finished after 380 ms. (steps per millisecond=335 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 74900 steps, including 4296 resets, run finished after 179 ms. (steps per millisecond=418 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 14 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 12 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:32] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-14 11:08:32] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:32] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-14 11:08:33] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2022-05-14 11:08:33] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:08:33] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting property specific reduction for DES-PT-30b-UpperBounds-05
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:33] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 454 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:33] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:08:33] [INFO ] [Real]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-14 11:08:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2022-05-14 11:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:33] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2022-05-14 11:08:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2022-05-14 11:08:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2022-05-14 11:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:34] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-05-14 11:08:34] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 26 ms.
[2022-05-14 11:08:35] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2022-05-14 11:08:35] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2022-05-14 11:08:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2022-05-14 11:08:35] [INFO ] Added : 111 causal constraints over 23 iterations in 964 ms. Result :sat
Minimization took 147 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 74900 steps, including 4296 resets, run finished after 245 ms. (steps per millisecond=305 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 15 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:35] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47721 resets, run finished after 2385 ms. (steps per millisecond=419 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9100 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:39] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:08:39] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:08:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-14 11:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:39] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-14 11:08:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-05-14 11:08:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2022-05-14 11:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:39] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2022-05-14 11:08:39] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 17 ms.
[2022-05-14 11:08:40] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2022-05-14 11:08:40] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2022-05-14 11:08:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2022-05-14 11:08:40] [INFO ] Added : 111 causal constraints over 23 iterations in 690 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 74900 steps, including 4306 resets, run finished after 165 ms. (steps per millisecond=453 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 11 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 10 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:40] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:08:41] [INFO ] Implicit Places using invariants in 327 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:41] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:08:41] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
[2022-05-14 11:08:41] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:41] [INFO ] Computed 60 place invariants in 11 ms
[2022-05-14 11:08:41] [INFO ] Dead Transitions using invariants and state equation in 286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-05 in 8523 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-07
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:41] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 453 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 87 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:42] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-14 11:08:42] [INFO ] [Real]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:08:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2022-05-14 11:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:42] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-05-14 11:08:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2022-05-14 11:08:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 236 ms returned sat
[2022-05-14 11:08:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:42] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2022-05-14 11:08:42] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 18 ms.
[2022-05-14 11:08:43] [INFO ] Added : 131 causal constraints over 27 iterations in 822 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 127300 steps, including 8520 resets, run finished after 469 ms. (steps per millisecond=271 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 13 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:44] [INFO ] Computed 60 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 47860 resets, run finished after 2156 ms. (steps per millisecond=463 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9153 resets, run finished after 968 ms. (steps per millisecond=1033 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:47] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:47] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2022-05-14 11:08:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-14 11:08:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:47] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-14 11:08:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-14 11:08:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 235 ms returned sat
[2022-05-14 11:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:48] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-05-14 11:08:48] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 19 ms.
[2022-05-14 11:08:49] [INFO ] Added : 131 causal constraints over 27 iterations in 789 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 127300 steps, including 8596 resets, run finished after 452 ms. (steps per millisecond=281 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:49] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:49] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:49] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:50] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2022-05-14 11:08:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:50] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-14 11:08:50] [INFO ] Dead Transitions using invariants and state equation in 287 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-07 in 8734 ms.
Starting property specific reduction for DES-PT-30b-UpperBounds-12
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:50] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 470 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 92 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:50] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:08:50] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2022-05-14 11:08:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 21 ms returned sat
[2022-05-14 11:08:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:51] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-05-14 11:08:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-05-14 11:08:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 150 ms returned sat
[2022-05-14 11:08:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:51] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2022-05-14 11:08:51] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 22 ms.
[2022-05-14 11:08:52] [INFO ] Added : 111 causal constraints over 23 iterations in 701 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 122600 steps, including 6524 resets, run finished after 452 ms. (steps per millisecond=271 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 15 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:52] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47714 resets, run finished after 2488 ms. (steps per millisecond=401 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9069 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 1) seen :0
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:56] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:56] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2022-05-14 11:08:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-14 11:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:56] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-14 11:08:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 11:08:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 10 ms returned sat
[2022-05-14 11:08:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 143 ms returned sat
[2022-05-14 11:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 11:08:57] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2022-05-14 11:08:57] [INFO ] Computed and/alt/rep : 168/320/168 causal constraints (skipped 11 transitions) in 14 ms.
[2022-05-14 11:08:57] [INFO ] Added : 111 causal constraints over 23 iterations in 452 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 122600 steps, including 6525 resets, run finished after 263 ms. (steps per millisecond=466 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 236/236 places, 182/182 transitions.
Applied a total of 0 rules in 8 ms. Remains 236 /236 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:58] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:58] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:58] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-14 11:08:58] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2022-05-14 11:08:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 182 rows 236 cols
[2022-05-14 11:08:58] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-14 11:08:58] [INFO ] Dead Transitions using invariants and state equation in 143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 236/236 places, 182/182 transitions.
Ending property specific reduction for DES-PT-30b-UpperBounds-12 in 8055 ms.
[2022-05-14 11:08:59] [INFO ] Flatten gal took : 79 ms
[2022-05-14 11:08:59] [INFO ] Applying decomposition
[2022-05-14 11:08:59] [INFO ] Flatten gal took : 30 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/graph3239182318585232861.txt, -o, /tmp/graph3239182318585232861.bin, -w, /tmp/graph3239182318585232861.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/graph3239182318585232861.bin, -l, -1, -v, -w, /tmp/graph3239182318585232861.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-14 11:08:59] [INFO ] Decomposing Gal with order
[2022-05-14 11:08:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 11:08:59] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-14 11:08:59] [INFO ] Flatten gal took : 114 ms
[2022-05-14 11:08:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 17 ms.
[2022-05-14 11:08:59] [INFO ] Time to serialize gal into /tmp/UpperBounds4430729123899125195.gal : 14 ms
[2022-05-14 11:08:59] [INFO ] Time to serialize properties into /tmp/UpperBounds17903250384651249334.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/UpperBounds4430729123899125195.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17903250384651249334.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/UpperBounds4430729123899125195.gal -t CGAL -reachable-file /tmp/UpperBounds17903250384651249334.prop --nowitness
Loading property file /tmp/UpperBounds17903250384651249334.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,2.32787e+13,2.38034,56776,4701,3861,121538,7993,289,136763,299,46646,0
Total reachable state count : 23278662811432

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-05 :0 <= u2.p115 <= 1
FORMULA DES-PT-30b-UpperBounds-05 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-30b-UpperBounds-05,0,3.55467,57044,1,0,121538,40844,464,148085,367,126406,2072
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-07 :0 <= u14.p15 <= 1
FORMULA DES-PT-30b-UpperBounds-07 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-30b-UpperBounds-07,0,4.24628,61532,1,0,121538,73764,505,194545,420,227807,3118
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-30b-UpperBounds-12 :0 <= u2.p109 <= 1
FORMULA DES-PT-30b-UpperBounds-12 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-30b-UpperBounds-12,0,4.24748,61532,1,0,121538,73787,521,194545,467,227852,3146

BK_STOP 1652526545216

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

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