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.r042-tajo-167813695800445.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 marciexred
Input is BugTracking-PT-q8m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 06:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 06:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678725434705

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:37:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 16:37:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:37:17] [INFO ] Load time of PNML (sax parser for PT used): 812 ms
[2023-03-13 16:37:17] [INFO ] Transformed 754 places.
[2023-03-13 16:37:17] [INFO ] Transformed 27370 transitions.
[2023-03-13 16:37:17] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1074 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 118 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 16:37:17] [INFO ] Computed 10 place invariants in 55 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
[2023-03-13 16:37:18] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-13 16:37:18] [INFO ] Computed 10 place invariants in 33 ms
[2023-03-13 16:37:18] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2023-03-13 16:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:19] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2023-03-13 16:37:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 16:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:20] [INFO ] [Nat]Absence check using state equation in 814 ms returned sat
[2023-03-13 16:37:20] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:37:20] [INFO ] [Nat]Added 303 Read/Feed constraints in 107 ms returned sat
[2023-03-13 16:37:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 544 ms.
[2023-03-13 16:37:21] [INFO ] Added : 2 causal constraints over 1 iterations in 1042 ms. Result :sat
[2023-03-13 16:37:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 16:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:22] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-13 16:37:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 16:37:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:23] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2023-03-13 16:37:23] [INFO ] [Nat]Added 303 Read/Feed constraints in 160 ms returned sat
[2023-03-13 16:37:24] [INFO ] Deduced a trap composed of 87 places in 468 ms of which 7 ms to minimize.
[2023-03-13 16:37:25] [INFO ] Deduced a trap composed of 95 places in 476 ms of which 1 ms to minimize.
[2023-03-13 16:37:25] [INFO ] Deduced a trap composed of 12 places in 473 ms of which 2 ms to minimize.
[2023-03-13 16:37:26] [INFO ] Deduced a trap composed of 54 places in 500 ms of which 2 ms to minimize.
[2023-03-13 16:37:27] [INFO ] Deduced a trap composed of 56 places in 475 ms of which 2 ms to minimize.
[2023-03-13 16:37:27] [INFO ] Deduced a trap composed of 87 places in 535 ms of which 0 ms to minimize.
[2023-03-13 16:37:27] [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-13 16:37:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 16:37:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:28] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-13 16:37:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 16:37:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:29] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-13 16:37:29] [INFO ] [Nat]Added 303 Read/Feed constraints in 198 ms returned sat
[2023-03-13 16:37:29] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 1 ms to minimize.
[2023-03-13 16:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 607 ms
[2023-03-13 16:37:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 595 ms.
[2023-03-13 16:37:31] [INFO ] Added : 8 causal constraints over 2 iterations in 1215 ms. Result :sat
[2023-03-13 16:37:31] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 16:37:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:31] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-13 16:37:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 16:37:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:32] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2023-03-13 16:37:32] [INFO ] [Nat]Added 303 Read/Feed constraints in 171 ms returned sat
[2023-03-13 16:37:33] [INFO ] Deduced a trap composed of 59 places in 758 ms of which 0 ms to minimize.
[2023-03-13 16:37:34] [INFO ] Deduced a trap composed of 107 places in 728 ms of which 1 ms to minimize.
[2023-03-13 16:37:35] [INFO ] Deduced a trap composed of 52 places in 706 ms of which 1 ms to minimize.
[2023-03-13 16:37:36] [INFO ] Deduced a trap composed of 14 places in 812 ms of which 0 ms to minimize.
[2023-03-13 16:37:36] [INFO ] Deduced a trap composed of 19 places in 537 ms of which 0 ms to minimize.
[2023-03-13 16:37:37] [INFO ] Deduced a trap composed of 59 places in 624 ms of which 1 ms to minimize.
[2023-03-13 16:37:37] [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 3
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-13 16:37:37] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 16:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:38] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2023-03-13 16:37:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-13 16:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:39] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2023-03-13 16:37:39] [INFO ] [Nat]Added 303 Read/Feed constraints in 132 ms returned sat
[2023-03-13 16:37:39] [INFO ] Deduced a trap composed of 62 places in 380 ms of which 1 ms to minimize.
[2023-03-13 16:37:40] [INFO ] Deduced a trap composed of 38 places in 391 ms of which 0 ms to minimize.
[2023-03-13 16:37:40] [INFO ] Deduced a trap composed of 36 places in 377 ms of which 0 ms to minimize.
[2023-03-13 16:37:41] [INFO ] Deduced a trap composed of 14 places in 364 ms of which 0 ms to minimize.
[2023-03-13 16:37:41] [INFO ] Deduced a trap composed of 59 places in 402 ms of which 1 ms to minimize.
[2023-03-13 16:37:42] [INFO ] Deduced a trap composed of 60 places in 408 ms of which 1 ms to minimize.
[2023-03-13 16:37:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3202 ms
[2023-03-13 16:37:42] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 344 ms.
[2023-03-13 16:37:44] [INFO ] Deduced a trap composed of 15 places in 851 ms of which 1 ms to minimize.
[2023-03-13 16:37:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 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 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 322 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:37:45] [INFO ] Computed 8 place invariants in 37 ms
Incomplete random walk after 1000123 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1645 ms. (steps per millisecond=607 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1569 ms. (steps per millisecond=637 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1549 ms. (steps per millisecond=645 ) properties (out of 5) seen :0
[2023-03-13 16:37:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:37:54] [INFO ] Computed 8 place invariants in 33 ms
[2023-03-13 16:37:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:55] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-13 16:37:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:55] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-13 16:37:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:37:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 59 ms returned sat
[2023-03-13 16:37:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 356 ms.
[2023-03-13 16:37:56] [INFO ] Added : 2 causal constraints over 1 iterations in 775 ms. Result :sat
[2023-03-13 16:37:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2023-03-13 16:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:57] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2023-03-13 16:37:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:37:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:37:58] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2023-03-13 16:37:58] [INFO ] [Nat]Added 283 Read/Feed constraints in 97 ms returned sat
[2023-03-13 16:37:59] [INFO ] Deduced a trap composed of 54 places in 567 ms of which 1 ms to minimize.
[2023-03-13 16:37:59] [INFO ] Deduced a trap composed of 88 places in 539 ms of which 1 ms to minimize.
[2023-03-13 16:38:00] [INFO ] Deduced a trap composed of 89 places in 483 ms of which 1 ms to minimize.
[2023-03-13 16:38:01] [INFO ] Deduced a trap composed of 49 places in 449 ms of which 1 ms to minimize.
[2023-03-13 16:38:02] [INFO ] Deduced a trap composed of 81 places in 452 ms of which 1 ms to minimize.
[2023-03-13 16:38:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3714 ms
[2023-03-13 16:38:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 336 ms.
[2023-03-13 16:38:03] [INFO ] Added : 4 causal constraints over 1 iterations in 770 ms. Result :sat
[2023-03-13 16:38:03] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:03] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2023-03-13 16:38:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:38:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:04] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2023-03-13 16:38:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 168 ms returned sat
[2023-03-13 16:38:05] [INFO ] Deduced a trap composed of 36 places in 545 ms of which 1 ms to minimize.
[2023-03-13 16:38:06] [INFO ] Deduced a trap composed of 23 places in 532 ms of which 1 ms to minimize.
[2023-03-13 16:38:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1409 ms
[2023-03-13 16:38:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 375 ms.
[2023-03-13 16:38:07] [INFO ] Added : 2 causal constraints over 1 iterations in 811 ms. Result :sat
[2023-03-13 16:38:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:07] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-13 16:38:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:08] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2023-03-13 16:38:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 207 ms returned sat
[2023-03-13 16:38:09] [INFO ] Deduced a trap composed of 10 places in 536 ms of which 0 ms to minimize.
[2023-03-13 16:38:10] [INFO ] Deduced a trap composed of 55 places in 518 ms of which 1 ms to minimize.
[2023-03-13 16:38:10] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 0 ms to minimize.
[2023-03-13 16:38:11] [INFO ] Deduced a trap composed of 35 places in 493 ms of which 1 ms to minimize.
[2023-03-13 16:38:12] [INFO ] Deduced a trap composed of 36 places in 501 ms of which 1 ms to minimize.
[2023-03-13 16:38:12] [INFO ] Deduced a trap composed of 90 places in 513 ms of which 1 ms to minimize.
[2023-03-13 16:38:13] [INFO ] Deduced a trap composed of 53 places in 487 ms of which 1 ms to minimize.
[2023-03-13 16:38:13] [INFO ] Deduced a trap composed of 53 places in 499 ms of which 4 ms to minimize.
[2023-03-13 16:38:14] [INFO ] Deduced a trap composed of 52 places in 516 ms of which 0 ms to minimize.
[2023-03-13 16:38:15] [INFO ] Deduced a trap composed of 44 places in 421 ms of which 0 ms to minimize.
[2023-03-13 16:38:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6195 ms
[2023-03-13 16:38:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2023-03-13 16:38:16] [INFO ] Added : 9 causal constraints over 4 iterations in 1395 ms. Result :sat
[2023-03-13 16:38:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:17] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-13 16:38:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:38:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:18] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2023-03-13 16:38:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 150 ms returned sat
[2023-03-13 16:38:18] [INFO ] Deduced a trap composed of 26 places in 296 ms of which 1 ms to minimize.
[2023-03-13 16:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 531 ms
[2023-03-13 16:38:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 304 ms.
[2023-03-13 16:38:19] [INFO ] Added : 5 causal constraints over 1 iterations in 738 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:38:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:19] [INFO ] Invariant cache hit.
[2023-03-13 16:38:20] [INFO ] Implicit Places using invariants in 499 ms returned []
[2023-03-13 16:38:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:20] [INFO ] Invariant cache hit.
[2023-03-13 16:38:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:22] [INFO ] Implicit Places using invariants and state equation in 1938 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
[2023-03-13 16:38:22] [INFO ] Redundant transitions in 349 ms returned []
[2023-03-13 16:38:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:22] [INFO ] Invariant cache hit.
[2023-03-13 16:38:24] [INFO ] Dead Transitions using invariants and state equation in 1365 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4239 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:24] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10148 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2029 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
[2023-03-13 16:38:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:24] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-13 16:38:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:24] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-13 16:38:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:25] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2023-03-13 16:38:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:25] [INFO ] [Nat]Added 283 Read/Feed constraints in 42 ms returned sat
[2023-03-13 16:38:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 336 ms.
[2023-03-13 16:38:26] [INFO ] Added : 2 causal constraints over 1 iterations in 738 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 97 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:26] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 1000106 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2193 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 1) seen :0
[2023-03-13 16:38:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:28] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-13 16:38:28] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:29] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2023-03-13 16:38:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:30] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-13 16:38:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 49 ms returned sat
[2023-03-13 16:38:30] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 326 ms.
[2023-03-13 16:38:30] [INFO ] Added : 2 causal constraints over 1 iterations in 702 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:38:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:31] [INFO ] Invariant cache hit.
[2023-03-13 16:38:31] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-13 16:38:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:31] [INFO ] Invariant cache hit.
[2023-03-13 16:38:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:33] [INFO ] Implicit Places using invariants and state equation in 2248 ms returned []
Implicit Place search using SMT with State Equation took 2725 ms to find 0 implicit places.
[2023-03-13 16:38:34] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-13 16:38:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:34] [INFO ] Invariant cache hit.
[2023-03-13 16:38:35] [INFO ] Dead Transitions using invariants and state equation in 1246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4170 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-02 in 11226 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:35] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 10173 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1695 ) 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-13 16:38:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:35] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-13 16:38:35] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:38:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:35] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-13 16:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:36] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2023-03-13 16:38:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:36] [INFO ] [Nat]Added 283 Read/Feed constraints in 101 ms returned sat
[2023-03-13 16:38:37] [INFO ] Deduced a trap composed of 54 places in 546 ms of which 1 ms to minimize.
[2023-03-13 16:38:38] [INFO ] Deduced a trap composed of 88 places in 542 ms of which 0 ms to minimize.
[2023-03-13 16:38:39] [INFO ] Deduced a trap composed of 89 places in 471 ms of which 0 ms to minimize.
[2023-03-13 16:38:39] [INFO ] Deduced a trap composed of 49 places in 470 ms of which 0 ms to minimize.
[2023-03-13 16:38:40] [INFO ] Deduced a trap composed of 81 places in 466 ms of which 1 ms to minimize.
[2023-03-13 16:38:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3661 ms
[2023-03-13 16:38:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 367 ms.
[2023-03-13 16:38:41] [INFO ] Added : 4 causal constraints over 1 iterations in 535 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:41] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000106 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1640 ms. (steps per millisecond=609 ) properties (out of 1) seen :0
[2023-03-13 16:38:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:43] [INFO ] Computed 8 place invariants in 33 ms
[2023-03-13 16:38:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:44] [INFO ] [Real]Absence check using state equation in 631 ms returned sat
[2023-03-13 16:38:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:44] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2023-03-13 16:38:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 101 ms returned sat
[2023-03-13 16:38:45] [INFO ] Deduced a trap composed of 54 places in 589 ms of which 0 ms to minimize.
[2023-03-13 16:38:46] [INFO ] Deduced a trap composed of 88 places in 524 ms of which 1 ms to minimize.
[2023-03-13 16:38:47] [INFO ] Deduced a trap composed of 89 places in 432 ms of which 2 ms to minimize.
[2023-03-13 16:38:47] [INFO ] Deduced a trap composed of 49 places in 468 ms of which 0 ms to minimize.
[2023-03-13 16:38:48] [INFO ] Deduced a trap composed of 81 places in 468 ms of which 1 ms to minimize.
[2023-03-13 16:38:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3746 ms
[2023-03-13 16:38:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 314 ms.
[2023-03-13 16:38:49] [INFO ] Added : 4 causal constraints over 1 iterations in 789 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:38:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:49] [INFO ] Invariant cache hit.
[2023-03-13 16:38:50] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-13 16:38:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:50] [INFO ] Invariant cache hit.
[2023-03-13 16:38:50] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:52] [INFO ] Implicit Places using invariants and state equation in 1994 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2023-03-13 16:38:52] [INFO ] Redundant transitions in 199 ms returned []
[2023-03-13 16:38:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:38:52] [INFO ] Invariant cache hit.
[2023-03-13 16:38:53] [INFO ] Dead Transitions using invariants and state equation in 1137 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3919 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-08 in 18390 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:53] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10130 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2532 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-13 16:38:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:53] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-13 16:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:54] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-13 16:38:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:54] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2023-03-13 16:38:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:38:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 115 ms returned sat
[2023-03-13 16:38:55] [INFO ] Deduced a trap composed of 36 places in 398 ms of which 0 ms to minimize.
[2023-03-13 16:38:55] [INFO ] Deduced a trap composed of 23 places in 326 ms of which 0 ms to minimize.
[2023-03-13 16:38:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 928 ms
[2023-03-13 16:38:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 210 ms.
[2023-03-13 16:38:56] [INFO ] Added : 2 causal constraints over 1 iterations in 621 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:56] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000110 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1604 ms. (steps per millisecond=623 ) properties (out of 1) seen :0
[2023-03-13 16:38:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:38:58] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-13 16:38:59] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:38:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:38:59] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2023-03-13 16:38:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:38:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:38:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:00] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2023-03-13 16:39:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 150 ms returned sat
[2023-03-13 16:39:01] [INFO ] Deduced a trap composed of 36 places in 542 ms of which 2 ms to minimize.
[2023-03-13 16:39:01] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 1 ms to minimize.
[2023-03-13 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1386 ms
[2023-03-13 16:39:02] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2023-03-13 16:39:02] [INFO ] Added : 2 causal constraints over 1 iterations in 711 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 101 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:39:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:03] [INFO ] Invariant cache hit.
[2023-03-13 16:39:03] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-13 16:39:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:03] [INFO ] Invariant cache hit.
[2023-03-13 16:39:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:05] [INFO ] Implicit Places using invariants and state equation in 2053 ms returned []
Implicit Place search using SMT with State Equation took 2550 ms to find 0 implicit places.
[2023-03-13 16:39:05] [INFO ] Redundant transitions in 189 ms returned []
[2023-03-13 16:39:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:05] [INFO ] Invariant cache hit.
[2023-03-13 16:39:06] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4019 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-11 in 13262 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:06] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10064 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2516 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-13 16:39:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:07] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-13 16:39:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:39:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:07] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-13 16:39:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:39:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:39:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:08] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-13 16:39:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 216 ms returned sat
[2023-03-13 16:39:08] [INFO ] Deduced a trap composed of 10 places in 449 ms of which 0 ms to minimize.
[2023-03-13 16:39:09] [INFO ] Deduced a trap composed of 55 places in 443 ms of which 0 ms to minimize.
[2023-03-13 16:39:09] [INFO ] Deduced a trap composed of 55 places in 422 ms of which 1 ms to minimize.
[2023-03-13 16:39:10] [INFO ] Deduced a trap composed of 35 places in 382 ms of which 0 ms to minimize.
[2023-03-13 16:39:10] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 5 ms to minimize.
[2023-03-13 16:39:11] [INFO ] Deduced a trap composed of 90 places in 379 ms of which 0 ms to minimize.
[2023-03-13 16:39:11] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 1 ms to minimize.
[2023-03-13 16:39:12] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 1 ms to minimize.
[2023-03-13 16:39:12] [INFO ] Deduced a trap composed of 52 places in 493 ms of which 1 ms to minimize.
[2023-03-13 16:39:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:12] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000155 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1767 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1811 ms. (steps per millisecond=552 ) properties (out of 1) seen :0
[2023-03-13 16:39:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:15] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-13 16:39:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:16] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2023-03-13 16:39:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:39:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:16] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-13 16:39:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 145 ms returned sat
[2023-03-13 16:39:17] [INFO ] Deduced a trap composed of 10 places in 423 ms of which 0 ms to minimize.
[2023-03-13 16:39:17] [INFO ] Deduced a trap composed of 55 places in 452 ms of which 1 ms to minimize.
[2023-03-13 16:39:18] [INFO ] Deduced a trap composed of 55 places in 473 ms of which 1 ms to minimize.
[2023-03-13 16:39:19] [INFO ] Deduced a trap composed of 35 places in 492 ms of which 1 ms to minimize.
[2023-03-13 16:39:19] [INFO ] Deduced a trap composed of 36 places in 454 ms of which 1 ms to minimize.
[2023-03-13 16:39:20] [INFO ] Deduced a trap composed of 90 places in 496 ms of which 2 ms to minimize.
[2023-03-13 16:39:20] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 1 ms to minimize.
[2023-03-13 16:39:21] [INFO ] Deduced a trap composed of 53 places in 490 ms of which 1 ms to minimize.
[2023-03-13 16:39:22] [INFO ] Deduced a trap composed of 52 places in 535 ms of which 1 ms to minimize.
[2023-03-13 16:39:22] [INFO ] Deduced a trap composed of 44 places in 413 ms of which 1 ms to minimize.
[2023-03-13 16:39:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5918 ms
[2023-03-13 16:39:23] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 325 ms.
[2023-03-13 16:39:24] [INFO ] Added : 9 causal constraints over 4 iterations in 1446 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:39:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:24] [INFO ] Invariant cache hit.
[2023-03-13 16:39:25] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-13 16:39:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:25] [INFO ] Invariant cache hit.
[2023-03-13 16:39:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:26] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2172 ms to find 0 implicit places.
[2023-03-13 16:39:26] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-13 16:39:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:26] [INFO ] Invariant cache hit.
[2023-03-13 16:39:28] [INFO ] Dead Transitions using invariants and state equation in 1228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3582 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-12 in 21101 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-15
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:28] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10115 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2023 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-13 16:39:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:28] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-13 16:39:28] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:39:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:28] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2023-03-13 16:39:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:39:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:39:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:29] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-13 16:39:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 136 ms returned sat
[2023-03-13 16:39:29] [INFO ] Deduced a trap composed of 26 places in 189 ms of which 0 ms to minimize.
[2023-03-13 16:39:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2023-03-13 16:39:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 343 ms.
[2023-03-13 16:39:30] [INFO ] Added : 5 causal constraints over 1 iterations in 781 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:30] [INFO ] Computed 8 place invariants in 22 ms
Incomplete random walk after 1000132 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1495 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
[2023-03-13 16:39:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:39:32] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-13 16:39:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-13 16:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:33] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-13 16:39:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:39:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-13 16:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:39:33] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2023-03-13 16:39:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 209 ms returned sat
[2023-03-13 16:39:34] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 0 ms to minimize.
[2023-03-13 16:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-13 16:39:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 342 ms.
[2023-03-13 16:39:35] [INFO ] Added : 5 causal constraints over 1 iterations in 794 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:39:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:35] [INFO ] Invariant cache hit.
[2023-03-13 16:39:36] [INFO ] Implicit Places using invariants in 506 ms returned []
[2023-03-13 16:39:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:36] [INFO ] Invariant cache hit.
[2023-03-13 16:39:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:39:37] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2023-03-13 16:39:38] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-13 16:39:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:39:38] [INFO ] Invariant cache hit.
[2023-03-13 16:39:39] [INFO ] Dead Transitions using invariants and state equation in 1163 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3678 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-15 in 11251 ms.
[2023-03-13 16:39:39] [INFO ] Flatten gal took : 357 ms
[2023-03-13 16:39:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-13 16:39:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 18 ms.
Total runtime 143473 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: BugTracking_PT_q8
(NrP: 269 NrTr: 3871 NrArc: 19045)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.124sec

net check time: 0m 0.005sec

init dd package: 0m 2.969sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10566880 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16082236 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.055sec

6285 14012 20445 27783 33446 38092 43141 46913 50880 52766 55472 58396 61796 62048 65414 69185 74044 78079 76600 105363 130116 137074 150265 150791 166302 162768 163265 164213 161653

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-q8m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q8m256, 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 r042-tajo-167813695800445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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