Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504300060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-tall-167814504300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678174729480

Running Version 202205111006
[2023-03-07 07:38:50] [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]
[2023-03-07 07:38:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:38:50] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-07 07:38:50] [INFO ] Transformed 314 places.
[2023-03-07 07:38:50] [INFO ] Transformed 271 transitions.
[2023-03-07 07:38:50] [INFO ] Found NUPN structural information;
[2023-03-07 07:38:50] [INFO ] Parsed PT model containing 314 places and 271 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-07 07:38:51] [INFO ] Computed 59 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 216 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :7
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
// Phase 1: matrix 257 rows 314 cols
[2023-03-07 07:38:51] [INFO ] Computed 59 place invariants in 10 ms
[2023-03-07 07:38:51] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2023-03-07 07:38:51] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-07 07:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:51] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2023-03-07 07:38:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-07 07:38:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-07 07:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:52] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2023-03-07 07:38:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-07 07:38:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 64 ms returned sat
[2023-03-07 07:38:52] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-07 07:38:53] [INFO ] Added : 179 causal constraints over 36 iterations in 1024 ms. Result :sat
Minimization took 290 ms.
[2023-03-07 07:38:54] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:38:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-07 07:38:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:54] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-03-07 07:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:54] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:38:54] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-07 07:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:55] [INFO ] [Nat]Absence check using state equation in 1366 ms returned sat
[2023-03-07 07:38:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:38:55] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-07 07:38:57] [INFO ] Added : 192 causal constraints over 39 iterations in 1280 ms. Result :sat
Minimization took 223 ms.
[2023-03-07 07:38:57] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:38:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-07 07:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:57] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-07 07:38:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:38:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-07 07:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:58] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2023-03-07 07:38:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2023-03-07 07:38:58] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 24 ms.
[2023-03-07 07:38:59] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 2 ms to minimize.
[2023-03-07 07:38:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-07 07:38:59] [INFO ] Added : 82 causal constraints over 17 iterations in 778 ms. Result :sat
Minimization took 183 ms.
[2023-03-07 07:38:59] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:38:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-07 07:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:38:59] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-07 07:38:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:38:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:38:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-07 07:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:00] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-07 07:39:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:39:00] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-07 07:39:01] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2023-03-07 07:39:01] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-07 07:39:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-07 07:39:01] [INFO ] Added : 87 causal constraints over 18 iterations in 997 ms. Result :sat
Minimization took 216 ms.
[2023-03-07 07:39:01] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:01] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-07 07:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:01] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-07 07:39:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:02] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 96 ms returned sat
[2023-03-07 07:39:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:03] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2023-03-07 07:39:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 602 ms returned sat
[2023-03-07 07:39:04] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-07 07:39:04] [INFO ] Added : 115 causal constraints over 23 iterations in 988 ms. Result :sat
Minimization took 178 ms.
[2023-03-07 07:39:05] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:05] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-07 07:39:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:05] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-07 07:39:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:39:05] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-07 07:39:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:05] [INFO ] [Nat]Absence check using state equation in 344 ms returned sat
[2023-03-07 07:39:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:39:05] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-07 07:39:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 2 ms to minimize.
[2023-03-07 07:39:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2023-03-07 07:39:07] [INFO ] Added : 210 causal constraints over 42 iterations in 2067 ms. Result :sat
Minimization took 140 ms.
[2023-03-07 07:39:08] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:39:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-07 07:39:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:08] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-07 07:39:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2023-03-07 07:39:08] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-07 07:39:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:10] [INFO ] [Nat]Absence check using state equation in 1643 ms returned sat
[2023-03-07 07:39:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-07 07:39:10] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 16 ms.
[2023-03-07 07:39:11] [INFO ] Added : 223 causal constraints over 45 iterations in 1475 ms. Result :sat
Minimization took 323 ms.
[2023-03-07 07:39:12] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:12] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-07 07:39:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:12] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2023-03-07 07:39:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:12] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 121 ms returned sat
[2023-03-07 07:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:12] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2023-03-07 07:39:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-07 07:39:12] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-07 07:39:13] [INFO ] Added : 68 causal constraints over 14 iterations in 428 ms. Result :sat
Minimization took 168 ms.
[2023-03-07 07:39:13] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:13] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-07 07:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:13] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-07 07:39:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:13] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 116 ms returned sat
[2023-03-07 07:39:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:17] [INFO ] [Nat]Absence check using state equation in 3137 ms returned sat
[2023-03-07 07:39:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 572 ms returned sat
[2023-03-07 07:39:17] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-07 07:39:18] [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 8
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 314 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 122 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:20] [INFO ] Computed 60 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 13687 resets, run finished after 2107 ms. (steps per millisecond=474 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2228 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2255 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 2) seen :0
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:24] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-07 07:39:25] [INFO ] [Real]Absence check using 35 positive place invariants in 242 ms returned sat
[2023-03-07 07:39:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-07 07:39:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:25] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-07 07:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-07 07:39:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 120 ms returned sat
[2023-03-07 07:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:25] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-07 07:39:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2023-03-07 07:39:25] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-07 07:39:26] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-07 07:39:26] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 0 ms to minimize.
[2023-03-07 07:39:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 281 ms
[2023-03-07 07:39:26] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-07 07:39:26] [INFO ] Added : 202 causal constraints over 41 iterations in 854 ms. Result :sat
Minimization took 105 ms.
[2023-03-07 07:39:27] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-07 07:39:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:27] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-07 07:39:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-07 07:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:27] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-07 07:39:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2023-03-07 07:39:27] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-07 07:39:27] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2023-03-07 07:39:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 166 ms
[2023-03-07 07:39:27] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-07 07:39:28] [INFO ] Deduced a trap composed of 57 places in 72 ms of which 0 ms to minimize.
[2023-03-07 07:39:28] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
[2023-03-07 07:39:29] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2023-03-07 07:39:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 315 ms
[2023-03-07 07:39:29] [INFO ] Added : 239 causal constraints over 48 iterations in 1342 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:30] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-07 07:39:30] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:30] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-07 07:39:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:30] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
[2023-03-07 07:39:30] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:30] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:39:30] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Starting property specific reduction for DES-PT-50a-UpperBounds-00
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:30] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 140 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:30] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-07 07:39:31] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-07 07:39:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:31] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-07 07:39:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 89 ms returned sat
[2023-03-07 07:39:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:31] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-07 07:39:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:31] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-07 07:39:31] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2023-03-07 07:39:31] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-07 07:39:31] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-03-07 07:39:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 274 ms
[2023-03-07 07:39:31] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-07 07:39:32] [INFO ] Added : 202 causal constraints over 41 iterations in 890 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:33] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 13676 resets, run finished after 1925 ms. (steps per millisecond=519 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2297 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 1) seen :0
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:36] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-07 07:39:36] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-07 07:39:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-07 07:39:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:36] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-07 07:39:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:36] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-07 07:39:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:36] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2023-03-07 07:39:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2023-03-07 07:39:36] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-07 07:39:36] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-07 07:39:37] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:39:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 296 ms
[2023-03-07 07:39:37] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-07 07:39:37] [INFO ] Added : 202 causal constraints over 41 iterations in 907 ms. Result :sat
Minimization took 107 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 18 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 22 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:38] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-07 07:39:38] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:38] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:39:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:39] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-07 07:39:39] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:39] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-07 07:39:39] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-00 in 8452 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-02
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:39] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:39] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-07 07:39:39] [INFO ] [Real]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-07 07:39:39] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-07 07:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:39] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-07 07:39:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-07 07:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:39] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-07 07:39:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 30 ms returned sat
[2023-03-07 07:39:39] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-07 07:39:40] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2023-03-07 07:39:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-07 07:39:40] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-07 07:39:41] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2023-03-07 07:39:41] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2023-03-07 07:39:41] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2023-03-07 07:39:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-03-07 07:39:41] [INFO ] Added : 239 causal constraints over 48 iterations in 1354 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:42] [INFO ] Computed 60 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 13686 resets, run finished after 1927 ms. (steps per millisecond=518 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2321 resets, run finished after 927 ms. (steps per millisecond=1078 ) properties (out of 1) seen :0
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:44] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-07 07:39:44] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-07 07:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:45] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-07 07:39:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:39:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-07 07:39:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-07 07:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:39:45] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-07 07:39:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2023-03-07 07:39:45] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-07 07:39:45] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2023-03-07 07:39:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-07 07:39:45] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-07 07:39:46] [INFO ] Deduced a trap composed of 57 places in 70 ms of which 1 ms to minimize.
[2023-03-07 07:39:46] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 1 ms to minimize.
[2023-03-07 07:39:46] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 0 ms to minimize.
[2023-03-07 07:39:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 307 ms
[2023-03-07 07:39:46] [INFO ] Added : 239 causal constraints over 48 iterations in 1449 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:47] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-07 07:39:47] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:47] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-07 07:39:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-07 07:39:48] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2023-03-07 07:39:48] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 253 rows 311 cols
[2023-03-07 07:39:48] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-07 07:39:48] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 9011 ms.
[2023-03-07 07:39:48] [INFO ] Flatten gal took : 63 ms
[2023-03-07 07:39:48] [INFO ] Applying decomposition
[2023-03-07 07:39:48] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph5913694619660397789.txt' '-o' '/tmp/graph5913694619660397789.bin' '-w' '/tmp/graph5913694619660397789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5913694619660397789.bin' '-l' '-1' '-v' '-w' '/tmp/graph5913694619660397789.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:39:48] [INFO ] Decomposing Gal with order
[2023-03-07 07:39:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:39:48] [INFO ] Removed a total of 23 redundant transitions.
[2023-03-07 07:39:48] [INFO ] Flatten gal took : 58 ms
[2023-03-07 07:39:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2023-03-07 07:39:48] [INFO ] Time to serialize gal into /tmp/UpperBounds1083043741950844386.gal : 7 ms
[2023-03-07 07:39:48] [INFO ] Time to serialize properties into /tmp/UpperBounds3586566773342057005.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1083043741950844386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3586566773342057005.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...274
Loading property file /tmp/UpperBounds3586566773342057005.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.83192e+13,90.3439,1370024,59192,10051,3.07479e+06,20576,244,2.77992e+06,458,259585,0
Total reachable state count : 28319158339780

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50a-UpperBounds-00 :0 <= u46.p60 <= 1
FORMULA DES-PT-50a-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-50a-UpperBounds-00,0,116.318,1370312,1,0,3.07479e+06,368853,420,4.30089e+06,612,4.01214e+06,9753
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-50a-UpperBounds-02 :0 <= u13.p3 <= 1
FORMULA DES-PT-50a-UpperBounds-02 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-50a-UpperBounds-02,0,127.6,1370312,1,0,3.07479e+06,468177,451,5.58542e+06,709,5.24491e+06,18326
Total runtime 186096 ms.

BK_STOP 1678174916877

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-50a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is DES-PT-50a, 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 r127-tall-167814504300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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