About the Execution of LTSMin+red for BugTracking-PT-q3m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1369.663 | 3600000.00 | 13919210.00 | 121.00 | 0 0 0 ? ? 4 0 0 ? ? 0 0 1 0 0 ? | 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.r041-tajo-167813694500333.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 ltsminxred
Input is BugTracking-PT-q3m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694500333
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 07:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 07:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 07:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 07:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 08:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 08:15 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-q3m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678626600131
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m004
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:10:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 13:10:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:10:02] [INFO ] Load time of PNML (sax parser for PT used): 724 ms
[2023-03-12 13:10:02] [INFO ] Transformed 754 places.
[2023-03-12 13:10:02] [INFO ] Transformed 27370 transitions.
[2023-03-12 13:10:02] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 904 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 514 places in 119 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m004-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-12 13:10:03] [INFO ] Computed 10 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 117 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :5
FORMULA BugTracking-PT-q3m004-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q3m004-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
[2023-03-12 13:10:03] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2023-03-12 13:10:03] [INFO ] Computed 10 place invariants in 14 ms
[2023-03-12 13:10:03] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:03] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-12 13:10:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 13:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:04] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2023-03-12 13:10:04] [INFO ] State equation strengthened by 255 read => feed constraints.
[2023-03-12 13:10:04] [INFO ] [Nat]Added 255 Read/Feed constraints in 254 ms returned sat
[2023-03-12 13:10:05] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 3 ms to minimize.
[2023-03-12 13:10:05] [INFO ] Deduced a trap composed of 8 places in 284 ms of which 1 ms to minimize.
[2023-03-12 13:10:05] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 1 ms to minimize.
[2023-03-12 13:10:06] [INFO ] Deduced a trap composed of 12 places in 290 ms of which 2 ms to minimize.
[2023-03-12 13:10:06] [INFO ] Deduced a trap composed of 54 places in 324 ms of which 2 ms to minimize.
[2023-03-12 13:10:07] [INFO ] Deduced a trap composed of 64 places in 315 ms of which 1 ms to minimize.
[2023-03-12 13:10:07] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 1 ms to minimize.
[2023-03-12 13:10:07] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 1 ms to minimize.
[2023-03-12 13:10:07] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 0 ms to minimize.
[2023-03-12 13:10:08] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 2 ms to minimize.
[2023-03-12 13:10:08] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 1 ms to minimize.
[2023-03-12 13:10:09] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 0 ms to minimize.
[2023-03-12 13:10: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: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-12 13:10:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:09] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2023-03-12 13:10:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:10] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-12 13:10:10] [INFO ] [Nat]Added 255 Read/Feed constraints in 81 ms returned sat
[2023-03-12 13:10:10] [INFO ] Deduced a trap composed of 72 places in 496 ms of which 1 ms to minimize.
[2023-03-12 13:10:11] [INFO ] Deduced a trap composed of 13 places in 532 ms of which 1 ms to minimize.
[2023-03-12 13:10:11] [INFO ] Deduced a trap composed of 112 places in 534 ms of which 1 ms to minimize.
[2023-03-12 13:10:12] [INFO ] Deduced a trap composed of 78 places in 581 ms of which 0 ms to minimize.
[2023-03-12 13:10:13] [INFO ] Deduced a trap composed of 48 places in 493 ms of which 0 ms to minimize.
[2023-03-12 13:10:13] [INFO ] Deduced a trap composed of 27 places in 446 ms of which 0 ms to minimize.
[2023-03-12 13:10:14] [INFO ] Deduced a trap composed of 50 places in 466 ms of which 1 ms to minimize.
[2023-03-12 13:10:14] [INFO ] Deduced a trap composed of 75 places in 323 ms of which 1 ms to minimize.
[2023-03-12 13:10:14] [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-12 13:10:14] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:15] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-12 13:10:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 13:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:15] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-12 13:10:15] [INFO ] [Nat]Added 255 Read/Feed constraints in 102 ms returned sat
[2023-03-12 13:10:16] [INFO ] Deduced a trap composed of 26 places in 304 ms of which 1 ms to minimize.
[2023-03-12 13:10:16] [INFO ] Deduced a trap composed of 17 places in 273 ms of which 1 ms to minimize.
[2023-03-12 13:10:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
[2023-03-12 13:10:16] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 302 ms.
[2023-03-12 13:10:17] [INFO ] Added : 6 causal constraints over 2 iterations in 717 ms. Result :sat
Minimization took 341 ms.
[2023-03-12 13:10:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-12 13:10:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:18] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-12 13:10:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:18] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-12 13:10:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 90 ms returned sat
[2023-03-12 13:10:19] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 240 ms.
[2023-03-12 13:10:19] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 0 ms to minimize.
[2023-03-12 13:10:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 530 ms
[2023-03-12 13:10:20] [INFO ] Added : 9 causal constraints over 2 iterations in 1337 ms. Result :sat
Minimization took 347 ms.
[2023-03-12 13:10:20] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:21] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-12 13:10:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:21] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-12 13:10:21] [INFO ] [Nat]Added 255 Read/Feed constraints in 93 ms returned sat
[2023-03-12 13:10:21] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 190 ms.
[2023-03-12 13:10:22] [INFO ] Added : 5 causal constraints over 1 iterations in 494 ms. Result :sat
Minimization took 345 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 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 330 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 332 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-12 13:10:23] [INFO ] Computed 8 place invariants in 26 ms
Incomplete random walk after 1000003 steps, including 3 resets, run finished after 6268 ms. (steps per millisecond=159 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2068 ms. (steps per millisecond=483 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2042 ms. (steps per millisecond=489 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2195 ms. (steps per millisecond=455 ) properties (out of 5) seen :0
[2023-03-12 13:10:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:10:39] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-12 13:10:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:40] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-12 13:10:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:40] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-12 13:10:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:10:40] [INFO ] [Nat]Added 241 Read/Feed constraints in 73 ms returned sat
[2023-03-12 13:10:41] [INFO ] Deduced a trap composed of 60 places in 344 ms of which 1 ms to minimize.
[2023-03-12 13:10:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2023-03-12 13:10:41] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 174 ms.
[2023-03-12 13:10:42] [INFO ] Deduced a trap composed of 17 places in 384 ms of which 0 ms to minimize.
[2023-03-12 13:10:43] [INFO ] Deduced a trap composed of 62 places in 393 ms of which 1 ms to minimize.
[2023-03-12 13:10:43] [INFO ] Deduced a trap composed of 42 places in 395 ms of which 0 ms to minimize.
[2023-03-12 13:10:44] [INFO ] Deduced a trap composed of 75 places in 399 ms of which 1 ms to minimize.
[2023-03-12 13:10:44] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 1 ms to minimize.
[2023-03-12 13:10:45] [INFO ] Deduced a trap composed of 22 places in 435 ms of which 2 ms to minimize.
[2023-03-12 13:10:45] [INFO ] Deduced a trap composed of 73 places in 430 ms of which 1 ms to minimize.
[2023-03-12 13:10:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3808 ms
[2023-03-12 13:10:46] [INFO ] Added : 7 causal constraints over 4 iterations in 4741 ms. Result :sat
Minimization took 302 ms.
[2023-03-12 13:10:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:47] [INFO ] [Real]Absence check using state equation in 420 ms returned sat
[2023-03-12 13:10:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:47] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2023-03-12 13:10:47] [INFO ] [Nat]Added 241 Read/Feed constraints in 147 ms returned sat
[2023-03-12 13:10:48] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 1 ms to minimize.
[2023-03-12 13:10:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2023-03-12 13:10:48] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 236 ms.
[2023-03-12 13:10:48] [INFO ] Added : 3 causal constraints over 1 iterations in 585 ms. Result :sat
Minimization took 261 ms.
[2023-03-12 13:10:49] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:49] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-12 13:10:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:10:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:50] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-12 13:10:50] [INFO ] [Nat]Added 241 Read/Feed constraints in 201 ms returned sat
[2023-03-12 13:10:50] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2023-03-12 13:10:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2023-03-12 13:10:51] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 252 ms.
[2023-03-12 13:10:51] [INFO ] Added : 6 causal constraints over 2 iterations in 662 ms. Result :sat
Minimization took 320 ms.
[2023-03-12 13:10:51] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:52] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-12 13:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:52] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2023-03-12 13:10:53] [INFO ] [Nat]Added 241 Read/Feed constraints in 259 ms returned sat
[2023-03-12 13:10:53] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 2 ms to minimize.
[2023-03-12 13:10:53] [INFO ] Deduced a trap composed of 47 places in 219 ms of which 4 ms to minimize.
[2023-03-12 13:10:54] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 0 ms to minimize.
[2023-03-12 13:10:54] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 1 ms to minimize.
[2023-03-12 13:10:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1330 ms
[2023-03-12 13:10:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 201 ms.
[2023-03-12 13:10:55] [INFO ] Added : 7 causal constraints over 2 iterations in 599 ms. Result :sat
Minimization took 344 ms.
[2023-03-12 13:10:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:55] [INFO ] [Real]Absence check using state equation in 381 ms returned sat
[2023-03-12 13:10:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:10:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:10:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:10:56] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-12 13:10:56] [INFO ] [Nat]Added 241 Read/Feed constraints in 118 ms returned sat
[2023-03-12 13:10:56] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 0 ms to minimize.
[2023-03-12 13:10:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-12 13:10:57] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 213 ms.
[2023-03-12 13:10:57] [INFO ] Added : 4 causal constraints over 1 iterations in 517 ms. Result :sat
Minimization took 299 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 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 56 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:10:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:10:58] [INFO ] Invariant cache hit.
[2023-03-12 13:10:59] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-12 13:10:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:10:59] [INFO ] Invariant cache hit.
[2023-03-12 13:10:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:00] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2023-03-12 13:11:01] [INFO ] Redundant transitions in 282 ms returned []
[2023-03-12 13:11:01] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:01] [INFO ] Invariant cache hit.
[2023-03-12 13:11:01] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3370 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-03
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:01] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 10 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 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2023-03-12 13:11:02] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:02] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 13:11:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:02] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2023-03-12 13:11:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:11:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:11:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:02] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-12 13:11:03] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:03] [INFO ] [Nat]Added 241 Read/Feed constraints in 56 ms returned sat
[2023-03-12 13:11:03] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 0 ms to minimize.
[2023-03-12 13:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 495 ms
[2023-03-12 13:11:03] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 214 ms.
[2023-03-12 13:11:04] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 0 ms to minimize.
[2023-03-12 13:11:05] [INFO ] Deduced a trap composed of 62 places in 409 ms of which 1 ms to minimize.
[2023-03-12 13:11:05] [INFO ] Deduced a trap composed of 42 places in 430 ms of which 1 ms to minimize.
[2023-03-12 13:11:06] [INFO ] Deduced a trap composed of 75 places in 425 ms of which 0 ms to minimize.
[2023-03-12 13:11:06] [INFO ] Deduced a trap composed of 76 places in 425 ms of which 1 ms to minimize.
[2023-03-12 13:11:07] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 1 ms to minimize.
[2023-03-12 13:11:07] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 3295 ms
[2023-03-12 13:11:08] [INFO ] Deduced a trap composed of 9 places in 573 ms of which 0 ms to minimize.
[2023-03-12 13:11:08] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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 51 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 52 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-12 13:11:08] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6418 ms. (steps per millisecond=155 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2418 ms. (steps per millisecond=413 ) properties (out of 1) seen :0
[2023-03-12 13:11:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:17] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 13:11:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:17] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-12 13:11:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:11:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:17] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2023-03-12 13:11:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:18] [INFO ] [Nat]Added 241 Read/Feed constraints in 162 ms returned sat
[2023-03-12 13:11:18] [INFO ] Deduced a trap composed of 60 places in 363 ms of which 1 ms to minimize.
[2023-03-12 13:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2023-03-12 13:11:18] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 233 ms.
[2023-03-12 13:11:20] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 1 ms to minimize.
[2023-03-12 13:11:20] [INFO ] Deduced a trap composed of 62 places in 421 ms of which 1 ms to minimize.
[2023-03-12 13:11:21] [INFO ] Deduced a trap composed of 42 places in 479 ms of which 1 ms to minimize.
[2023-03-12 13:11:21] [INFO ] Deduced a trap composed of 75 places in 438 ms of which 2 ms to minimize.
[2023-03-12 13:11:22] [INFO ] Deduced a trap composed of 76 places in 429 ms of which 0 ms to minimize.
[2023-03-12 13:11:22] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-12 13:11:23] [INFO ] Deduced a trap composed of 73 places in 433 ms of which 1 ms to minimize.
[2023-03-12 13:11:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4105 ms
[2023-03-12 13:11:23] [INFO ] Added : 7 causal constraints over 4 iterations in 5025 ms. Result :sat
Minimization took 340 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 46 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 46 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 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:11:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:24] [INFO ] Invariant cache hit.
[2023-03-12 13:11:24] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-12 13:11:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:24] [INFO ] Invariant cache hit.
[2023-03-12 13:11:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:26] [INFO ] Implicit Places using invariants and state equation in 1754 ms returned []
Implicit Place search using SMT with State Equation took 2189 ms to find 0 implicit places.
[2023-03-12 13:11:26] [INFO ] Redundant transitions in 132 ms returned []
[2023-03-12 13:11:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:26] [INFO ] Invariant cache hit.
[2023-03-12 13:11:27] [INFO ] Dead Transitions using invariants and state equation in 1058 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3440 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-03 in 25764 ms.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-04
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:27] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 13:11:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:27] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 13:11:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:28] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-03-12 13:11:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:11:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:28] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2023-03-12 13:11:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 149 ms returned sat
[2023-03-12 13:11:29] [INFO ] Deduced a trap composed of 21 places in 312 ms of which 0 ms to minimize.
[2023-03-12 13:11:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-12 13:11:29] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 202 ms.
[2023-03-12 13:11:29] [INFO ] Added : 3 causal constraints over 1 iterations in 522 ms. Result :sat
Minimization took 234 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 47 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-12 13:11:30] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9298 ms. (steps per millisecond=107 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2619 ms. (steps per millisecond=381 ) properties (out of 1) seen :0
[2023-03-12 13:11:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:42] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 13:11:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:42] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-12 13:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:11:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:42] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2023-03-12 13:11:42] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:43] [INFO ] [Nat]Added 241 Read/Feed constraints in 155 ms returned sat
[2023-03-12 13:11:43] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 0 ms to minimize.
[2023-03-12 13:11:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 457 ms
[2023-03-12 13:11:43] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 193 ms.
[2023-03-12 13:11:43] [INFO ] Added : 3 causal constraints over 1 iterations in 462 ms. Result :sat
Minimization took 269 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 37 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 37 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 33 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:11:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:44] [INFO ] Invariant cache hit.
[2023-03-12 13:11:44] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-12 13:11:44] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:44] [INFO ] Invariant cache hit.
[2023-03-12 13:11:45] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:46] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2023-03-12 13:11:46] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 13:11:46] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:11:46] [INFO ] Invariant cache hit.
[2023-03-12 13:11:47] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2923 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-04 in 19629 ms.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-08
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:47] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 6 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2023-03-12 13:11:47] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:11:47] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 13:11:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:47] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-12 13:11:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:11:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:11:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:11:48] [INFO ] [Nat]Absence check using state equation in 361 ms returned sat
[2023-03-12 13:11:48] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:11:48] [INFO ] [Nat]Added 241 Read/Feed constraints in 223 ms returned sat
[2023-03-12 13:11:48] [INFO ] Deduced a trap composed of 14 places in 215 ms of which 4 ms to minimize.
[2023-03-12 13:11:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2023-03-12 13:11:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 212 ms.
[2023-03-12 13:11:49] [INFO ] Added : 6 causal constraints over 2 iterations in 676 ms. Result :sat
Minimization took 323 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 57 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 58 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-12 13:11:50] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000001 steps, including 3 resets, run finished after 7969 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2479 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
[2023-03-12 13:12:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:00] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 13:12:00] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 13:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:01] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2023-03-12 13:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:12:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:01] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-12 13:12:01] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:02] [INFO ] [Nat]Added 241 Read/Feed constraints in 249 ms returned sat
[2023-03-12 13:12:02] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 1 ms to minimize.
[2023-03-12 13:12:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 387 ms
[2023-03-12 13:12:02] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 225 ms.
[2023-03-12 13:12:03] [INFO ] Added : 6 causal constraints over 2 iterations in 651 ms. Result :sat
Minimization took 318 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 72 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 73 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-12 13:12:03] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:03] [INFO ] Invariant cache hit.
[2023-03-12 13:12:04] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-12 13:12:04] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:04] [INFO ] Invariant cache hit.
[2023-03-12 13:12:04] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:06] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2123 ms to find 0 implicit places.
[2023-03-12 13:12:06] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-12 13:12:06] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:06] [INFO ] Invariant cache hit.
[2023-03-12 13:12:07] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3154 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-08 in 19748 ms.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-09
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:07] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) 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 1) seen :0
[2023-03-12 13:12:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:07] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 13:12:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:07] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-12 13:12:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:12:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:07] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2023-03-12 13:12:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:08] [INFO ] [Nat]Added 241 Read/Feed constraints in 159 ms returned sat
[2023-03-12 13:12:08] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 0 ms to minimize.
[2023-03-12 13:12:08] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 1 ms to minimize.
[2023-03-12 13:12:08] [INFO ] Deduced a trap composed of 34 places in 178 ms of which 0 ms to minimize.
[2023-03-12 13:12:09] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2023-03-12 13:12:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1006 ms
[2023-03-12 13:12:09] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 157 ms.
[2023-03-12 13:12:09] [INFO ] Added : 7 causal constraints over 2 iterations in 443 ms. Result :sat
Minimization took 229 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 32 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 33 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-12 13:12:10] [INFO ] Computed 8 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8229 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2128 ms. (steps per millisecond=469 ) properties (out of 1) seen :0
[2023-03-12 13:12:20] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:20] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 13:12:20] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:20] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-12 13:12:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:12:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:21] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2023-03-12 13:12:21] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:21] [INFO ] [Nat]Added 241 Read/Feed constraints in 165 ms returned sat
[2023-03-12 13:12:21] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2023-03-12 13:12:22] [INFO ] Deduced a trap composed of 47 places in 261 ms of which 1 ms to minimize.
[2023-03-12 13:12:22] [INFO ] Deduced a trap composed of 34 places in 268 ms of which 3 ms to minimize.
[2023-03-12 13:12:22] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 0 ms to minimize.
[2023-03-12 13:12:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1361 ms
[2023-03-12 13:12:23] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 242 ms.
[2023-03-12 13:12:23] [INFO ] Added : 7 causal constraints over 2 iterations in 686 ms. Result :sat
Minimization took 311 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 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 37 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:12:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:24] [INFO ] Invariant cache hit.
[2023-03-12 13:12:24] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-12 13:12:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:24] [INFO ] Invariant cache hit.
[2023-03-12 13:12:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:26] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
[2023-03-12 13:12:26] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-12 13:12:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:26] [INFO ] Invariant cache hit.
[2023-03-12 13:12:27] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2819 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-09 in 19999 ms.
Starting property specific reduction for BugTracking-PT-q3m004-UpperBounds-15
Normalized transition count is 2618 out of 2747 initially.
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:27] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2023-03-12 13:12:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:27] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 13:12:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:12:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:27] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2023-03-12 13:12:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:12:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:12:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:27] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-12 13:12:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:28] [INFO ] [Nat]Added 241 Read/Feed constraints in 115 ms returned sat
[2023-03-12 13:12:28] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2023-03-12 13:12:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2023-03-12 13:12:28] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 195 ms.
[2023-03-12 13:12:28] [INFO ] Added : 4 causal constraints over 1 iterations in 469 ms. Result :sat
Minimization took 229 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-12 13:12:29] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 6525 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2387 ms. (steps per millisecond=418 ) properties (out of 1) seen :0
[2023-03-12 13:12:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:12:38] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 13:12:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 13:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:38] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-12 13:12:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 13:12:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 13:12:39] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-12 13:12:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:39] [INFO ] [Nat]Added 241 Read/Feed constraints in 116 ms returned sat
[2023-03-12 13:12:39] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 17 ms to minimize.
[2023-03-12 13:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 278 ms
[2023-03-12 13:12:39] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 158 ms.
[2023-03-12 13:12:40] [INFO ] Added : 4 causal constraints over 1 iterations in 483 ms. Result :sat
Minimization took 317 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 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 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:12:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:40] [INFO ] Invariant cache hit.
[2023-03-12 13:12:41] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-12 13:12:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:41] [INFO ] Invariant cache hit.
[2023-03-12 13:12:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:12:42] [INFO ] Implicit Places using invariants and state equation in 1725 ms returned []
Implicit Place search using SMT with State Equation took 2072 ms to find 0 implicit places.
[2023-03-12 13:12:42] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-12 13:12:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:12:42] [INFO ] Invariant cache hit.
[2023-03-12 13:12:43] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3079 ms. Remains : 229/229 places, 2747/2747 transitions.
Ending property specific reduction for BugTracking-PT-q3m004-UpperBounds-15 in 16725 ms.
[2023-03-12 13:12:44] [INFO ] Flatten gal took : 392 ms
[2023-03-12 13:12:44] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 13:12:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 229 places, 2747 transitions and 13485 arcs took 27 ms.
Total runtime 162672 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/913/ub_0_ --maxsum=/tmp/913/ub_1_ --maxsum=/tmp/913/ub_2_ --maxsum=/tmp/913/ub_3_ --maxsum=/tmp/913/ub_4_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 14756544 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082144 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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
mcc2023
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-q3m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BugTracking-PT-q3m004, 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 r041-tajo-167813694500333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m004.tgz
mv BugTracking-PT-q3m004 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 '
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 ;