Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.5K Feb 26 06:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 06:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 06:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 06:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:44 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-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678787390213

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:49:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 09:49:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:49:52] [INFO ] Load time of PNML (sax parser for PT used): 827 ms
[2023-03-14 09:49:52] [INFO ] Transformed 754 places.
[2023-03-14 09:49:52] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:49:52] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 990 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 110 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:49:53] [INFO ] Computed 10 place invariants in 47 ms
Incomplete random walk after 10006 steps, including 63 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :9
FORMULA BugTracking-PT-q8m008-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m008-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
[2023-03-14 09:49:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:49:53] [INFO ] Computed 10 place invariants in 36 ms
[2023-03-14 09:49:53] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-14 09:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:49:54] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-14 09:49:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:49:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 09:49:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:49:54] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2023-03-14 09:49:54] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 09:49:55] [INFO ] [Nat]Added 303 Read/Feed constraints in 282 ms returned sat
[2023-03-14 09:49:55] [INFO ] Deduced a trap composed of 31 places in 448 ms of which 4 ms to minimize.
[2023-03-14 09:49:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 704 ms
[2023-03-14 09:49:56] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 432 ms.
[2023-03-14 09:49:57] [INFO ] Added : 7 causal constraints over 2 iterations in 1136 ms. Result :sat
[2023-03-14 09:49:57] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:49:57] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-14 09:49:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:49:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:49:58] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-14 09:49:58] [INFO ] [Nat]Added 303 Read/Feed constraints in 229 ms returned sat
[2023-03-14 09:49:59] [INFO ] Deduced a trap composed of 38 places in 711 ms of which 1 ms to minimize.
[2023-03-14 09:50:00] [INFO ] Deduced a trap composed of 26 places in 755 ms of which 6 ms to minimize.
[2023-03-14 09:50:01] [INFO ] Deduced a trap composed of 58 places in 525 ms of which 0 ms to minimize.
[2023-03-14 09:50:01] [INFO ] Deduced a trap composed of 58 places in 571 ms of which 2 ms to minimize.
[2023-03-14 09:50:02] [INFO ] Deduced a trap composed of 39 places in 532 ms of which 1 ms to minimize.
[2023-03-14 09:50:02] [INFO ] Deduced a trap composed of 12 places in 545 ms of which 0 ms to minimize.
[2023-03-14 09:50:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-14 09:50:03] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 09:50:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:03] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-14 09:50:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-14 09:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:04] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2023-03-14 09:50:04] [INFO ] [Nat]Added 303 Read/Feed constraints in 460 ms returned sat
[2023-03-14 09:50:05] [INFO ] Deduced a trap composed of 24 places in 518 ms of which 1 ms to minimize.
[2023-03-14 09:50:06] [INFO ] Deduced a trap composed of 30 places in 565 ms of which 0 ms to minimize.
[2023-03-14 09:50:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1314 ms
[2023-03-14 09:50:06] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 485 ms.
[2023-03-14 09:50:07] [INFO ] Added : 8 causal constraints over 2 iterations in 975 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Support contains 3 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.13 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 5 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 418 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 421 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-14 09:50:07] [INFO ] Computed 8 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4035 ms. (steps per millisecond=247 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1925 ms. (steps per millisecond=519 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1667 ms. (steps per millisecond=599 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 3) seen :0
[2023-03-14 09:50:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:50:17] [INFO ] Computed 8 place invariants in 34 ms
[2023-03-14 09:50:17] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:17] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2023-03-14 09:50:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:18] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-14 09:50:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:50:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 321 ms returned sat
[2023-03-14 09:50:19] [INFO ] Deduced a trap composed of 19 places in 658 ms of which 1 ms to minimize.
[2023-03-14 09:50:20] [INFO ] Deduced a trap composed of 17 places in 576 ms of which 1 ms to minimize.
[2023-03-14 09:50:20] [INFO ] Deduced a trap composed of 60 places in 407 ms of which 0 ms to minimize.
[2023-03-14 09:50:21] [INFO ] Deduced a trap composed of 28 places in 429 ms of which 0 ms to minimize.
[2023-03-14 09:50:21] [INFO ] Deduced a trap composed of 34 places in 469 ms of which 1 ms to minimize.
[2023-03-14 09:50:22] [INFO ] Deduced a trap composed of 26 places in 727 ms of which 1 ms to minimize.
[2023-03-14 09:50:23] [INFO ] Deduced a trap composed of 26 places in 397 ms of which 0 ms to minimize.
[2023-03-14 09:50:23] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 1 ms to minimize.
[2023-03-14 09:50:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4870 ms
[2023-03-14 09:50:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 372 ms.
[2023-03-14 09:50:24] [INFO ] Added : 6 causal constraints over 2 iterations in 924 ms. Result :sat
[2023-03-14 09:50:24] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:25] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-14 09:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:26] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2023-03-14 09:50:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 148 ms returned sat
[2023-03-14 09:50:26] [INFO ] Deduced a trap composed of 91 places in 390 ms of which 1 ms to minimize.
[2023-03-14 09:50:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2023-03-14 09:50:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 324 ms.
[2023-03-14 09:50:28] [INFO ] Deduced a trap composed of 14 places in 472 ms of which 0 ms to minimize.
[2023-03-14 09:50:28] [INFO ] Deduced a trap composed of 57 places in 412 ms of which 0 ms to minimize.
[2023-03-14 09:50:29] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 1 ms to minimize.
[2023-03-14 09:50:29] [INFO ] Deduced a trap composed of 25 places in 322 ms of which 1 ms to minimize.
[2023-03-14 09:50:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2105 ms
[2023-03-14 09:50:29] [INFO ] Added : 4 causal constraints over 1 iterations in 2991 ms. Result :sat
[2023-03-14 09:50:30] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:50:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:30] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2023-03-14 09:50:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:31] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-14 09:50:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 237 ms returned sat
[2023-03-14 09:50:32] [INFO ] Deduced a trap composed of 43 places in 414 ms of which 0 ms to minimize.
[2023-03-14 09:50:32] [INFO ] Deduced a trap composed of 18 places in 372 ms of which 0 ms to minimize.
[2023-03-14 09:50:33] [INFO ] Deduced a trap composed of 59 places in 309 ms of which 1 ms to minimize.
[2023-03-14 09:50:33] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2023-03-14 09:50:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1847 ms
[2023-03-14 09:50:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 310 ms.
[2023-03-14 09:50:34] [INFO ] Added : 9 causal constraints over 3 iterations in 1074 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, 1] Max seen :[0, 0, 0]
Support contains 3 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 79 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 79 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 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:50:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:50:35] [INFO ] Invariant cache hit.
[2023-03-14 09:50:35] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-14 09:50:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:50:35] [INFO ] Invariant cache hit.
[2023-03-14 09:50:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:50:38] [INFO ] Implicit Places using invariants and state equation in 2252 ms returned []
Implicit Place search using SMT with State Equation took 2996 ms to find 0 implicit places.
[2023-03-14 09:50:38] [INFO ] Redundant transitions in 296 ms returned []
[2023-03-14 09:50:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:50:38] [INFO ] Invariant cache hit.
[2023-03-14 09:50:39] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4582 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:50:39] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2023-03-14 09:50:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:50:39] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-14 09:50:39] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:40] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-14 09:50:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-14 09:50:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:41] [INFO ] [Nat]Absence check using state equation in 496 ms returned sat
[2023-03-14 09:50:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:50:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 245 ms returned sat
[2023-03-14 09:50:41] [INFO ] Deduced a trap composed of 19 places in 489 ms of which 0 ms to minimize.
[2023-03-14 09:50:42] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2023-03-14 09:50:42] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 1 ms to minimize.
[2023-03-14 09:50:43] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 1 ms to minimize.
[2023-03-14 09:50:43] [INFO ] Deduced a trap composed of 34 places in 352 ms of which 0 ms to minimize.
[2023-03-14 09:50:43] [INFO ] Deduced a trap composed of 26 places in 320 ms of which 1 ms to minimize.
[2023-03-14 09:50:44] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 0 ms to minimize.
[2023-03-14 09:50:44] [INFO ] Deduced a trap composed of 14 places in 334 ms of which 1 ms to minimize.
[2023-03-14 09:50:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3608 ms
[2023-03-14 09:50:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2023-03-14 09:50:46] [INFO ] Deduced a trap composed of 7 places in 808 ms of which 5 ms to minimize.
[2023-03-14 09:50:46] [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 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 78 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 81 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-14 09:50:46] [INFO ] Computed 8 place invariants in 13 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 5371 ms. (steps per millisecond=186 ) properties (out of 1) 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 1) seen :0
[2023-03-14 09:50:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:50:53] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-14 09:50:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:54] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2023-03-14 09:50:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:50:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-14 09:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:50:55] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-14 09:50:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:50:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 297 ms returned sat
[2023-03-14 09:50:56] [INFO ] Deduced a trap composed of 19 places in 541 ms of which 2 ms to minimize.
[2023-03-14 09:50:56] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 1 ms to minimize.
[2023-03-14 09:50:57] [INFO ] Deduced a trap composed of 60 places in 351 ms of which 1 ms to minimize.
[2023-03-14 09:50:57] [INFO ] Deduced a trap composed of 28 places in 329 ms of which 1 ms to minimize.
[2023-03-14 09:50:57] [INFO ] Deduced a trap composed of 34 places in 333 ms of which 0 ms to minimize.
[2023-03-14 09:50:58] [INFO ] Deduced a trap composed of 26 places in 362 ms of which 1 ms to minimize.
[2023-03-14 09:50:58] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 0 ms to minimize.
[2023-03-14 09:50:59] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 0 ms to minimize.
[2023-03-14 09:50:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3693 ms
[2023-03-14 09:50:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 353 ms.
[2023-03-14 09:51:00] [INFO ] Added : 6 causal constraints over 2 iterations in 946 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 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.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:51:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:00] [INFO ] Invariant cache hit.
[2023-03-14 09:51:00] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-14 09:51:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:00] [INFO ] Invariant cache hit.
[2023-03-14 09:51:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:02] [INFO ] Implicit Places using invariants and state equation in 2017 ms returned []
Implicit Place search using SMT with State Equation took 2513 ms to find 0 implicit places.
[2023-03-14 09:51:03] [INFO ] Redundant transitions in 241 ms returned []
[2023-03-14 09:51:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:03] [INFO ] Invariant cache hit.
[2023-03-14 09:51:04] [INFO ] Dead Transitions using invariants and state equation in 1359 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4201 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-01 in 24892 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-06
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:04] [INFO ] Computed 8 place invariants in 11 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2023-03-14 09:51:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:04] [INFO ] Computed 8 place invariants in 38 ms
[2023-03-14 09:51:04] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-14 09:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:05] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-14 09:51:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:51:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:51:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:06] [INFO ] [Nat]Absence check using state equation in 588 ms returned sat
[2023-03-14 09:51:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 172 ms returned sat
[2023-03-14 09:51:06] [INFO ] Deduced a trap composed of 91 places in 513 ms of which 1 ms to minimize.
[2023-03-14 09:51:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 741 ms
[2023-03-14 09:51:07] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 344 ms.
[2023-03-14 09:51:08] [INFO ] Deduced a trap composed of 14 places in 496 ms of which 1 ms to minimize.
[2023-03-14 09:51:08] [INFO ] Deduced a trap composed of 57 places in 460 ms of which 1 ms to minimize.
[2023-03-14 09:51:09] [INFO ] Deduced a trap composed of 62 places in 390 ms of which 0 ms to minimize.
[2023-03-14 09:51:09] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 0 ms to minimize.
[2023-03-14 09:51:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2428 ms
[2023-03-14 09:51:10] [INFO ] Added : 4 causal constraints over 1 iterations in 3317 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 80 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 81 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-14 09:51:10] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 3730 ms. (steps per millisecond=268 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 1) seen :0
[2023-03-14 09:51:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:16] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-14 09:51:16] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:17] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2023-03-14 09:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:51:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:18] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-14 09:51:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 157 ms returned sat
[2023-03-14 09:51:18] [INFO ] Deduced a trap composed of 91 places in 485 ms of which 0 ms to minimize.
[2023-03-14 09:51:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 648 ms
[2023-03-14 09:51:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 303 ms.
[2023-03-14 09:51:20] [INFO ] Deduced a trap composed of 14 places in 560 ms of which 1 ms to minimize.
[2023-03-14 09:51:20] [INFO ] Deduced a trap composed of 57 places in 433 ms of which 15 ms to minimize.
[2023-03-14 09:51:21] [INFO ] Deduced a trap composed of 62 places in 363 ms of which 0 ms to minimize.
[2023-03-14 09:51:21] [INFO ] Deduced a trap composed of 25 places in 478 ms of which 0 ms to minimize.
[2023-03-14 09:51:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2437 ms
[2023-03-14 09:51:22] [INFO ] Added : 4 causal constraints over 1 iterations in 3256 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 77 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 77 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 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:51:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:22] [INFO ] Invariant cache hit.
[2023-03-14 09:51:22] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-14 09:51:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:22] [INFO ] Invariant cache hit.
[2023-03-14 09:51:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:24] [INFO ] Implicit Places using invariants and state equation in 2005 ms returned []
Implicit Place search using SMT with State Equation took 2492 ms to find 0 implicit places.
[2023-03-14 09:51:25] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-14 09:51:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:25] [INFO ] Invariant cache hit.
[2023-03-14 09:51:26] [INFO ] Dead Transitions using invariants and state equation in 1193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3892 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-06 in 21712 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:26] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2023-03-14 09:51:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:26] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-14 09:51:26] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:51:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:26] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-14 09:51:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:51:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:51:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:27] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2023-03-14 09:51:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 267 ms returned sat
[2023-03-14 09:51:28] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 1 ms to minimize.
[2023-03-14 09:51:28] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 0 ms to minimize.
[2023-03-14 09:51:29] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 1 ms to minimize.
[2023-03-14 09:51:29] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 4 ms to minimize.
[2023-03-14 09:51:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1803 ms
[2023-03-14 09:51:30] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 367 ms.
[2023-03-14 09:51:30] [INFO ] Added : 9 causal constraints over 3 iterations in 1157 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 93 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 95 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-14 09:51:31] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4401 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2140 ms. (steps per millisecond=467 ) properties (out of 1) seen :0
[2023-03-14 09:51:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:51:37] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-14 09:51:37] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:38] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2023-03-14 09:51:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:51:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:51:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:51:39] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-14 09:51:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:39] [INFO ] [Nat]Added 283 Read/Feed constraints in 273 ms returned sat
[2023-03-14 09:51:40] [INFO ] Deduced a trap composed of 43 places in 422 ms of which 1 ms to minimize.
[2023-03-14 09:51:40] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 0 ms to minimize.
[2023-03-14 09:51:40] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 0 ms to minimize.
[2023-03-14 09:51:41] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 0 ms to minimize.
[2023-03-14 09:51:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1820 ms
[2023-03-14 09:51:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2023-03-14 09:51:42] [INFO ] Added : 9 causal constraints over 3 iterations in 1099 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 73 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 73 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 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:51:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:42] [INFO ] Invariant cache hit.
[2023-03-14 09:51:43] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-14 09:51:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:43] [INFO ] Invariant cache hit.
[2023-03-14 09:51:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:51:45] [INFO ] Implicit Places using invariants and state equation in 1993 ms returned []
Implicit Place search using SMT with State Equation took 2477 ms to find 0 implicit places.
[2023-03-14 09:51:45] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-14 09:51:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:51:45] [INFO ] Invariant cache hit.
[2023-03-14 09:51:46] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3839 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-13 in 20257 ms.
[2023-03-14 09:51:47] [INFO ] Flatten gal took : 400 ms
[2023-03-14 09:51:47] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-14 09:51:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 16 ms.
Total runtime 115468 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m008
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 269 places, 3871 transitions, 19045 arcs.
Final Score: 52874.708
Took : 86 seconds
Bounds file is: UpperBounds.xml

BK_STOP 1678790689670

--------------------
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
ERROR:
Generation failed in Meddly with error code:
Insufficient memory
within model automodel instantiated in file model.sm near line 23211
/home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//smart.sh: line 116: 850 Segmentation fault ${SMART}/smart ${INPUT_SM}

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m008"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is BugTracking-PT-q8m008, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-tajo-167813696800405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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