Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K Feb 26 07:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 07:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678633146773

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:59:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 14:59:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:59:10] [INFO ] Load time of PNML (sax parser for PT used): 1025 ms
[2023-03-12 14:59:10] [INFO ] Transformed 754 places.
[2023-03-12 14:59:10] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:59:10] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1233 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 474 places in 205 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m002-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-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-12 14:59:10] [INFO ] Computed 10 place invariants in 43 ms
Incomplete random walk after 10000 steps, including 203 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
FORMULA BugTracking-PT-q8m002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
[2023-03-12 14:59:11] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-12 14:59:11] [INFO ] Computed 10 place invariants in 45 ms
[2023-03-12 14:59:11] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2023-03-12 14:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:12] [INFO ] [Real]Absence check using state equation in 614 ms returned sat
[2023-03-12 14:59:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:59:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 81 ms returned sat
[2023-03-12 14:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:15] [INFO ] [Nat]Absence check using state equation in 3209 ms returned sat
[2023-03-12 14:59:15] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 14:59:16] [INFO ] [Nat]Added 303 Read/Feed constraints in 173 ms returned sat
[2023-03-12 14:59:17] [INFO ] Deduced a trap composed of 20 places in 1622 ms of which 19 ms to minimize.
[2023-03-12 14:59:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:59:17] [INFO ] [Real]Absence check using 10 positive place invariants in 19 ms returned sat
[2023-03-12 14:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:18] [INFO ] [Real]Absence check using state equation in 1006 ms returned sat
[2023-03-12 14:59:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:59:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-12 14:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:19] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-12 14:59:20] [INFO ] [Nat]Added 303 Read/Feed constraints in 218 ms returned sat
[2023-03-12 14:59:20] [INFO ] Deduced a trap composed of 61 places in 768 ms of which 2 ms to minimize.
[2023-03-12 14:59:21] [INFO ] Deduced a trap composed of 57 places in 806 ms of which 1 ms to minimize.
[2023-03-12 14:59:22] [INFO ] Deduced a trap composed of 58 places in 757 ms of which 2 ms to minimize.
[2023-03-12 14:59:23] [INFO ] Deduced a trap composed of 47 places in 739 ms of which 2 ms to minimize.
[2023-03-12 14:59:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3728 ms
[2023-03-12 14:59:24] [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 1
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:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 14:59:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-12 14:59:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:24] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2023-03-12 14:59:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:59:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-12 14:59:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:25] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-12 14:59:25] [INFO ] [Nat]Added 303 Read/Feed constraints in 161 ms returned sat
[2023-03-12 14:59:26] [INFO ] Deduced a trap composed of 14 places in 348 ms of which 1 ms to minimize.
[2023-03-12 14:59:26] [INFO ] Deduced a trap composed of 60 places in 502 ms of which 0 ms to minimize.
[2023-03-12 14:59:27] [INFO ] Deduced a trap composed of 47 places in 452 ms of which 2 ms to minimize.
[2023-03-12 14:59:27] [INFO ] Deduced a trap composed of 61 places in 356 ms of which 1 ms to minimize.
[2023-03-12 14:59:28] [INFO ] Deduced a trap composed of 60 places in 349 ms of which 0 ms to minimize.
[2023-03-12 14:59:28] [INFO ] Deduced a trap composed of 59 places in 331 ms of which 1 ms to minimize.
[2023-03-12 14:59:28] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2023-03-12 14:59:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3422 ms
[2023-03-12 14:59:29] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 404 ms.
[2023-03-12 14:59:29] [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: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: 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:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 1]
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.24 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 4 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 572 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 573 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-12 14:59:30] [INFO ] Computed 8 place invariants in 37 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8366 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4 resets, run finished after 2568 ms. (steps per millisecond=389 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2351 ms. (steps per millisecond=425 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6 resets, run finished after 2568 ms. (steps per millisecond=389 ) properties (out of 3) seen :0
[2023-03-12 14:59:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 14:59:46] [INFO ] Computed 8 place invariants in 41 ms
[2023-03-12 14:59:46] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:46] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2023-03-12 14:59:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:59:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 14:59:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:47] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2023-03-12 14:59:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 14:59:47] [INFO ] [Nat]Added 283 Read/Feed constraints in 140 ms returned sat
[2023-03-12 14:59:48] [INFO ] Deduced a trap composed of 54 places in 614 ms of which 1 ms to minimize.
[2023-03-12 14:59:49] [INFO ] Deduced a trap composed of 85 places in 554 ms of which 1 ms to minimize.
[2023-03-12 14:59:49] [INFO ] Deduced a trap composed of 129 places in 584 ms of which 1 ms to minimize.
[2023-03-12 14:59:50] [INFO ] Deduced a trap composed of 26 places in 529 ms of which 1 ms to minimize.
[2023-03-12 14:59:50] [INFO ] Deduced a trap composed of 56 places in 493 ms of which 0 ms to minimize.
[2023-03-12 14:59:51] [INFO ] Deduced a trap composed of 103 places in 516 ms of which 0 ms to minimize.
[2023-03-12 14:59:52] [INFO ] Deduced a trap composed of 68 places in 536 ms of which 0 ms to minimize.
[2023-03-12 14:59:52] [INFO ] Deduced a trap composed of 62 places in 474 ms of which 1 ms to minimize.
[2023-03-12 14:59:53] [INFO ] Deduced a trap composed of 14 places in 462 ms of which 0 ms to minimize.
[2023-03-12 14:59:54] [INFO ] Deduced a trap composed of 38 places in 470 ms of which 1 ms to minimize.
[2023-03-12 14:59:54] [INFO ] Deduced a trap composed of 59 places in 427 ms of which 0 ms to minimize.
[2023-03-12 14:59:55] [INFO ] Deduced a trap composed of 35 places in 488 ms of which 1 ms to minimize.
[2023-03-12 14:59:56] [INFO ] Deduced a trap composed of 56 places in 558 ms of which 0 ms to minimize.
[2023-03-12 14:59:56] [INFO ] Deduced a trap composed of 98 places in 473 ms of which 1 ms to minimize.
[2023-03-12 14:59:56] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9159 ms
[2023-03-12 14:59:57] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 558 ms.
[2023-03-12 14:59:57] [INFO ] Added : 3 causal constraints over 1 iterations in 1002 ms. Result :sat
[2023-03-12 14:59:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:58] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-12 14:59:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 14:59:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 14:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 14:59:59] [INFO ] [Nat]Absence check using state equation in 1006 ms returned sat
[2023-03-12 15:00:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 239 ms returned sat
[2023-03-12 15:00:00] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2023-03-12 15:00:01] [INFO ] Deduced a trap composed of 26 places in 441 ms of which 0 ms to minimize.
[2023-03-12 15:00:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1113 ms
[2023-03-12 15:00:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 366 ms.
[2023-03-12 15:00:02] [INFO ] Added : 2 causal constraints over 1 iterations in 775 ms. Result :sat
[2023-03-12 15:00:02] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:02] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2023-03-12 15:00:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:00:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:04] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2023-03-12 15:00:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 188 ms returned sat
[2023-03-12 15:00:04] [INFO ] Deduced a trap composed of 76 places in 422 ms of which 1 ms to minimize.
[2023-03-12 15:00:05] [INFO ] Deduced a trap composed of 83 places in 412 ms of which 0 ms to minimize.
[2023-03-12 15:00:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1171 ms
[2023-03-12 15:00:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 429 ms.
[2023-03-12 15:00:06] [INFO ] Added : 4 causal constraints over 1 iterations in 868 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[0, 0, 1]
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 122 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 122 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 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:00:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:06] [INFO ] Invariant cache hit.
[2023-03-12 15:00:07] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-12 15:00:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:07] [INFO ] Invariant cache hit.
[2023-03-12 15:00:07] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:09] [INFO ] Implicit Places using invariants and state equation in 2223 ms returned []
Implicit Place search using SMT with State Equation took 2700 ms to find 0 implicit places.
[2023-03-12 15:00:09] [INFO ] Redundant transitions in 377 ms returned []
[2023-03-12 15:00:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:09] [INFO ] Invariant cache hit.
[2023-03-12 15:00:11] [INFO ] Dead Transitions using invariants and state equation in 1416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4620 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:11] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
[2023-03-12 15:00:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:11] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-12 15:00:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:12] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-12 15:00:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:00:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-12 15:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:13] [INFO ] [Nat]Absence check using state equation in 693 ms returned sat
[2023-03-12 15:00:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:13] [INFO ] [Nat]Added 283 Read/Feed constraints in 232 ms returned sat
[2023-03-12 15:00:14] [INFO ] Deduced a trap composed of 54 places in 579 ms of which 0 ms to minimize.
[2023-03-12 15:00:14] [INFO ] Deduced a trap composed of 85 places in 613 ms of which 0 ms to minimize.
[2023-03-12 15:00:15] [INFO ] Deduced a trap composed of 129 places in 682 ms of which 1 ms to minimize.
[2023-03-12 15:00:16] [INFO ] Deduced a trap composed of 26 places in 556 ms of which 1 ms to minimize.
[2023-03-12 15:00:17] [INFO ] Deduced a trap composed of 56 places in 597 ms of which 40 ms to minimize.
[2023-03-12 15:00:17] [INFO ] Deduced a trap composed of 103 places in 497 ms of which 1 ms to minimize.
[2023-03-12 15:00:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 114 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 115 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-12 15:00:17] [INFO ] Computed 8 place invariants in 27 ms
Incomplete random walk after 1000001 steps, including 6 resets, run finished after 6478 ms. (steps per millisecond=154 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2205 ms. (steps per millisecond=453 ) properties (out of 1) seen :0
[2023-03-12 15:00:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:26] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:00:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:27] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2023-03-12 15:00:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:00:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:27] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2023-03-12 15:00:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:28] [INFO ] [Nat]Added 283 Read/Feed constraints in 144 ms returned sat
[2023-03-12 15:00:29] [INFO ] Deduced a trap composed of 54 places in 964 ms of which 1 ms to minimize.
[2023-03-12 15:00:29] [INFO ] Deduced a trap composed of 85 places in 628 ms of which 0 ms to minimize.
[2023-03-12 15:00:30] [INFO ] Deduced a trap composed of 129 places in 596 ms of which 1 ms to minimize.
[2023-03-12 15:00:31] [INFO ] Deduced a trap composed of 26 places in 478 ms of which 1 ms to minimize.
[2023-03-12 15:00:31] [INFO ] Deduced a trap composed of 56 places in 501 ms of which 1 ms to minimize.
[2023-03-12 15:00:32] [INFO ] Deduced a trap composed of 103 places in 507 ms of which 1 ms to minimize.
[2023-03-12 15:00:32] [INFO ] Deduced a trap composed of 68 places in 501 ms of which 1 ms to minimize.
[2023-03-12 15:00:33] [INFO ] Deduced a trap composed of 62 places in 469 ms of which 0 ms to minimize.
[2023-03-12 15:00:34] [INFO ] Deduced a trap composed of 14 places in 399 ms of which 0 ms to minimize.
[2023-03-12 15:00:34] [INFO ] Deduced a trap composed of 38 places in 524 ms of which 1 ms to minimize.
[2023-03-12 15:00:35] [INFO ] Deduced a trap composed of 59 places in 525 ms of which 0 ms to minimize.
[2023-03-12 15:00:36] [INFO ] Deduced a trap composed of 35 places in 466 ms of which 0 ms to minimize.
[2023-03-12 15:00:36] [INFO ] Deduced a trap composed of 56 places in 482 ms of which 1 ms to minimize.
[2023-03-12 15:00:37] [INFO ] Deduced a trap composed of 98 places in 519 ms of which 1 ms to minimize.
[2023-03-12 15:00:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9602 ms
[2023-03-12 15:00:38] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 368 ms.
[2023-03-12 15:00:38] [INFO ] Added : 3 causal constraints over 1 iterations in 842 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 92 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:00:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:38] [INFO ] Invariant cache hit.
[2023-03-12 15:00:39] [INFO ] Implicit Places using invariants in 723 ms returned []
[2023-03-12 15:00:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:39] [INFO ] Invariant cache hit.
[2023-03-12 15:00:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:41] [INFO ] Implicit Places using invariants and state equation in 2029 ms returned []
Implicit Place search using SMT with State Equation took 2783 ms to find 0 implicit places.
[2023-03-12 15:00:42] [INFO ] Redundant transitions in 317 ms returned []
[2023-03-12 15:00:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:00:42] [INFO ] Invariant cache hit.
[2023-03-12 15:00:43] [INFO ] Dead Transitions using invariants and state equation in 1678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4881 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-02 in 32336 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:43] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
[2023-03-12 15:00:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:44] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 15:00:44] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:44] [INFO ] [Real]Absence check using state equation in 587 ms returned sat
[2023-03-12 15:00:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:00:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:45] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2023-03-12 15:00:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 189 ms returned sat
[2023-03-12 15:00:45] [INFO ] Deduced a trap composed of 17 places in 418 ms of which 14 ms to minimize.
[2023-03-12 15:00:46] [INFO ] Deduced a trap composed of 26 places in 480 ms of which 0 ms to minimize.
[2023-03-12 15:00:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1187 ms
[2023-03-12 15:00:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 397 ms.
[2023-03-12 15:00:47] [INFO ] Added : 2 causal constraints over 1 iterations in 841 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 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-12 15:00:47] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6996 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties (out of 1) seen :0
[2023-03-12 15:00:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:00:56] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-12 15:00:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:00:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:57] [INFO ] [Real]Absence check using state equation in 943 ms returned sat
[2023-03-12 15:00:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:00:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:00:58] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-12 15:00:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:00:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 221 ms returned sat
[2023-03-12 15:00:59] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2023-03-12 15:01:00] [INFO ] Deduced a trap composed of 26 places in 742 ms of which 1 ms to minimize.
[2023-03-12 15:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1478 ms
[2023-03-12 15:01:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 343 ms.
[2023-03-12 15:01:01] [INFO ] Added : 2 causal constraints over 1 iterations in 757 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 52 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 53 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 50 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:01:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:01] [INFO ] Invariant cache hit.
[2023-03-12 15:01:02] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-12 15:01:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:02] [INFO ] Invariant cache hit.
[2023-03-12 15:01:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:03] [INFO ] Implicit Places using invariants and state equation in 1876 ms returned []
Implicit Place search using SMT with State Equation took 2441 ms to find 0 implicit places.
[2023-03-12 15:01:04] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-12 15:01:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:04] [INFO ] Invariant cache hit.
[2023-03-12 15:01:06] [INFO ] Dead Transitions using invariants and state equation in 2016 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4639 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-08 in 22386 ms.
Starting property specific reduction for BugTracking-PT-q8m002-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:01:06] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
[2023-03-12 15:01:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:01:06] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-12 15:01:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:01:07] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2023-03-12 15:01:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:01:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:01:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:01:07] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-12 15:01:07] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 121 ms returned sat
[2023-03-12 15:01:08] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 1 ms to minimize.
[2023-03-12 15:01:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 589 ms
[2023-03-12 15:01:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 478 ms.
[2023-03-12 15:01:09] [INFO ] Added : 4 causal constraints over 1 iterations in 991 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 55 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 56 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-12 15:01:09] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 6878 ms. (steps per millisecond=145 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5 resets, run finished after 2325 ms. (steps per millisecond=430 ) properties (out of 1) seen :0
[2023-03-12 15:01:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:01:18] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:01:19] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 15:01:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 15:01:19] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-12 15:01:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 15:01:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 15:01:20] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-03-12 15:01:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 150 ms returned sat
[2023-03-12 15:01:21] [INFO ] Deduced a trap composed of 35 places in 457 ms of which 5 ms to minimize.
[2023-03-12 15:01:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 653 ms
[2023-03-12 15:01:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 472 ms.
[2023-03-12 15:01:22] [INFO ] Added : 4 causal constraints over 1 iterations in 984 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 49 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:01:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:22] [INFO ] Invariant cache hit.
[2023-03-12 15:01:23] [INFO ] Implicit Places using invariants in 600 ms returned []
[2023-03-12 15:01:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:23] [INFO ] Invariant cache hit.
[2023-03-12 15:01:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:01:25] [INFO ] Implicit Places using invariants and state equation in 2411 ms returned []
Implicit Place search using SMT with State Equation took 3014 ms to find 0 implicit places.
[2023-03-12 15:01:25] [INFO ] Redundant transitions in 141 ms returned []
[2023-03-12 15:01:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:01:25] [INFO ] Invariant cache hit.
[2023-03-12 15:01:26] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4434 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m002-UpperBounds-11 in 20669 ms.
[2023-03-12 15:01:27] [INFO ] Flatten gal took : 462 ms
[2023-03-12 15:01:27] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-12 15:01:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 269 places, 3871 transitions and 19045 arcs took 19 ms.
Total runtime 138527 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/792/ub_0_ --maxsum=/tmp/792/ub_1_ --maxsum=/tmp/792/ub_2_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15778768 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081644 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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