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.r312-tall-165472281700045.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 itstools
Input is BugTracking-PT-q3m064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281700045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 10K Jun 7 16:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 16:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 16:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 7 16:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Jun 6 15:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Jun 7 16:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Jun 7 16:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 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 BugTracking-PT-q3m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m064-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654738175763

Running Version 202205111006
[2022-06-09 01:29:36] [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-06-09 01:29:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:29:37] [INFO ] Load time of PNML (sax parser for PT used): 771 ms
[2022-06-09 01:29:37] [INFO ] Transformed 754 places.
[2022-06-09 01:29:37] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:29:37] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 979 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 514 places in 107 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 01:29:38] [INFO ] Computed 10 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 16 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
[2022-06-09 01:29:38] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2022-06-09 01:29:38] [INFO ] Computed 10 place invariants in 14 ms
[2022-06-09 01:29:38] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2022-06-09 01:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:39] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2022-06-09 01:29:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:39] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2022-06-09 01:29:39] [INFO ] State equation strengthened by 255 read => feed constraints.
[2022-06-09 01:29:39] [INFO ] [Nat]Added 255 Read/Feed constraints in 83 ms returned sat
[2022-06-09 01:29:40] [INFO ] Deduced a trap composed of 31 places in 397 ms of which 5 ms to minimize.
[2022-06-09 01:29:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2022-06-09 01:29:40] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 244 ms.
[2022-06-09 01:29:40] [INFO ] Added : 4 causal constraints over 2 iterations in 618 ms. Result :sat
Minimization took 338 ms.
[2022-06-09 01:29:41] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:41] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2022-06-09 01:29:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:42] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2022-06-09 01:29:42] [INFO ] [Nat]Added 255 Read/Feed constraints in 101 ms returned sat
[2022-06-09 01:29:42] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 323 ms.
[2022-06-09 01:29:42] [INFO ] Added : 6 causal constraints over 2 iterations in 661 ms. Result :sat
Minimization took 294 ms.
[2022-06-09 01:29:43] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:43] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2022-06-09 01:29:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:44] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2022-06-09 01:29:44] [INFO ] [Nat]Added 255 Read/Feed constraints in 124 ms returned sat
[2022-06-09 01:29:44] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 2 ms to minimize.
[2022-06-09 01:29:44] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 1 ms to minimize.
[2022-06-09 01:29:45] [INFO ] Deduced a trap composed of 24 places in 180 ms of which 2 ms to minimize.
[2022-06-09 01:29:45] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 0 ms to minimize.
[2022-06-09 01:29:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1174 ms
[2022-06-09 01:29:45] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 144 ms.
[2022-06-09 01:29:46] [INFO ] Deduced a trap composed of 48 places in 328 ms of which 0 ms to minimize.
[2022-06-09 01:29:46] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 0 ms to minimize.
[2022-06-09 01:29:47] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2022-06-09 01:29:47] [INFO ] Deduced a trap composed of 34 places in 288 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Deduced a trap composed of 79 places in 294 ms of which 4 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Deduced a trap composed of 79 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [INFO ] Deduced a trap composed of 56 places in 300 ms of which 0 ms to minimize.
[2022-06-09 01:29:48] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
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] Max seen :[1, 0, 0]
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 257 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:29:49] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1996 ms. (steps per millisecond=501 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1891 ms. (steps per millisecond=528 ) properties (out of 3) seen :0
[2022-06-09 01:29:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:29:56] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:29:56] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:29:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:56] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-06-09 01:29:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:29:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:29:57] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-06-09 01:29:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:29:57] [INFO ] [Nat]Added 241 Read/Feed constraints in 50 ms returned sat
[2022-06-09 01:29:57] [INFO ] Deduced a trap composed of 112 places in 275 ms of which 1 ms to minimize.
[2022-06-09 01:29:57] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 1 ms to minimize.
[2022-06-09 01:29:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 736 ms
[2022-06-09 01:29:58] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 167 ms.
[2022-06-09 01:29:58] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2022-06-09 01:29:59] [INFO ] Deduced a trap composed of 18 places in 328 ms of which 1 ms to minimize.
[2022-06-09 01:29:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 880 ms
[2022-06-09 01:29:59] [INFO ] Added : 3 causal constraints over 2 iterations in 1465 ms. Result :sat
Minimization took 388 ms.
[2022-06-09 01:29:59] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:29:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:00] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2022-06-09 01:30:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:00] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-06-09 01:30:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 138 ms returned sat
[2022-06-09 01:30:01] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:30:01] [INFO ] Deduced a trap composed of 39 places in 327 ms of which 0 ms to minimize.
[2022-06-09 01:30:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 817 ms
[2022-06-09 01:30:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 163 ms.
[2022-06-09 01:30:02] [INFO ] Added : 3 causal constraints over 1 iterations in 379 ms. Result :sat
Minimization took 468 ms.
[2022-06-09 01:30:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:03] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2022-06-09 01:30:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:03] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-06-09 01:30:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 66 ms returned sat
[2022-06-09 01:30:03] [INFO ] Deduced a trap composed of 60 places in 272 ms of which 1 ms to minimize.
[2022-06-09 01:30:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 396 ms
[2022-06-09 01:30:04] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 164 ms.
[2022-06-09 01:30:04] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 1 ms to minimize.
[2022-06-09 01:30:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2022-06-09 01:30:04] [INFO ] Added : 3 causal constraints over 2 iterations in 910 ms. Result :sat
Minimization took 344 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[1, 0, 0]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 01:30:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:05] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:30:06] [INFO ] Implicit Places using invariants in 336 ms returned []
[2022-06-09 01:30:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:06] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:30:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:07] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2022-06-09 01:30:07] [INFO ] Redundant transitions in 268 ms returned []
[2022-06-09 01:30:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:07] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:30:08] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-06
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:08] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2022-06-09 01:30:08] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:08] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:30:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:09] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2022-06-09 01:30:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:09] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-09 01:30:09] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 48 ms returned sat
[2022-06-09 01:30:10] [INFO ] Deduced a trap composed of 112 places in 298 ms of which 1 ms to minimize.
[2022-06-09 01:30:10] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 0 ms to minimize.
[2022-06-09 01:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 754 ms
[2022-06-09 01:30:10] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 137 ms.
[2022-06-09 01:30:11] [INFO ] Deduced a trap composed of 10 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:30:11] [INFO ] Deduced a trap composed of 18 places in 339 ms of which 4 ms to minimize.
[2022-06-09 01:30:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 878 ms
[2022-06-09 01:30:11] [INFO ] Added : 3 causal constraints over 2 iterations in 1423 ms. Result :sat
Minimization took 356 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:12] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=995 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties (out of 1) seen :0
[2022-06-09 01:30:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:15] [INFO ] Computed 8 place invariants in 19 ms
[2022-06-09 01:30:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:15] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2022-06-09 01:30:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:16] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2022-06-09 01:30:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 50 ms returned sat
[2022-06-09 01:30:16] [INFO ] Deduced a trap composed of 112 places in 286 ms of which 0 ms to minimize.
[2022-06-09 01:30:16] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 0 ms to minimize.
[2022-06-09 01:30:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 717 ms
[2022-06-09 01:30:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 163 ms.
[2022-06-09 01:30:17] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 1 ms to minimize.
[2022-06-09 01:30:18] [INFO ] Deduced a trap composed of 18 places in 303 ms of which 0 ms to minimize.
[2022-06-09 01:30:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 830 ms
[2022-06-09 01:30:18] [INFO ] Added : 3 causal constraints over 2 iterations in 1399 ms. Result :sat
Minimization took 378 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 01:30:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:19] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:30:19] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-06-09 01:30:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:19] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:30:19] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:21] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2133 ms to find 0 implicit places.
[2022-06-09 01:30:21] [INFO ] Redundant transitions in 172 ms returned []
[2022-06-09 01:30:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:21] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:30:22] [INFO ] Dead Transitions using invariants and state equation in 788 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-06 in 13329 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:22] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10032 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2022-06-09 01:30:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:22] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:30:22] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:22] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2022-06-09 01:30:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:22] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-09 01:30:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:23] [INFO ] [Nat]Added 241 Read/Feed constraints in 144 ms returned sat
[2022-06-09 01:30:23] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 0 ms to minimize.
[2022-06-09 01:30:23] [INFO ] Deduced a trap composed of 39 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:30:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 787 ms
[2022-06-09 01:30:24] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 160 ms.
[2022-06-09 01:30:24] [INFO ] Added : 3 causal constraints over 1 iterations in 386 ms. Result :sat
Minimization took 488 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 35 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:25] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 948 ms. (steps per millisecond=1054 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1859 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
[2022-06-09 01:30:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:27] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 01:30:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:28] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2022-06-09 01:30:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2022-06-09 01:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:28] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-06-09 01:30:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 140 ms returned sat
[2022-06-09 01:30:29] [INFO ] Deduced a trap composed of 49 places in 325 ms of which 1 ms to minimize.
[2022-06-09 01:30:29] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 0 ms to minimize.
[2022-06-09 01:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 807 ms
[2022-06-09 01:30:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 151 ms.
[2022-06-09 01:30:30] [INFO ] Added : 3 causal constraints over 1 iterations in 370 ms. Result :sat
Minimization took 465 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 34 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 01:30:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:30] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:30:31] [INFO ] Implicit Places using invariants in 300 ms returned []
[2022-06-09 01:30:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:31] [INFO ] Computed 8 place invariants in 22 ms
[2022-06-09 01:30:31] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:32] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 1875 ms to find 0 implicit places.
[2022-06-09 01:30:32] [INFO ] Redundant transitions in 67 ms returned []
[2022-06-09 01:30:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:32] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:30:33] [INFO ] Dead Transitions using invariants and state equation in 793 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-08 in 11368 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-15
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:33] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10056 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=670 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2022-06-09 01:30:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:33] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 01:30:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:33] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2022-06-09 01:30:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:34] [INFO ] [Nat]Absence check using state equation in 359 ms returned sat
[2022-06-09 01:30:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:34] [INFO ] [Nat]Added 241 Read/Feed constraints in 71 ms returned sat
[2022-06-09 01:30:34] [INFO ] Deduced a trap composed of 60 places in 288 ms of which 0 ms to minimize.
[2022-06-09 01:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 407 ms
[2022-06-09 01:30:35] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 171 ms.
[2022-06-09 01:30:35] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 1 ms to minimize.
[2022-06-09 01:30:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2022-06-09 01:30:35] [INFO ] Added : 3 causal constraints over 2 iterations in 903 ms. Result :sat
Minimization took 348 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:36] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000025 steps, including 2 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 1) seen :0
[2022-06-09 01:30:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:39] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:30:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:39] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2022-06-09 01:30:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:30:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:30:40] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2022-06-09 01:30:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:40] [INFO ] [Nat]Added 241 Read/Feed constraints in 69 ms returned sat
[2022-06-09 01:30:40] [INFO ] Deduced a trap composed of 60 places in 286 ms of which 0 ms to minimize.
[2022-06-09 01:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2022-06-09 01:30:40] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 177 ms.
[2022-06-09 01:30:41] [INFO ] Deduced a trap composed of 10 places in 177 ms of which 1 ms to minimize.
[2022-06-09 01:30:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2022-06-09 01:30:41] [INFO ] Added : 3 causal constraints over 2 iterations in 930 ms. Result :sat
Minimization took 341 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2022-06-09 01:30:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:42] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:30:42] [INFO ] Implicit Places using invariants in 335 ms returned []
[2022-06-09 01:30:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:42] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:30:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2022-06-09 01:30:44] [INFO ] Implicit Places using invariants and state equation in 1874 ms returned []
Implicit Place search using SMT with State Equation took 2212 ms to find 0 implicit places.
[2022-06-09 01:30:44] [INFO ] Redundant transitions in 69 ms returned []
[2022-06-09 01:30:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2022-06-09 01:30:44] [INFO ] Computed 8 place invariants in 6 ms
[2022-06-09 01:30:45] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-15 in 11940 ms.
[2022-06-09 01:30:45] [INFO ] Flatten gal took : 262 ms
[2022-06-09 01:30:45] [INFO ] Applying decomposition
[2022-06-09 01:30:46] [INFO ] Flatten gal took : 147 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/graph14327509685325790202.txt' '-o' '/tmp/graph14327509685325790202.bin' '-w' '/tmp/graph14327509685325790202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14327509685325790202.bin' '-l' '-1' '-v' '-w' '/tmp/graph14327509685325790202.weights' '-q' '0' '-e' '0.001'
[2022-06-09 01:30:46] [INFO ] Decomposing Gal with order
[2022-06-09 01:30:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:30:46] [INFO ] Removed a total of 280 redundant transitions.
[2022-06-09 01:30:46] [INFO ] Flatten gal took : 396 ms
[2022-06-09 01:30:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 28 ms.
[2022-06-09 01:30:47] [INFO ] Time to serialize gal into /tmp/UpperBounds7757168229238040883.gal : 56 ms
[2022-06-09 01:30:47] [INFO ] Time to serialize properties into /tmp/UpperBounds8751405588662470443.prop : 0 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/UpperBounds7757168229238040883.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8751405588662470443.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/UpperBounds8751405588662470443.prop.
Detected timeout of ITS tools.
[2022-06-09 01:51:13] [INFO ] Flatten gal took : 688 ms
[2022-06-09 01:51:13] [INFO ] Time to serialize gal into /tmp/UpperBounds4900310167548916612.gal : 98 ms
[2022-06-09 01:51:13] [INFO ] Time to serialize properties into /tmp/UpperBounds18061229171899000065.prop : 2 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/UpperBounds4900310167548916612.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18061229171899000065.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...296
Loading property file /tmp/UpperBounds18061229171899000065.prop.
Detected timeout of ITS tools.
[2022-06-09 02:11:36] [INFO ] Flatten gal took : 516 ms
[2022-06-09 02:11:39] [INFO ] Input system was already deterministic with 2747 transitions.
[2022-06-09 02:11:39] [INFO ] Transformed 229 places.
[2022-06-09 02:11:39] [INFO ] Transformed 2747 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 02:11:39] [INFO ] Time to serialize gal into /tmp/UpperBounds6088760260260962119.gal : 12 ms
[2022-06-09 02:11:39] [INFO ] Time to serialize properties into /tmp/UpperBounds16814132090412259957.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/UpperBounds6088760260260962119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16814132090412259957.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16814132090412259957.prop.

BK_TIME_CONFINEMENT_REACHED

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m064, 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 r312-tall-165472281700045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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