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-167813696800413.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-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696800413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 08:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 07:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 07:52 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:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 08:29 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-q8m016-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m016-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678787719826

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-q8m016
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 09:55:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 09:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:55:22] [INFO ] Load time of PNML (sax parser for PT used): 585 ms
[2023-03-14 09:55:22] [INFO ] Transformed 754 places.
[2023-03-14 09:55:22] [INFO ] Transformed 27370 transitions.
[2023-03-14 09:55:22] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 731 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-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:55:22] [INFO ] Computed 10 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 35 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :6
FORMULA BugTracking-PT-q8m016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BugTracking-PT-q8m016-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :5
[2023-03-14 09:55:22] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-14 09:55:22] [INFO ] Computed 10 place invariants in 24 ms
[2023-03-14 09:55:22] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:23] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-14 09:55:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-14 09:55:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:23] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2023-03-14 09:55:24] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-14 09:55:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 59 ms returned sat
[2023-03-14 09:55:24] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 366 ms.
[2023-03-14 09:55:26] [INFO ] Deduced a trap composed of 64 places in 383 ms of which 5 ms to minimize.
[2023-03-14 09:55:26] [INFO ] Deduced a trap composed of 62 places in 374 ms of which 1 ms to minimize.
[2023-03-14 09:55:27] [INFO ] Deduced a trap composed of 61 places in 391 ms of which 1 ms to minimize.
[2023-03-14 09:55:27] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 2 ms to minimize.
[2023-03-14 09:55:28] [INFO ] Deduced a trap composed of 38 places in 314 ms of which 1 ms to minimize.
[2023-03-14 09:55:28] [INFO ] Deduced a trap composed of 48 places in 326 ms of which 0 ms to minimize.
[2023-03-14 09:55:28] [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: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:55:28] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:29] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2023-03-14 09:55:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:29] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2023-03-14 09:55:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 270 ms returned sat
[2023-03-14 09:55:30] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 0 ms to minimize.
[2023-03-14 09:55:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 588 ms
[2023-03-14 09:55:31] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 318 ms.
[2023-03-14 09:55:31] [INFO ] Added : 8 causal constraints over 2 iterations in 838 ms. Result :sat
[2023-03-14 09:55:31] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-14 09:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:32] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-14 09:55:32] [INFO ] [Real]Added 303 Read/Feed constraints in 45 ms returned sat
[2023-03-14 09:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-14 09:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:33] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2023-03-14 09:55:33] [INFO ] [Nat]Added 303 Read/Feed constraints in 100 ms returned sat
[2023-03-14 09:55:34] [INFO ] Deduced a trap composed of 78 places in 473 ms of which 1 ms to minimize.
[2023-03-14 09:55:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 689 ms
[2023-03-14 09:55:34] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 318 ms.
[2023-03-14 09:55:34] [INFO ] Added : 2 causal constraints over 1 iterations in 704 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 5]
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 279 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 278 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 278 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 276 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 276 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 270 transition count 3871
Applied a total of 19 rules in 395 ms. Remains 270 /280 variables (removed 10) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 270/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:55:35] [INFO ] Computed 9 place invariants in 36 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 2301 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 3) seen :5
[2023-03-14 09:55:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:55:43] [INFO ] Computed 9 place invariants in 38 ms
[2023-03-14 09:55:43] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 09:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:43] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-14 09:55:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:55:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:44] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-14 09:55:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:55:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 272 ms returned sat
[2023-03-14 09:55:45] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 1 ms to minimize.
[2023-03-14 09:55:45] [INFO ] Deduced a trap composed of 54 places in 418 ms of which 0 ms to minimize.
[2023-03-14 09:55:46] [INFO ] Deduced a trap composed of 42 places in 513 ms of which 0 ms to minimize.
[2023-03-14 09:55:46] [INFO ] Deduced a trap composed of 63 places in 261 ms of which 0 ms to minimize.
[2023-03-14 09:55:47] [INFO ] Deduced a trap composed of 60 places in 463 ms of which 1 ms to minimize.
[2023-03-14 09:55:47] [INFO ] Deduced a trap composed of 61 places in 473 ms of which 1 ms to minimize.
[2023-03-14 09:55:48] [INFO ] Deduced a trap composed of 26 places in 503 ms of which 0 ms to minimize.
[2023-03-14 09:55:48] [INFO ] Deduced a trap composed of 62 places in 443 ms of which 0 ms to minimize.
[2023-03-14 09:55:48] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4363 ms
[2023-03-14 09:55:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 318 ms.
[2023-03-14 09:55:49] [INFO ] Added : 1 causal constraints over 1 iterations in 722 ms. Result :sat
[2023-03-14 09:55:49] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-14 09:55:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:50] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2023-03-14 09:55:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:55:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:51] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2023-03-14 09:55:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 199 ms returned sat
[2023-03-14 09:55:52] [INFO ] Deduced a trap composed of 35 places in 518 ms of which 1 ms to minimize.
[2023-03-14 09:55:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 750 ms
[2023-03-14 09:55:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 288 ms.
[2023-03-14 09:55:52] [INFO ] Added : 2 causal constraints over 1 iterations in 744 ms. Result :sat
[2023-03-14 09:55:53] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-14 09:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:53] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2023-03-14 09:55:53] [INFO ] [Real]Added 283 Read/Feed constraints in 70 ms returned sat
[2023-03-14 09:55:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:55:53] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:55:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:55:54] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-14 09:55:54] [INFO ] [Nat]Added 283 Read/Feed constraints in 87 ms returned sat
[2023-03-14 09:55:55] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 1 ms to minimize.
[2023-03-14 09:55:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 668 ms
[2023-03-14 09:55:55] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 291 ms.
[2023-03-14 09:55:55] [INFO ] Added : 2 causal constraints over 1 iterations in 720 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 16] Max seen :[0, 0, 5]
Support contains 3 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 93 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 82 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:55:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:55:56] [INFO ] Invariant cache hit.
[2023-03-14 09:55:56] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-14 09:55:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:55:56] [INFO ] Invariant cache hit.
[2023-03-14 09:55:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:55:58] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
[2023-03-14 09:55:58] [INFO ] Redundant transitions in 444 ms returned []
[2023-03-14 09:55:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:55:59] [INFO ] Invariant cache hit.
[2023-03-14 09:56:00] [INFO ] Dead Transitions using invariants and state equation in 1231 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3914 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:00] [INFO ] Computed 9 place invariants in 12 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2023-03-14 09:56:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:00] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-14 09:56:00] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 09:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:00] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2023-03-14 09:56:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-14 09:56:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:01] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-14 09:56:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:01] [INFO ] [Nat]Added 283 Read/Feed constraints in 204 ms returned sat
[2023-03-14 09:56:01] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 1 ms to minimize.
[2023-03-14 09:56:02] [INFO ] Deduced a trap composed of 54 places in 420 ms of which 1 ms to minimize.
[2023-03-14 09:56:02] [INFO ] Deduced a trap composed of 42 places in 395 ms of which 1 ms to minimize.
[2023-03-14 09:56:03] [INFO ] Deduced a trap composed of 63 places in 407 ms of which 1 ms to minimize.
[2023-03-14 09:56:03] [INFO ] Deduced a trap composed of 60 places in 452 ms of which 1 ms to minimize.
[2023-03-14 09:56:04] [INFO ] Deduced a trap composed of 61 places in 442 ms of which 0 ms to minimize.
[2023-03-14 09:56:05] [INFO ] Deduced a trap composed of 26 places in 486 ms of which 0 ms to minimize.
[2023-03-14 09:56:05] [INFO ] Deduced a trap composed of 62 places in 445 ms of which 1 ms to minimize.
[2023-03-14 09:56:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4136 ms
[2023-03-14 09:56:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 80 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:56:05] [INFO ] Computed 8 place invariants in 25 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 3280 ms. (steps per millisecond=304 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1919 ms. (steps per millisecond=521 ) properties (out of 1) seen :0
[2023-03-14 09:56:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:56:11] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-14 09:56:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-14 09:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:11] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2023-03-14 09:56:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:12] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2023-03-14 09:56:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:12] [INFO ] [Nat]Added 283 Read/Feed constraints in 65 ms returned sat
[2023-03-14 09:56:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 302 ms.
[2023-03-14 09:56:14] [INFO ] Deduced a trap composed of 96 places in 540 ms of which 0 ms to minimize.
[2023-03-14 09:56:14] [INFO ] Deduced a trap composed of 72 places in 533 ms of which 1 ms to minimize.
[2023-03-14 09:56:15] [INFO ] Deduced a trap composed of 53 places in 514 ms of which 0 ms to minimize.
[2023-03-14 09:56:16] [INFO ] Deduced a trap composed of 14 places in 564 ms of which 0 ms to minimize.
[2023-03-14 09:56:16] [INFO ] Deduced a trap composed of 94 places in 457 ms of which 0 ms to minimize.
[2023-03-14 09:56:17] [INFO ] Deduced a trap composed of 45 places in 497 ms of which 1 ms to minimize.
[2023-03-14 09:56:18] [INFO ] Deduced a trap composed of 35 places in 476 ms of which 1 ms to minimize.
[2023-03-14 09:56:18] [INFO ] Deduced a trap composed of 92 places in 438 ms of which 1 ms to minimize.
[2023-03-14 09:56:19] [INFO ] Deduced a trap composed of 90 places in 445 ms of which 1 ms to minimize.
[2023-03-14 09:56:19] [INFO ] Deduced a trap composed of 55 places in 470 ms of which 1 ms to minimize.
[2023-03-14 09:56:20] [INFO ] Deduced a trap composed of 48 places in 441 ms of which 0 ms to minimize.
[2023-03-14 09:56:21] [INFO ] Deduced a trap composed of 54 places in 444 ms of which 0 ms to minimize.
[2023-03-14 09:56:21] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 1 ms to minimize.
[2023-03-14 09:56:22] [INFO ] Deduced a trap composed of 14 places in 329 ms of which 1 ms to minimize.
[2023-03-14 09:56:22] [INFO ] Deduced a trap composed of 41 places in 453 ms of which 1 ms to minimize.
[2023-03-14 09:56:23] [INFO ] Deduced a trap composed of 54 places in 514 ms of which 1 ms to minimize.
[2023-03-14 09:56:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10166 ms
[2023-03-14 09:56:24] [INFO ] Added : 9 causal constraints over 4 iterations in 11685 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 72 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 72 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-14 09:56:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:24] [INFO ] Invariant cache hit.
[2023-03-14 09:56:25] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-14 09:56:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:25] [INFO ] Invariant cache hit.
[2023-03-14 09:56:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:26] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2023-03-14 09:56:27] [INFO ] Redundant transitions in 313 ms returned []
[2023-03-14 09:56:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:27] [INFO ] Invariant cache hit.
[2023-03-14 09:56:28] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3795 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-11 in 28170 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:28] [INFO ] Computed 9 place invariants in 26 ms
Incomplete random walk after 10002 steps, including 2 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 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
[2023-03-14 09:56:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:28] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-14 09:56:28] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 09:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:29] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-14 09:56:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:30] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2023-03-14 09:56:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 208 ms returned sat
[2023-03-14 09:56:30] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 0 ms to minimize.
[2023-03-14 09:56:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 716 ms
[2023-03-14 09:56:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 304 ms.
[2023-03-14 09:56:31] [INFO ] Added : 2 causal constraints over 1 iterations in 741 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Graph (complete) has 4586 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 83 ms. Remains 269 /270 variables (removed 1) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:56:31] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 2823 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 1) seen :0
[2023-03-14 09:56:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-14 09:56:36] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-14 09:56:36] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:37] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2023-03-14 09:56:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:37] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2023-03-14 09:56:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 162 ms returned sat
[2023-03-14 09:56:38] [INFO ] Deduced a trap composed of 36 places in 399 ms of which 1 ms to minimize.
[2023-03-14 09:56:39] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 1 ms to minimize.
[2023-03-14 09:56:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1080 ms
[2023-03-14 09:56:39] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 304 ms.
[2023-03-14 09:56:39] [INFO ] Added : 2 causal constraints over 1 iterations in 677 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 88 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 88 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-14 09:56:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:40] [INFO ] Invariant cache hit.
[2023-03-14 09:56:40] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-14 09:56:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:40] [INFO ] Invariant cache hit.
[2023-03-14 09:56:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:42] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2023-03-14 09:56:42] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-14 09:56:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:42] [INFO ] Invariant cache hit.
[2023-03-14 09:56:43] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3623 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-12 in 15304 ms.
Starting property specific reduction for BugTracking-PT-q8m016-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:43] [INFO ] Computed 9 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :5
[2023-03-14 09:56:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:43] [INFO ] Computed 9 place invariants in 23 ms
[2023-03-14 09:56:43] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-14 09:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:44] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2023-03-14 09:56:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:44] [INFO ] [Real]Added 283 Read/Feed constraints in 52 ms returned sat
[2023-03-14 09:56:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-14 09:56:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:45] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-14 09:56:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 67 ms returned sat
[2023-03-14 09:56:45] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2023-03-14 09:56:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2023-03-14 09:56:46] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 279 ms.
[2023-03-14 09:56:46] [INFO ] Added : 2 causal constraints over 1 iterations in 642 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[5]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 270/270 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:46] [INFO ] Computed 9 place invariants in 20 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 2498 ms. (steps per millisecond=400 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1713 ms. (steps per millisecond=583 ) properties (out of 1) seen :4
[2023-03-14 09:56:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 270 cols
[2023-03-14 09:56:50] [INFO ] Computed 9 place invariants in 28 ms
[2023-03-14 09:56:51] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:51] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2023-03-14 09:56:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:51] [INFO ] [Real]Added 283 Read/Feed constraints in 52 ms returned sat
[2023-03-14 09:56:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 09:56:51] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-14 09:56:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 09:56:52] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2023-03-14 09:56:52] [INFO ] [Nat]Added 283 Read/Feed constraints in 90 ms returned sat
[2023-03-14 09:56:53] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 1 ms to minimize.
[2023-03-14 09:56:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 608 ms
[2023-03-14 09:56:53] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 282 ms.
[2023-03-14 09:56:53] [INFO ] Added : 2 causal constraints over 1 iterations in 668 ms. Result :sat
Current structural bounds on expressions (after SMT) : [16] Max seen :[5]
Support contains 1 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 270/270 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 270 /270 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-14 09:56:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:54] [INFO ] Invariant cache hit.
[2023-03-14 09:56:54] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-14 09:56:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:54] [INFO ] Invariant cache hit.
[2023-03-14 09:56:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-14 09:56:55] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2023-03-14 09:56:56] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-14 09:56:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-14 09:56:56] [INFO ] Invariant cache hit.
[2023-03-14 09:56:57] [INFO ] Dead Transitions using invariants and state equation in 1039 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3197 ms. Remains : 270/270 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m016-UpperBounds-13 in 13431 ms.
[2023-03-14 09:56:57] [INFO ] Flatten gal took : 296 ms
[2023-03-14 09:56:57] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-14 09:56:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 3871 transitions and 19051 arcs took 17 ms.
Total runtime 96184 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BugTracking (PT), instance q8m016
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: 270 places, 3871 transitions, 19051 arcs.
Final Score: 42057.123
Took : 70 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5998060 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16086668 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-q8m016"
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-q8m016, 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-167813696800413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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