fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r043-tajo-167813696700365
Last Updated
May 14, 2023

About the Execution of Smart+red for BugTracking-PT-q3m064

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16204.088 623154.00 675356.00 3897.10 0 0 0 1 0 ? 0 0 0 0 0 ? ? 0 0 1 normal

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.r043-tajo-167813696700365.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 smartxred
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 r043-tajo-167813696700365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 06:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K 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.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 07:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-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 1678785825872

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:23:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 09:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:23:48] [INFO ] Load time of PNML (sax parser for PT used): 725 ms
[2023-03-14 09:23:48] [INFO ] Transformed 754 places.
[2023-03-14 09:23:48] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:23:48] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 901 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 98 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-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-UpperBounds-08 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-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
[2023-03-14 09:23:48] [INFO ] Computed 10 place invariants in 45 ms
FORMULA BugTracking-PT-q3m064-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10044 steps, including 11 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q3m064-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
[2023-03-14 09:23:48] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-14 09:23:48] [INFO ] Computed 10 place invariants in 24 ms
[2023-03-14 09:23:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:49] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-14 09:23:49] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-14 09:23:49] [INFO ] [Real]Added 255 Read/Feed constraints in 32 ms returned sat
[2023-03-14 09:23:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:23:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:49] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-03-14 09:23:50] [INFO ] [Nat]Added 255 Read/Feed constraints in 38 ms returned sat
[2023-03-14 09:23:50] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 238 ms.
[2023-03-14 09:23:50] [INFO ] Added : 2 causal constraints over 1 iterations in 523 ms. Result :sat
Minimization took 380 ms.
[2023-03-14 09:23:51] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:51] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2023-03-14 09:23:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:23:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 09:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:52] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-14 09:23:52] [INFO ] [Nat]Added 255 Read/Feed constraints in 155 ms returned sat
[2023-03-14 09:23:52] [INFO ] Deduced a trap composed of 73 places in 544 ms of which 6 ms to minimize.
[2023-03-14 09:23:53] [INFO ] Deduced a trap composed of 107 places in 477 ms of which 1 ms to minimize.
[2023-03-14 09:23:54] [INFO ] Deduced a trap composed of 69 places in 489 ms of which 1 ms to minimize.
[2023-03-14 09:23:54] [INFO ] Deduced a trap composed of 14 places in 322 ms of which 2 ms to minimize.
[2023-03-14 09:23:55] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 2 ms to minimize.
[2023-03-14 09:23:55] [INFO ] Deduced a trap composed of 52 places in 333 ms of which 0 ms to minimize.
[2023-03-14 09:23:56] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 1 ms to minimize.
[2023-03-14 09:23:56] [INFO ] Deduced a trap composed of 85 places in 320 ms of which 1 ms to minimize.
[2023-03-14 09:23:57] [INFO ] Deduced a trap composed of 12 places in 581 ms of which 1 ms to minimize.
[2023-03-14 09:23:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2023-03-14 09:23:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:57] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-14 09:23:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:23:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:23:58] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2023-03-14 09:23:58] [INFO ] [Nat]Added 255 Read/Feed constraints in 81 ms returned sat
[2023-03-14 09:23:58] [INFO ] Deduced a trap composed of 57 places in 510 ms of which 1 ms to minimize.
[2023-03-14 09:23:59] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 0 ms to minimize.
[2023-03-14 09:23:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1131 ms
[2023-03-14 09:23:59] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 198 ms.
[2023-03-14 09:24:00] [INFO ] Added : 4 causal constraints over 1 iterations in 533 ms. Result :sat
Minimization took 273 ms.
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 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.11 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 3 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 313 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 314 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-14 09:24:00] [INFO ] Computed 8 place invariants in 24 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 1225 ms. (steps per millisecond=816 ) properties (out of 3) 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 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1794 ms. (steps per millisecond=557 ) properties (out of 3) seen :0
[2023-03-14 09:24:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:07] [INFO ] Computed 8 place invariants in 30 ms
[2023-03-14 09:24:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:08] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-14 09:24:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:08] [INFO ] [Real]Added 241 Read/Feed constraints in 48 ms returned sat
[2023-03-14 09:24:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:08] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-14 09:24:09] [INFO ] [Nat]Added 241 Read/Feed constraints in 76 ms returned sat
[2023-03-14 09:24:09] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 0 ms to minimize.
[2023-03-14 09:24:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 422 ms
[2023-03-14 09:24:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 185 ms.
[2023-03-14 09:24:10] [INFO ] Added : 1 causal constraints over 1 iterations in 530 ms. Result :sat
Minimization took 290 ms.
[2023-03-14 09:24:10] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:10] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-14 09:24:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:11] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2023-03-14 09:24:11] [INFO ] [Nat]Added 241 Read/Feed constraints in 150 ms returned sat
[2023-03-14 09:24:11] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 1 ms to minimize.
[2023-03-14 09:24:12] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 1 ms to minimize.
[2023-03-14 09:24:12] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 1 ms to minimize.
[2023-03-14 09:24:13] [INFO ] Deduced a trap composed of 47 places in 325 ms of which 0 ms to minimize.
[2023-03-14 09:24:13] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 0 ms to minimize.
[2023-03-14 09:24:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2009 ms
[2023-03-14 09:24:13] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 190 ms.
[2023-03-14 09:24:14] [INFO ] Added : 4 causal constraints over 1 iterations in 486 ms. Result :sat
Minimization took 222 ms.
[2023-03-14 09:24:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:14] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-14 09:24:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:15] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-14 09:24:15] [INFO ] [Nat]Added 241 Read/Feed constraints in 77 ms returned sat
[2023-03-14 09:24:15] [INFO ] Deduced a trap composed of 46 places in 412 ms of which 1 ms to minimize.
[2023-03-14 09:24:16] [INFO ] Deduced a trap composed of 67 places in 353 ms of which 1 ms to minimize.
[2023-03-14 09:24:16] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 0 ms to minimize.
[2023-03-14 09:24:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1413 ms
[2023-03-14 09:24:16] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 193 ms.
[2023-03-14 09:24:17] [INFO ] Added : 2 causal constraints over 1 iterations in 512 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 0, 0]
Support contains 3 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.
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.
[2023-03-14 09:24:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:20] [INFO ] Invariant cache hit.
[2023-03-14 09:24:20] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-14 09:24:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:20] [INFO ] Invariant cache hit.
[2023-03-14 09:24:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:22] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1808 ms to find 0 implicit places.
[2023-03-14 09:24:22] [INFO ] Redundant transitions in 245 ms returned []
[2023-03-14 09:24:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:22] [INFO ] Invariant cache hit.
[2023-03-14 09:24:23] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3117 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-14 09:24:23] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 982 ms. (steps per millisecond=1018 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1935 ms. (steps per millisecond=516 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1904 ms. (steps per millisecond=525 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1903 ms. (steps per millisecond=525 ) properties (out of 3) seen :0
[2023-03-14 09:24:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:30] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-14 09:24:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:30] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-14 09:24:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:30] [INFO ] [Real]Added 241 Read/Feed constraints in 45 ms returned sat
[2023-03-14 09:24:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:31] [INFO ] [Nat]Absence check using state equation in 366 ms returned sat
[2023-03-14 09:24:31] [INFO ] [Nat]Added 241 Read/Feed constraints in 69 ms returned sat
[2023-03-14 09:24:31] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 0 ms to minimize.
[2023-03-14 09:24:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 426 ms
[2023-03-14 09:24:32] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 227 ms.
[2023-03-14 09:24:32] [INFO ] Added : 1 causal constraints over 1 iterations in 509 ms. Result :sat
Minimization took 291 ms.
[2023-03-14 09:24:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:33] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-14 09:24:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:33] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2023-03-14 09:24:33] [INFO ] [Nat]Added 241 Read/Feed constraints in 143 ms returned sat
[2023-03-14 09:24:34] [INFO ] Deduced a trap composed of 10 places in 327 ms of which 1 ms to minimize.
[2023-03-14 09:24:34] [INFO ] Deduced a trap composed of 10 places in 351 ms of which 1 ms to minimize.
[2023-03-14 09:24:35] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 1 ms to minimize.
[2023-03-14 09:24:35] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 1 ms to minimize.
[2023-03-14 09:24:35] [INFO ] Deduced a trap composed of 40 places in 276 ms of which 0 ms to minimize.
[2023-03-14 09:24:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1973 ms
[2023-03-14 09:24:36] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 215 ms.
[2023-03-14 09:24:36] [INFO ] Added : 4 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 324 ms.
[2023-03-14 09:24:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:37] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-14 09:24:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:38] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2023-03-14 09:24:38] [INFO ] [Nat]Added 241 Read/Feed constraints in 80 ms returned sat
[2023-03-14 09:24:38] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 0 ms to minimize.
[2023-03-14 09:24:38] [INFO ] Deduced a trap composed of 67 places in 329 ms of which 1 ms to minimize.
[2023-03-14 09:24:39] [INFO ] Deduced a trap composed of 19 places in 429 ms of which 1 ms to minimize.
[2023-03-14 09:24:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1422 ms
[2023-03-14 09:24:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 244 ms.
[2023-03-14 09:24:40] [INFO ] Added : 2 causal constraints over 1 iterations in 572 ms. Result :sat
Minimization took 3004 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 0, 0]
Support contains 3 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 54 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 49 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:24:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:43] [INFO ] Invariant cache hit.
[2023-03-14 09:24:43] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-14 09:24:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:43] [INFO ] Invariant cache hit.
[2023-03-14 09:24:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:45] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-03-14 09:24:45] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-14 09:24:45] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:45] [INFO ] Invariant cache hit.
[2023-03-14 09:24:46] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3078 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-05
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:46] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10047 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-14 09:24:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:46] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-14 09:24:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:46] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-14 09:24:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:47] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2023-03-14 09:24:47] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:47] [INFO ] [Nat]Added 241 Read/Feed constraints in 70 ms returned sat
[2023-03-14 09:24:47] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 1 ms to minimize.
[2023-03-14 09:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 401 ms
[2023-03-14 09:24:48] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 252 ms.
[2023-03-14 09:24:48] [INFO ] Added : 2 causal constraints over 1 iterations in 487 ms. Result :sat
Minimization took 376 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 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-14 09:24:49] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2564 ms. (steps per millisecond=390 ) properties (out of 1) seen :0
[2023-03-14 09:24:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:52] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-14 09:24:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:53] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-14 09:24:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:24:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:53] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-14 09:24:53] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:53] [INFO ] [Nat]Added 241 Read/Feed constraints in 62 ms returned sat
[2023-03-14 09:24:54] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2023-03-14 09:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 375 ms
[2023-03-14 09:24:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 185 ms.
[2023-03-14 09:24:54] [INFO ] Added : 2 causal constraints over 1 iterations in 506 ms. Result :sat
Minimization took 321 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 42 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:24:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:55] [INFO ] Invariant cache hit.
[2023-03-14 09:24:55] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-14 09:24:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:55] [INFO ] Invariant cache hit.
[2023-03-14 09:24:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:57] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1718 ms to find 0 implicit places.
[2023-03-14 09:24:57] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-14 09:24:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:24:57] [INFO ] Invariant cache hit.
[2023-03-14 09:24:58] [INFO ] Dead Transitions using invariants and state equation in 983 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-q3m064-UpperBounds-05 in 11794 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-11
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:58] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 10017 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-14 09:24:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:24:58] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-14 09:24:58] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:58] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-14 09:24:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:24:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:24:59] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-03-14 09:24:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:24:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 153 ms returned sat
[2023-03-14 09:24:59] [INFO ] Deduced a trap composed of 10 places in 334 ms of which 1 ms to minimize.
[2023-03-14 09:24:59] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 0 ms to minimize.
[2023-03-14 09:25:00] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 1 ms to minimize.
[2023-03-14 09:25:00] [INFO ] Deduced a trap composed of 47 places in 340 ms of which 5 ms to minimize.
[2023-03-14 09:25:01] [INFO ] Deduced a trap composed of 40 places in 319 ms of which 0 ms to minimize.
[2023-03-14 09:25:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2041 ms
[2023-03-14 09:25:01] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 265 ms.
[2023-03-14 09:25:01] [INFO ] Added : 4 causal constraints over 1 iterations in 576 ms. Result :sat
Minimization took 315 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 48 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 49 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-14 09:25:02] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000022 steps, including 2 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1954 ms. (steps per millisecond=511 ) properties (out of 1) seen :0
[2023-03-14 09:25:05] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:25:05] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-14 09:25:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:05] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-14 09:25:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:25:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:06] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-14 09:25:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:25:06] [INFO ] [Nat]Added 241 Read/Feed constraints in 146 ms returned sat
[2023-03-14 09:25:07] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 0 ms to minimize.
[2023-03-14 09:25:07] [INFO ] Deduced a trap composed of 10 places in 369 ms of which 1 ms to minimize.
[2023-03-14 09:25:07] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 1 ms to minimize.
[2023-03-14 09:25:08] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 0 ms to minimize.
[2023-03-14 09:25:08] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 0 ms to minimize.
[2023-03-14 09:25:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1875 ms
[2023-03-14 09:25:08] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 182 ms.
[2023-03-14 09:25:08] [INFO ] Added : 4 causal constraints over 1 iterations in 463 ms. Result :sat
Minimization took 320 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 70 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 70 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 59 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:25:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:09] [INFO ] Invariant cache hit.
[2023-03-14 09:25:09] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-14 09:25:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:09] [INFO ] Invariant cache hit.
[2023-03-14 09:25:10] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:25:11] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2023-03-14 09:25:11] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-14 09:25:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:11] [INFO ] Invariant cache hit.
[2023-03-14 09:25:12] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2858 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-11 in 14170 ms.
Starting property specific reduction for BugTracking-PT-q3m064-UpperBounds-12
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:25:12] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 10038 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2023-03-14 09:25:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:25:12] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-14 09:25:12] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:25:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:12] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-03-14 09:25:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:25:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:13] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-14 09:25:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:25:13] [INFO ] [Nat]Added 241 Read/Feed constraints in 81 ms returned sat
[2023-03-14 09:25:13] [INFO ] Deduced a trap composed of 46 places in 389 ms of which 4 ms to minimize.
[2023-03-14 09:25:14] [INFO ] Deduced a trap composed of 67 places in 356 ms of which 1 ms to minimize.
[2023-03-14 09:25:14] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 1 ms to minimize.
[2023-03-14 09:25:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1351 ms
[2023-03-14 09:25:14] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 225 ms.
[2023-03-14 09:25:15] [INFO ] Added : 2 causal constraints over 1 iterations in 536 ms. Result :sat
Minimization took 2583 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 68 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 70 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-14 09:25:17] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 1279 ms. (steps per millisecond=781 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1985 ms. (steps per millisecond=503 ) properties (out of 1) seen :0
[2023-03-14 09:25:21] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-14 09:25:21] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-14 09:25:21] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:25:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:21] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-14 09:25:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:25:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:25:22] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2023-03-14 09:25:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:25:22] [INFO ] [Nat]Added 241 Read/Feed constraints in 82 ms returned sat
[2023-03-14 09:25:22] [INFO ] Deduced a trap composed of 46 places in 420 ms of which 0 ms to minimize.
[2023-03-14 09:25:23] [INFO ] Deduced a trap composed of 67 places in 370 ms of which 1 ms to minimize.
[2023-03-14 09:25:23] [INFO ] Deduced a trap composed of 19 places in 364 ms of which 1 ms to minimize.
[2023-03-14 09:25:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1454 ms
[2023-03-14 09:25:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 240 ms.
[2023-03-14 09:25:24] [INFO ] Added : 2 causal constraints over 1 iterations in 564 ms. Result :sat
Minimization took 3006 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 67 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 67 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 75 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-14 09:25:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:27] [INFO ] Invariant cache hit.
[2023-03-14 09:25:27] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-14 09:25:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:27] [INFO ] Invariant cache hit.
[2023-03-14 09:25:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-14 09:25:29] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2023-03-14 09:25:29] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-14 09:25:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-14 09:25:29] [INFO ] Invariant cache hit.
[2023-03-14 09:25:30] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2907 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m064-UpperBounds-12 in 17865 ms.
[2023-03-14 09:25:30] [INFO ] Flatten gal took : 225 ms
[2023-03-14 09:25:30] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-14 09:25:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 13 ms.
Total runtime 103304 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q3m064
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 229 places, 2747 transitions, 13485 arcs.
Final Score: 30890.136
Took : 60 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678786449026

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

+ 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 831 Killed ${SMART}/smart ${INPUT_SM}

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="smartxred"
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 smartxred"
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 r043-tajo-167813696700365"
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 ;