Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690200341.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BugTracking-PT-q3m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690200341
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K Feb 26 06:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 06:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 07:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 07:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 06:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 06:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q3m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678345244137

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m008
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-09 07:00:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 07:00:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 07:00:47] [INFO ] Load time of PNML (sax parser for PT used): 711 ms
[2023-03-09 07:00:47] [INFO ] Transformed 754 places.
[2023-03-09 07:00:47] [INFO ] Transformed 27370 transitions.
[2023-03-09 07:00:47] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 973 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 111 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2642 out of 2769 initially.
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 07:00:47] [INFO ] Computed 10 place invariants in 47 ms
FORMULA BugTracking-PT-q3m008-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 74 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :3
FORMULA BugTracking-PT-q3m008-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m008-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m008-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
[2023-03-09 07:00:47] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-09 07:00:47] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-09 07:00:48] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-09 07:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:48] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-09 07:00:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:00:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:00:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:49] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-03-09 07:00:49] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-09 07:00:49] [INFO ] [Nat]Added 255 Read/Feed constraints in 123 ms returned sat
[2023-03-09 07:00:49] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 16 ms to minimize.
[2023-03-09 07:00:50] [INFO ] Deduced a trap composed of 17 places in 320 ms of which 1 ms to minimize.
[2023-03-09 07:00:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 811 ms
[2023-03-09 07:00:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 273 ms.
[2023-03-09 07:00:50] [INFO ] Added : 5 causal constraints over 1 iterations in 553 ms. Result :sat
Minimization took 326 ms.
[2023-03-09 07:00:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 07:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:51] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-09 07:00:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:00:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:52] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-09 07:00:52] [INFO ] [Nat]Added 255 Read/Feed constraints in 87 ms returned sat
[2023-03-09 07:00:52] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 1 ms to minimize.
[2023-03-09 07:00:52] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 2 ms to minimize.
[2023-03-09 07:00:53] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 2 ms to minimize.
[2023-03-09 07:00:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1001 ms
[2023-03-09 07:00:53] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 179 ms.
[2023-03-09 07:00:53] [INFO ] Added : 5 causal constraints over 1 iterations in 515 ms. Result :sat
Minimization took 317 ms.
[2023-03-09 07:00:54] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:54] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-09 07:00:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:00:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-09 07:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:55] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2023-03-09 07:00:55] [INFO ] [Nat]Added 255 Read/Feed constraints in 40 ms returned sat
[2023-03-09 07:00:55] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 263 ms.
[2023-03-09 07:00:56] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-09 07:00:56] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 1 ms to minimize.
[2023-03-09 07:00:56] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-09 07:00:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 865 ms
[2023-03-09 07:00:57] [INFO ] Added : 9 causal constraints over 4 iterations in 1917 ms. Result :sat
Minimization took 289 ms.
[2023-03-09 07:00:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:58] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2023-03-09 07:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:00:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:00:58] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-09 07:00:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 97 ms returned sat
[2023-03-09 07:00:59] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2023-03-09 07:00:59] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-09 07:00:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 752 ms
[2023-03-09 07:00:59] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 226 ms.
[2023-03-09 07:01:00] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-09 07:01:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 310 ms
[2023-03-09 07:01:00] [INFO ] Added : 7 causal constraints over 2 iterations in 1235 ms. Result :sat
Minimization took 362 ms.
[2023-03-09 07:01:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:01] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-09 07:01:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-09 07:01:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:02] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2023-03-09 07:01:02] [INFO ] [Nat]Added 255 Read/Feed constraints in 87 ms returned sat
[2023-03-09 07:01:02] [INFO ] Deduced a trap composed of 53 places in 329 ms of which 1 ms to minimize.
[2023-03-09 07:01:03] [INFO ] Deduced a trap composed of 63 places in 314 ms of which 1 ms to minimize.
[2023-03-09 07:01:03] [INFO ] Deduced a trap composed of 60 places in 339 ms of which 1 ms to minimize.
[2023-03-09 07:01:04] [INFO ] Deduced a trap composed of 41 places in 302 ms of which 0 ms to minimize.
[2023-03-09 07:01:04] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 0 ms to minimize.
[2023-03-09 07:01:05] [INFO ] Deduced a trap composed of 52 places in 336 ms of which 1 ms to minimize.
[2023-03-09 07:01:05] [INFO ] Deduced a trap composed of 55 places in 294 ms of which 1 ms to minimize.
[2023-03-09 07:01:05] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 1 ms to minimize.
[2023-03-09 07:01:06] [INFO ] Deduced a trap composed of 53 places in 328 ms of which 0 ms to minimize.
[2023-03-09 07:01:06] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 1 ms to minimize.
[2023-03-09 07:01:07] [INFO ] Deduced a trap composed of 12 places in 577 ms of which 0 ms to minimize.
[2023-03-09 07:01:07] [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 4
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.15 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 244 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 229/240 places, 2747/2769 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:01:08] [INFO ] Computed 8 place invariants in 30 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 5465 ms. (steps per millisecond=182 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2474 ms. (steps per millisecond=404 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1986 ms. (steps per millisecond=503 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1984 ms. (steps per millisecond=504 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1976 ms. (steps per millisecond=506 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2010 ms. (steps per millisecond=497 ) properties (out of 5) seen :0
[2023-03-09 07:01:23] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:01:23] [INFO ] Computed 8 place invariants in 30 ms
[2023-03-09 07:01:24] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-09 07:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:24] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-09 07:01:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:24] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2023-03-09 07:01:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:01:25] [INFO ] [Nat]Added 241 Read/Feed constraints in 73 ms returned sat
[2023-03-09 07:01:25] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 0 ms to minimize.
[2023-03-09 07:01:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 448 ms
[2023-03-09 07:01:25] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 218 ms.
[2023-03-09 07:01:26] [INFO ] Added : 3 causal constraints over 1 iterations in 546 ms. Result :sat
Minimization took 332 ms.
[2023-03-09 07:01:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:26] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-09 07:01:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:27] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2023-03-09 07:01:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 104 ms returned sat
[2023-03-09 07:01:27] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 0 ms to minimize.
[2023-03-09 07:01:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2023-03-09 07:01:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 212 ms.
[2023-03-09 07:01:28] [INFO ] Added : 3 causal constraints over 1 iterations in 548 ms. Result :sat
Minimization took 354 ms.
[2023-03-09 07:01:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:29] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-09 07:01:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:30] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2023-03-09 07:01:30] [INFO ] [Nat]Added 241 Read/Feed constraints in 52 ms returned sat
[2023-03-09 07:01:30] [INFO ] Deduced a trap composed of 16 places in 314 ms of which 0 ms to minimize.
[2023-03-09 07:01:30] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 1 ms to minimize.
[2023-03-09 07:01:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 807 ms
[2023-03-09 07:01:31] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 218 ms.
[2023-03-09 07:01:31] [INFO ] Deduced a trap composed of 49 places in 304 ms of which 0 ms to minimize.
[2023-03-09 07:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-09 07:01:32] [INFO ] Added : 7 causal constraints over 2 iterations in 1201 ms. Result :sat
Minimization took 307 ms.
[2023-03-09 07:01:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:01:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:33] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-09 07:01:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:33] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-03-09 07:01:33] [INFO ] [Nat]Added 241 Read/Feed constraints in 117 ms returned sat
[2023-03-09 07:01:34] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 221 ms.
[2023-03-09 07:01:34] [INFO ] Added : 4 causal constraints over 1 iterations in 565 ms. Result :sat
Minimization took 263 ms.
[2023-03-09 07:01:34] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:35] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-09 07:01:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:01:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:35] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2023-03-09 07:01:35] [INFO ] [Nat]Added 241 Read/Feed constraints in 80 ms returned sat
[2023-03-09 07:01:36] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 0 ms to minimize.
[2023-03-09 07:01:36] [INFO ] Deduced a trap composed of 114 places in 402 ms of which 0 ms to minimize.
[2023-03-09 07:01:37] [INFO ] Deduced a trap composed of 47 places in 331 ms of which 1 ms to minimize.
[2023-03-09 07:01:37] [INFO ] Deduced a trap composed of 58 places in 371 ms of which 1 ms to minimize.
[2023-03-09 07:01:38] [INFO ] Deduced a trap composed of 67 places in 362 ms of which 1 ms to minimize.
[2023-03-09 07:01:38] [INFO ] Deduced a trap composed of 45 places in 309 ms of which 0 ms to minimize.
[2023-03-09 07:01:38] [INFO ] Deduced a trap composed of 109 places in 309 ms of which 1 ms to minimize.
[2023-03-09 07:01:39] [INFO ] Deduced a trap composed of 77 places in 280 ms of which 6 ms to minimize.
[2023-03-09 07:01:39] [INFO ] Deduced a trap composed of 45 places in 277 ms of which 4 ms to minimize.
[2023-03-09 07:01:40] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 1 ms to minimize.
[2023-03-09 07:01:40] [INFO ] Deduced a trap composed of 39 places in 342 ms of which 0 ms to minimize.
[2023-03-09 07:01:40] [INFO ] Deduced a trap composed of 39 places in 300 ms of which 0 ms to minimize.
[2023-03-09 07:01:41] [INFO ] Deduced a trap composed of 50 places in 451 ms of which 1 ms to minimize.
[2023-03-09 07:01:42] [INFO ] Deduced a trap composed of 50 places in 415 ms of which 1 ms to minimize.
[2023-03-09 07:01:42] [INFO ] Deduced a trap composed of 74 places in 365 ms of which 0 ms to minimize.
[2023-03-09 07:01:43] [INFO ] Deduced a trap composed of 63 places in 378 ms of which 0 ms to minimize.
[2023-03-09 07:01:44] [INFO ] Deduced a trap composed of 68 places in 383 ms of which 0 ms to minimize.
[2023-03-09 07:01:44] [INFO ] Deduced a trap composed of 88 places in 359 ms of which 1 ms to minimize.
[2023-03-09 07:01:45] [INFO ] Deduced a trap composed of 104 places in 386 ms of which 0 ms to minimize.
[2023-03-09 07:01:45] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 0 ms to minimize.
[2023-03-09 07:01:46] [INFO ] Deduced a trap composed of 17 places in 385 ms of which 0 ms to minimize.
[2023-03-09 07:01:46] [INFO ] Deduced a trap composed of 16 places in 380 ms of which 1 ms to minimize.
[2023-03-09 07:01:47] [INFO ] Deduced a trap composed of 89 places in 378 ms of which 1 ms to minimize.
[2023-03-09 07:01:48] [INFO ] Deduced a trap composed of 70 places in 410 ms of which 1 ms to minimize.
[2023-03-09 07:01:48] [INFO ] Deduced a trap composed of 52 places in 375 ms of which 1 ms to minimize.
[2023-03-09 07:01:49] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 0 ms to minimize.
[2023-03-09 07:01:49] [INFO ] Deduced a trap composed of 70 places in 377 ms of which 0 ms to minimize.
[2023-03-09 07:01:50] [INFO ] Deduced a trap composed of 108 places in 380 ms of which 0 ms to minimize.
[2023-03-09 07:01:50] [INFO ] Deduced a trap composed of 108 places in 399 ms of which 1 ms to minimize.
[2023-03-09 07:01:51] [INFO ] Deduced a trap composed of 107 places in 414 ms of which 5 ms to minimize.
[2023-03-09 07:01:52] [INFO ] Deduced a trap composed of 70 places in 403 ms of which 1 ms to minimize.
[2023-03-09 07:01:53] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 17351 ms
[2023-03-09 07:01:53] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 183 ms.
[2023-03-09 07:01:53] [INFO ] Added : 8 causal constraints over 2 iterations in 600 ms. Result :sat
Minimization took 757 ms.
Current structural bounds on expressions (after SMT) : [1, 1, -1, 1, -1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 80 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:01:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:01:55] [INFO ] Invariant cache hit.
[2023-03-09 07:01:55] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-09 07:01:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:01:55] [INFO ] Invariant cache hit.
[2023-03-09 07:01:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:01:57] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 2112 ms to find 0 implicit places.
[2023-03-09 07:01:57] [INFO ] Redundant transitions in 323 ms returned []
[2023-03-09 07:01:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:01:57] [INFO ] Invariant cache hit.
[2023-03-09 07:01:58] [INFO ] Dead Transitions using invariants and state equation in 1029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3552 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-01
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:01:59] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-09 07:01:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:01:59] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-09 07:01:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:01:59] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2023-03-09 07:01:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:01:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:01:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:00] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-09 07:02:00] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 96 ms returned sat
[2023-03-09 07:02:00] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 0 ms to minimize.
[2023-03-09 07:02:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2023-03-09 07:02:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 222 ms.
[2023-03-09 07:02:01] [INFO ] Added : 3 causal constraints over 1 iterations in 519 ms. Result :sat
Minimization took 363 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 54 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:01] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6152 ms. (steps per millisecond=162 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2122 ms. (steps per millisecond=471 ) properties (out of 1) seen :0
[2023-03-09 07:02:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:10] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-09 07:02:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:10] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2023-03-09 07:02:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:11] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2023-03-09 07:02:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:11] [INFO ] [Nat]Added 241 Read/Feed constraints in 112 ms returned sat
[2023-03-09 07:02:11] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 0 ms to minimize.
[2023-03-09 07:02:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 507 ms
[2023-03-09 07:02:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 246 ms.
[2023-03-09 07:02:12] [INFO ] Added : 3 causal constraints over 1 iterations in 583 ms. Result :sat
Minimization took 368 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:02:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:13] [INFO ] Invariant cache hit.
[2023-03-09 07:02:13] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-09 07:02:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:13] [INFO ] Invariant cache hit.
[2023-03-09 07:02:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:15] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
[2023-03-09 07:02:15] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-09 07:02:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:15] [INFO ] Invariant cache hit.
[2023-03-09 07:02:16] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3244 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-01 in 17339 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-03
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:16] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-09 07:02:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:16] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 07:02:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:16] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2023-03-09 07:02:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 07:02:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:17] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2023-03-09 07:02:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:17] [INFO ] [Nat]Added 241 Read/Feed constraints in 87 ms returned sat
[2023-03-09 07:02:17] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 1 ms to minimize.
[2023-03-09 07:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-09 07:02:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 133 ms.
[2023-03-09 07:02:17] [INFO ] Added : 3 causal constraints over 1 iterations in 336 ms. Result :sat
Minimization took 271 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 53 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:18] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 5456 ms. (steps per millisecond=183 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2501 ms. (steps per millisecond=399 ) properties (out of 1) seen :0
[2023-03-09 07:02:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:26] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-09 07:02:26] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:26] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-09 07:02:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:02:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:27] [INFO ] [Nat]Absence check using state equation in 354 ms returned sat
[2023-03-09 07:02:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:27] [INFO ] [Nat]Added 241 Read/Feed constraints in 93 ms returned sat
[2023-03-09 07:02:27] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 0 ms to minimize.
[2023-03-09 07:02:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2023-03-09 07:02:27] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 191 ms.
[2023-03-09 07:02:28] [INFO ] Added : 3 causal constraints over 1 iterations in 478 ms. Result :sat
Minimization took 344 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:02:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:28] [INFO ] Invariant cache hit.
[2023-03-09 07:02:29] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-09 07:02:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:29] [INFO ] Invariant cache hit.
[2023-03-09 07:02:29] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:30] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2023-03-09 07:02:30] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-09 07:02:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:30] [INFO ] Invariant cache hit.
[2023-03-09 07:02:31] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2829 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-03 in 15207 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:31] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2023-03-09 07:02:31] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:31] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 07:02:31] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:32] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-09 07:02:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:32] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-09 07:02:32] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:32] [INFO ] [Nat]Added 241 Read/Feed constraints in 51 ms returned sat
[2023-03-09 07:02:32] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 0 ms to minimize.
[2023-03-09 07:02:33] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2023-03-09 07:02:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 665 ms
[2023-03-09 07:02:33] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 147 ms.
[2023-03-09 07:02:34] [INFO ] Deduced a trap composed of 49 places in 279 ms of which 1 ms to minimize.
[2023-03-09 07:02:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 466 ms
[2023-03-09 07:02:34] [INFO ] Added : 7 causal constraints over 2 iterations in 1115 ms. Result :sat
Minimization took 306 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 REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:34] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 4809 ms. (steps per millisecond=207 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2757 ms. (steps per millisecond=362 ) properties (out of 1) seen :0
[2023-03-09 07:02:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:42] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-09 07:02:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:43] [INFO ] [Real]Absence check using state equation in 446 ms returned sat
[2023-03-09 07:02:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:43] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-09 07:02:43] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:43] [INFO ] [Nat]Added 241 Read/Feed constraints in 45 ms returned sat
[2023-03-09 07:02:43] [INFO ] Deduced a trap composed of 16 places in 308 ms of which 1 ms to minimize.
[2023-03-09 07:02:44] [INFO ] Deduced a trap composed of 19 places in 261 ms of which 3 ms to minimize.
[2023-03-09 07:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 779 ms
[2023-03-09 07:02:44] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 213 ms.
[2023-03-09 07:02:45] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 3 ms to minimize.
[2023-03-09 07:02:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2023-03-09 07:02:45] [INFO ] Added : 7 causal constraints over 2 iterations in 1214 ms. Result :sat
Minimization took 283 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 REACHABILITY 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 39 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:02:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:46] [INFO ] Invariant cache hit.
[2023-03-09 07:02:46] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-09 07:02:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:46] [INFO ] Invariant cache hit.
[2023-03-09 07:02:46] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:48] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-09 07:02:48] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-09 07:02:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:02:48] [INFO ] Invariant cache hit.
[2023-03-09 07:02:48] [INFO ] Dead Transitions using invariants and state equation in 834 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2958 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-04 in 17469 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-07
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:48] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-09 07:02:49] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:49] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-09 07:02:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:02:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:49] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2023-03-09 07:02:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-09 07:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:49] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-09 07:02:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:02:49] [INFO ] [Nat]Added 241 Read/Feed constraints in 78 ms returned sat
[2023-03-09 07:02:50] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 162 ms.
[2023-03-09 07:02:50] [INFO ] Added : 4 causal constraints over 1 iterations in 328 ms. Result :sat
Minimization took 189 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 REACHABILITY 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 REACHABILITY mode , in 1 iterations and 39 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:50] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 5422 ms. (steps per millisecond=184 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2769 ms. (steps per millisecond=361 ) properties (out of 1) seen :0
[2023-03-09 07:02:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:02:58] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-09 07:02:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:59] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2023-03-09 07:02:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:02:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-09 07:02:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:02:59] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-09 07:02:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:03:00] [INFO ] [Nat]Added 241 Read/Feed constraints in 118 ms returned sat
[2023-03-09 07:03:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 242 ms.
[2023-03-09 07:03:00] [INFO ] Added : 4 causal constraints over 1 iterations in 608 ms. Result :sat
Minimization took 308 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 47 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 46 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-09 07:03:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:01] [INFO ] Invariant cache hit.
[2023-03-09 07:03:01] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-09 07:03:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:01] [INFO ] Invariant cache hit.
[2023-03-09 07:03:02] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:03:03] [INFO ] Implicit Places using invariants and state equation in 1513 ms returned []
Implicit Place search using SMT with State Equation took 1866 ms to find 0 implicit places.
[2023-03-09 07:03:03] [INFO ] Redundant transitions in 94 ms returned []
[2023-03-09 07:03:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:03] [INFO ] Invariant cache hit.
[2023-03-09 07:03:04] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2876 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-07 in 15134 ms.
Starting property specific reduction for BugTracking-PT-q3m008-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:03:04] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10004 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2023-03-09 07:03:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:03:04] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-09 07:03:04] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:03:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:03:04] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2023-03-09 07:03:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:03:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-09 07:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:03:05] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-09 07:03:05] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:03:05] [INFO ] [Nat]Added 241 Read/Feed constraints in 78 ms returned sat
[2023-03-09 07:03:05] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 0 ms to minimize.
[2023-03-09 07:03:06] [INFO ] Deduced a trap composed of 114 places in 337 ms of which 0 ms to minimize.
[2023-03-09 07:03:06] [INFO ] Deduced a trap composed of 47 places in 335 ms of which 1 ms to minimize.
[2023-03-09 07:03:06] [INFO ] Deduced a trap composed of 58 places in 353 ms of which 1 ms to minimize.
[2023-03-09 07:03:07] [INFO ] Deduced a trap composed of 67 places in 354 ms of which 1 ms to minimize.
[2023-03-09 07:03:07] [INFO ] Deduced a trap composed of 45 places in 333 ms of which 1 ms to minimize.
[2023-03-09 07:03:08] [INFO ] Deduced a trap composed of 109 places in 352 ms of which 0 ms to minimize.
[2023-03-09 07:03:08] [INFO ] Deduced a trap composed of 77 places in 408 ms of which 0 ms to minimize.
[2023-03-09 07:03:09] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 0 ms to minimize.
[2023-03-09 07:03:09] [INFO ] Deduced a trap composed of 46 places in 358 ms of which 1 ms to minimize.
[2023-03-09 07:03:09] [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 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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] Max seen :[0]
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 229/229 places, 2747/2747 transitions.
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:03:09] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 5249 ms. (steps per millisecond=190 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2304 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2023-03-09 07:03:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-09 07:03:17] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-09 07:03:17] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-09 07:03:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 07:03:17] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-09 07:03:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 07:03:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-09 07:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 07:03:18] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2023-03-09 07:03:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:03:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 78 ms returned sat
[2023-03-09 07:03:18] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 0 ms to minimize.
[2023-03-09 07:03:19] [INFO ] Deduced a trap composed of 114 places in 258 ms of which 1 ms to minimize.
[2023-03-09 07:03:19] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 1 ms to minimize.
[2023-03-09 07:03:19] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 0 ms to minimize.
[2023-03-09 07:03:19] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 0 ms to minimize.
[2023-03-09 07:03:20] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 1 ms to minimize.
[2023-03-09 07:03:20] [INFO ] Deduced a trap composed of 109 places in 295 ms of which 1 ms to minimize.
[2023-03-09 07:03:20] [INFO ] Deduced a trap composed of 77 places in 251 ms of which 0 ms to minimize.
[2023-03-09 07:03:21] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 0 ms to minimize.
[2023-03-09 07:03:21] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 0 ms to minimize.
[2023-03-09 07:03:22] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 0 ms to minimize.
[2023-03-09 07:03:22] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 0 ms to minimize.
[2023-03-09 07:03:22] [INFO ] Deduced a trap composed of 50 places in 322 ms of which 1 ms to minimize.
[2023-03-09 07:03:23] [INFO ] Deduced a trap composed of 50 places in 278 ms of which 0 ms to minimize.
[2023-03-09 07:03:23] [INFO ] Deduced a trap composed of 74 places in 300 ms of which 0 ms to minimize.
[2023-03-09 07:03:24] [INFO ] Deduced a trap composed of 63 places in 266 ms of which 1 ms to minimize.
[2023-03-09 07:03:24] [INFO ] Deduced a trap composed of 68 places in 284 ms of which 0 ms to minimize.
[2023-03-09 07:03:25] [INFO ] Deduced a trap composed of 88 places in 268 ms of which 1 ms to minimize.
[2023-03-09 07:03:25] [INFO ] Deduced a trap composed of 104 places in 240 ms of which 0 ms to minimize.
[2023-03-09 07:03:26] [INFO ] Deduced a trap composed of 50 places in 406 ms of which 1 ms to minimize.
[2023-03-09 07:03:26] [INFO ] Deduced a trap composed of 17 places in 238 ms of which 1 ms to minimize.
[2023-03-09 07:03:26] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 0 ms to minimize.
[2023-03-09 07:03:27] [INFO ] Deduced a trap composed of 89 places in 305 ms of which 1 ms to minimize.
[2023-03-09 07:03:28] [INFO ] Deduced a trap composed of 70 places in 410 ms of which 0 ms to minimize.
[2023-03-09 07:03:28] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 0 ms to minimize.
[2023-03-09 07:03:28] [INFO ] Deduced a trap composed of 52 places in 364 ms of which 0 ms to minimize.
[2023-03-09 07:03:29] [INFO ] Deduced a trap composed of 70 places in 334 ms of which 1 ms to minimize.
[2023-03-09 07:03:29] [INFO ] Deduced a trap composed of 108 places in 309 ms of which 0 ms to minimize.
[2023-03-09 07:03:30] [INFO ] Deduced a trap composed of 108 places in 314 ms of which 1 ms to minimize.
[2023-03-09 07:03:30] [INFO ] Deduced a trap composed of 107 places in 368 ms of which 1 ms to minimize.
[2023-03-09 07:03:31] [INFO ] Deduced a trap composed of 70 places in 316 ms of which 0 ms to minimize.
[2023-03-09 07:03:32] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 13782 ms
[2023-03-09 07:03:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 233 ms.
[2023-03-09 07:03:32] [INFO ] Added : 8 causal constraints over 2 iterations in 704 ms. Result :sat
Minimization took 694 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 REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 40 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY 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.
[2023-03-09 07:03:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:34] [INFO ] Invariant cache hit.
[2023-03-09 07:03:34] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-09 07:03:34] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:34] [INFO ] Invariant cache hit.
[2023-03-09 07:03:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-09 07:03:35] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2023-03-09 07:03:35] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-09 07:03:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-09 07:03:35] [INFO ] Invariant cache hit.
[2023-03-09 07:03:36] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2715 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m008-UpperBounds-08 in 32640 ms.
[2023-03-09 07:03:37] [INFO ] Flatten gal took : 462 ms
[2023-03-09 07:03:37] [INFO ] Applying decomposition
[2023-03-09 07:03:37] [INFO ] Flatten gal took : 196 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15560468587506170022.txt' '-o' '/tmp/graph15560468587506170022.bin' '-w' '/tmp/graph15560468587506170022.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15560468587506170022.bin' '-l' '-1' '-v' '-w' '/tmp/graph15560468587506170022.weights' '-q' '0' '-e' '0.001'
[2023-03-09 07:03:38] [INFO ] Decomposing Gal with order
[2023-03-09 07:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 07:03:38] [INFO ] Removed a total of 280 redundant transitions.
[2023-03-09 07:03:39] [INFO ] Flatten gal took : 504 ms
[2023-03-09 07:03:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 27 ms.
[2023-03-09 07:03:39] [INFO ] Time to serialize gal into /tmp/UpperBounds6998853738839139125.gal : 50 ms
[2023-03-09 07:03:39] [INFO ] Time to serialize properties into /tmp/UpperBounds17330891494803089569.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6998853738839139125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17330891494803089569.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds17330891494803089569.prop.
Detected timeout of ITS tools.
[2023-03-09 07:24:40] [INFO ] Flatten gal took : 1089 ms
[2023-03-09 07:24:41] [INFO ] Time to serialize gal into /tmp/UpperBounds3475646806040208504.gal : 183 ms
[2023-03-09 07:24:41] [INFO ] Time to serialize properties into /tmp/UpperBounds4016983405239735701.prop : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3475646806040208504.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4016983405239735701.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...304
Loading property file /tmp/UpperBounds4016983405239735701.prop.
Detected timeout of ITS tools.
[2023-03-09 07:45:39] [INFO ] Flatten gal took : 615 ms
[2023-03-09 07:45:41] [INFO ] Input system was already deterministic with 2747 transitions.
[2023-03-09 07:45:41] [INFO ] Transformed 229 places.
[2023-03-09 07:45:41] [INFO ] Transformed 2747 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2023-03-09 07:45:42] [INFO ] Time to serialize gal into /tmp/UpperBounds1886162044052487290.gal : 24 ms
[2023-03-09 07:45:42] [INFO ] Time to serialize properties into /tmp/UpperBounds12416491412323409011.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1886162044052487290.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12416491412323409011.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12416491412323409011.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 8423700 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16098140 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q3m008"
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-5348"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q3m008, 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 r037-tajo-167813690200341"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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