Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r323-tall-165472292600046.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is BugTracking-PT-q8m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 16:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 7 16:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 7 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 20K Jun 7 16:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Jun 7 16:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 7 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 7 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Jun 6 15:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 16M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654744812936

Running Version 0
[2022-06-09 03:20:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:20:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:20:15] [INFO ] Load time of PNML (sax parser for PT used): 813 ms
[2022-06-09 03:20:15] [INFO ] Transformed 754 places.
[2022-06-09 03:20:15] [INFO ] Transformed 27370 transitions.
[2022-06-09 03:20:15] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 963 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 474 places in 125 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 03:20:15] [INFO ] Computed 10 place invariants in 70 ms
Incomplete random walk after 10186 steps, including 4 resets, run finished after 67 ms. (steps per millisecond=152 ) properties (out of 6) seen :1
FORMULA BugTracking-PT-q8m256-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :1
FORMULA BugTracking-PT-q8m256-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
[2022-06-09 03:20:16] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 03:20:16] [INFO ] Computed 10 place invariants in 17 ms
[2022-06-09 03:20:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-06-09 03:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:16] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2022-06-09 03:20:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:20:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:17] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-09 03:20:17] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 03:20:17] [INFO ] [Nat]Added 316 Read/Feed constraints in 208 ms returned sat
[2022-06-09 03:20:18] [INFO ] Deduced a trap composed of 105 places in 448 ms of which 6 ms to minimize.
[2022-06-09 03:20:19] [INFO ] Deduced a trap composed of 68 places in 463 ms of which 1 ms to minimize.
[2022-06-09 03:20:19] [INFO ] Deduced a trap composed of 67 places in 361 ms of which 1 ms to minimize.
[2022-06-09 03:20:19] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 2 ms to minimize.
[2022-06-09 03:20:20] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 1 ms to minimize.
[2022-06-09 03:20:20] [INFO ] Deduced a trap composed of 104 places in 378 ms of which 0 ms to minimize.
[2022-06-09 03:20:21] [INFO ] Deduced a trap composed of 17 places in 389 ms of which 0 ms to minimize.
[2022-06-09 03:20:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3557 ms
[2022-06-09 03:20:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 289 ms.
[2022-06-09 03:20:22] [INFO ] Deduced a trap composed of 15 places in 576 ms of which 2 ms to minimize.
[2022-06-09 03:20:22] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:20:22] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:23] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-06-09 03:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:20:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:23] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-09 03:20:24] [INFO ] [Nat]Added 316 Read/Feed constraints in 201 ms returned sat
[2022-06-09 03:20:24] [INFO ] Deduced a trap composed of 25 places in 511 ms of which 0 ms to minimize.
[2022-06-09 03:20:25] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 0 ms to minimize.
[2022-06-09 03:20:25] [INFO ] Deduced a trap composed of 19 places in 215 ms of which 1 ms to minimize.
[2022-06-09 03:20:25] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 0 ms to minimize.
[2022-06-09 03:20:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1740 ms
[2022-06-09 03:20:26] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 215 ms.
[2022-06-09 03:20: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:20:28] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 03:20:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:28] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2022-06-09 03:20:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:20:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:29] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-09 03:20:29] [INFO ] [Nat]Added 316 Read/Feed constraints in 183 ms returned sat
[2022-06-09 03:20:30] [INFO ] Deduced a trap composed of 56 places in 455 ms of which 0 ms to minimize.
[2022-06-09 03:20:30] [INFO ] Deduced a trap composed of 56 places in 524 ms of which 0 ms to minimize.
[2022-06-09 03:20:31] [INFO ] Deduced a trap composed of 57 places in 565 ms of which 0 ms to minimize.
[2022-06-09 03:20:32] [INFO ] Deduced a trap composed of 56 places in 486 ms of which 0 ms to minimize.
[2022-06-09 03:20:32] [INFO ] Deduced a trap composed of 56 places in 483 ms of which 0 ms to minimize.
[2022-06-09 03:20:33] [INFO ] Deduced a trap composed of 14 places in 530 ms of which 0 ms to minimize.
[2022-06-09 03:20:33] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 1 ms to minimize.
[2022-06-09 03:20:34] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 0 ms to minimize.
[2022-06-09 03:20:34] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:20:34] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:34] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2022-06-09 03:20:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:20:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:35] [INFO ] [Nat]Absence check using state equation in 454 ms returned sat
[2022-06-09 03:20:35] [INFO ] [Nat]Added 316 Read/Feed constraints in 186 ms returned sat
[2022-06-09 03:20:35] [INFO ] Deduced a trap composed of 14 places in 446 ms of which 1 ms to minimize.
[2022-06-09 03:20:36] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 2 ms to minimize.
[2022-06-09 03:20:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 984 ms
[2022-06-09 03:20:36] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 221 ms.
[2022-06-09 03:20:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions, 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.14 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 349 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:20:40] [INFO ] Computed 8 place invariants in 19 ms
Incomplete random walk after 1000109 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2054 ms. (steps per millisecond=486 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2109 ms. (steps per millisecond=474 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1983 ms. (steps per millisecond=504 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 4) seen :0
[2022-06-09 03:20:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:20:48] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 03:20:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 03:20:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:49] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-06-09 03:20:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:20:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:20:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:20:50] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-06-09 03:20:50] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:20:50] [INFO ] [Nat]Added 296 Read/Feed constraints in 192 ms returned sat
[2022-06-09 03:20:50] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 1 ms to minimize.
[2022-06-09 03:20:51] [INFO ] Deduced a trap composed of 66 places in 319 ms of which 1 ms to minimize.
[2022-06-09 03:20:51] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 0 ms to minimize.
[2022-06-09 03:20:51] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 0 ms to minimize.
[2022-06-09 03:20:52] [INFO ] Deduced a trap composed of 90 places in 342 ms of which 1 ms to minimize.
[2022-06-09 03:20:52] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 0 ms to minimize.
[2022-06-09 03:20:53] [INFO ] Deduced a trap composed of 57 places in 329 ms of which 0 ms to minimize.
[2022-06-09 03:20:53] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 1 ms to minimize.
[2022-06-09 03:20:53] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 0 ms to minimize.
[2022-06-09 03:20:54] [INFO ] Deduced a trap composed of 56 places in 340 ms of which 1 ms to minimize.
[2022-06-09 03:20:54] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 0 ms to minimize.
[2022-06-09 03:20:55] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 2 ms to minimize.
[2022-06-09 03:20:55] [INFO ] Deduced a trap composed of 18 places in 338 ms of which 5 ms to minimize.
[2022-06-09 03:20:56] [INFO ] Deduced a trap composed of 91 places in 341 ms of which 0 ms to minimize.
[2022-06-09 03:20:56] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2022-06-09 03:20:56] [INFO ] Deduced a trap composed of 90 places in 348 ms of which 0 ms to minimize.
[2022-06-09 03:20:57] [INFO ] Deduced a trap composed of 90 places in 319 ms of which 1 ms to minimize.
[2022-06-09 03:20:57] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 0 ms to minimize.
[2022-06-09 03:20:58] [INFO ] Deduced a trap composed of 90 places in 321 ms of which 1 ms to minimize.
[2022-06-09 03:20:58] [INFO ] Deduced a trap composed of 90 places in 325 ms of which 0 ms to minimize.
[2022-06-09 03:20:59] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 1 ms to minimize.
[2022-06-09 03:20:59] [INFO ] Deduced a trap composed of 90 places in 349 ms of which 1 ms to minimize.
[2022-06-09 03:20:59] [INFO ] Deduced a trap composed of 90 places in 329 ms of which 0 ms to minimize.
[2022-06-09 03:21:00] [INFO ] Deduced a trap composed of 90 places in 327 ms of which 1 ms to minimize.
[2022-06-09 03:21:00] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 0 ms to minimize.
[2022-06-09 03:21:01] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 1 ms to minimize.
[2022-06-09 03:21:01] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 1 ms to minimize.
[2022-06-09 03:21:02] [INFO ] Deduced a trap composed of 90 places in 350 ms of which 0 ms to minimize.
[2022-06-09 03:21:02] [INFO ] Deduced a trap composed of 90 places in 317 ms of which 1 ms to minimize.
[2022-06-09 03:21:02] [INFO ] Deduced a trap composed of 90 places in 321 ms of which 0 ms to minimize.
[2022-06-09 03:21:03] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 12784 ms
[2022-06-09 03:21:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 200 ms.
[2022-06-09 03:21:06] [INFO ] Deduced a trap composed of 69 places in 345 ms of which 1 ms to minimize.
[2022-06-09 03:21:07] [INFO ] Deduced a trap composed of 38 places in 320 ms of which 1 ms to minimize.
[2022-06-09 03:21:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1009 ms
[2022-06-09 03:21:07] [INFO ] Added : 114 causal constraints over 24 iterations in 4953 ms. Result :sat
[2022-06-09 03:21:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:08] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2022-06-09 03:21:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 03:21:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:09] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2022-06-09 03:21:09] [INFO ] [Nat]Added 296 Read/Feed constraints in 216 ms returned sat
[2022-06-09 03:21:09] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 0 ms to minimize.
[2022-06-09 03:21:10] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 4 ms to minimize.
[2022-06-09 03:21:10] [INFO ] Deduced a trap composed of 103 places in 363 ms of which 0 ms to minimize.
[2022-06-09 03:21:11] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 1 ms to minimize.
[2022-06-09 03:21:11] [INFO ] Deduced a trap composed of 74 places in 273 ms of which 1 ms to minimize.
[2022-06-09 03:21:11] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 3 ms to minimize.
[2022-06-09 03:21:12] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 1 ms to minimize.
[2022-06-09 03:21:12] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 0 ms to minimize.
[2022-06-09 03:21:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3464 ms
[2022-06-09 03:21:13] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 233 ms.
[2022-06-09 03:21:17] [INFO ] Added : 140 causal constraints over 28 iterations in 4274 ms. Result :sat
[2022-06-09 03:21:17] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-09 03:21:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:17] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2022-06-09 03:21:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:21:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:18] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-06-09 03:21:18] [INFO ] [Nat]Added 296 Read/Feed constraints in 214 ms returned sat
[2022-06-09 03:21:18] [INFO ] Deduced a trap composed of 16 places in 432 ms of which 1 ms to minimize.
[2022-06-09 03:21:19] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 0 ms to minimize.
[2022-06-09 03:21:19] [INFO ] Deduced a trap composed of 17 places in 398 ms of which 1 ms to minimize.
[2022-06-09 03:21:20] [INFO ] Deduced a trap composed of 26 places in 398 ms of which 3 ms to minimize.
[2022-06-09 03:21:20] [INFO ] Deduced a trap composed of 13 places in 265 ms of which 2 ms to minimize.
[2022-06-09 03:21:20] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 9 ms to minimize.
[2022-06-09 03:21:20] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2597 ms
[2022-06-09 03:21:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 228 ms.
[2022-06-09 03:21:24] [INFO ] Added : 102 causal constraints over 21 iterations in 3298 ms. Result :sat
[2022-06-09 03:21:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:24] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2022-06-09 03:21:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:21:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:21:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:21:25] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2022-06-09 03:21:25] [INFO ] [Nat]Added 296 Read/Feed constraints in 191 ms returned sat
[2022-06-09 03:21:25] [INFO ] Deduced a trap composed of 22 places in 229 ms of which 1 ms to minimize.
[2022-06-09 03:21:26] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 0 ms to minimize.
[2022-06-09 03:21:26] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 0 ms to minimize.
[2022-06-09 03:21:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1010 ms
[2022-06-09 03:21:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 211 ms.
[2022-06-09 03:21:30] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2022-06-09 03:21:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 389 ms
[2022-06-09 03:21:30] [INFO ] Added : 123 causal constraints over 25 iterations in 4257 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 1512100 steps, including 1000 resets, run finished after 13378 ms. (steps per millisecond=113 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1224400 steps, including 1000 resets, run finished after 9736 ms. (steps per millisecond=125 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1272700 steps, including 1000 resets, run finished after 9935 ms. (steps per millisecond=128 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1138600 steps, including 1000 resets, run finished after 8773 ms. (steps per millisecond=129 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 03:22:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:12] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 03:22:13] [INFO ] Implicit Places using invariants in 512 ms returned []
[2022-06-09 03:22:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:13] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 03:22:14] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:22:20] [INFO ] Implicit Places using invariants and state equation in 6656 ms returned []
Implicit Place search using SMT with State Equation took 7170 ms to find 0 implicit places.
[2022-06-09 03:22:20] [INFO ] Redundant transitions in 315 ms returned []
[2022-06-09 03:22:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:20] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 03:22:21] [INFO ] Dead Transitions using invariants and state equation in 1002 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:21] [INFO ] Computed 8 place invariants in 15 ms
Incomplete random walk after 10132 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1447 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2022-06-09 03:22:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:21] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 03:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:22] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2022-06-09 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:22] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-06-09 03:22:22] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:22:22] [INFO ] [Nat]Added 296 Read/Feed constraints in 195 ms returned sat
[2022-06-09 03:22:23] [INFO ] Deduced a trap composed of 26 places in 315 ms of which 0 ms to minimize.
[2022-06-09 03:22:23] [INFO ] Deduced a trap composed of 66 places in 335 ms of which 0 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 58 places in 335 ms of which 1 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 90 places in 365 ms of which 0 ms to minimize.
[2022-06-09 03:22:24] [INFO ] Deduced a trap composed of 90 places in 334 ms of which 0 ms to minimize.
[2022-06-09 03:22:25] [INFO ] Deduced a trap composed of 58 places in 339 ms of which 0 ms to minimize.
[2022-06-09 03:22:25] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 0 ms to minimize.
[2022-06-09 03:22:26] [INFO ] Deduced a trap composed of 58 places in 323 ms of which 0 ms to minimize.
[2022-06-09 03:22:26] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 0 ms to minimize.
[2022-06-09 03:22:26] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 0 ms to minimize.
[2022-06-09 03:22:27] [INFO ] Deduced a trap composed of 53 places in 319 ms of which 1 ms to minimize.
[2022-06-09 03:22:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:27] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 1000212 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1822 ms. (steps per millisecond=548 ) properties (out of 1) seen :0
[2022-06-09 03:22:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:29] [INFO ] Computed 8 place invariants in 8 ms
[2022-06-09 03:22:29] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 03:22:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:30] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2022-06-09 03:22:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:22:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:22:30] [INFO ] [Nat]Absence check using state equation in 442 ms returned sat
[2022-06-09 03:22:30] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:22:31] [INFO ] [Nat]Added 296 Read/Feed constraints in 191 ms returned sat
[2022-06-09 03:22:31] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 0 ms to minimize.
[2022-06-09 03:22:31] [INFO ] Deduced a trap composed of 66 places in 315 ms of which 1 ms to minimize.
[2022-06-09 03:22:32] [INFO ] Deduced a trap composed of 58 places in 328 ms of which 0 ms to minimize.
[2022-06-09 03:22:32] [INFO ] Deduced a trap composed of 90 places in 325 ms of which 0 ms to minimize.
[2022-06-09 03:22:33] [INFO ] Deduced a trap composed of 90 places in 323 ms of which 1 ms to minimize.
[2022-06-09 03:22:33] [INFO ] Deduced a trap composed of 58 places in 319 ms of which 0 ms to minimize.
[2022-06-09 03:22:33] [INFO ] Deduced a trap composed of 57 places in 317 ms of which 1 ms to minimize.
[2022-06-09 03:22:34] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 0 ms to minimize.
[2022-06-09 03:22:34] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 0 ms to minimize.
[2022-06-09 03:22:35] [INFO ] Deduced a trap composed of 56 places in 327 ms of which 0 ms to minimize.
[2022-06-09 03:22:35] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 0 ms to minimize.
[2022-06-09 03:22:35] [INFO ] Deduced a trap composed of 56 places in 328 ms of which 0 ms to minimize.
[2022-06-09 03:22:36] [INFO ] Deduced a trap composed of 18 places in 318 ms of which 0 ms to minimize.
[2022-06-09 03:22:36] [INFO ] Deduced a trap composed of 91 places in 361 ms of which 0 ms to minimize.
[2022-06-09 03:22:37] [INFO ] Deduced a trap composed of 17 places in 325 ms of which 0 ms to minimize.
[2022-06-09 03:22:37] [INFO ] Deduced a trap composed of 90 places in 312 ms of which 0 ms to minimize.
[2022-06-09 03:22:38] [INFO ] Deduced a trap composed of 90 places in 318 ms of which 0 ms to minimize.
[2022-06-09 03:22:38] [INFO ] Deduced a trap composed of 90 places in 316 ms of which 1 ms to minimize.
[2022-06-09 03:22:38] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 0 ms to minimize.
[2022-06-09 03:22:39] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 0 ms to minimize.
[2022-06-09 03:22:39] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 0 ms to minimize.
[2022-06-09 03:22:40] [INFO ] Deduced a trap composed of 90 places in 313 ms of which 0 ms to minimize.
[2022-06-09 03:22:40] [INFO ] Deduced a trap composed of 90 places in 339 ms of which 1 ms to minimize.
[2022-06-09 03:22:40] [INFO ] Deduced a trap composed of 90 places in 314 ms of which 0 ms to minimize.
[2022-06-09 03:22:41] [INFO ] Deduced a trap composed of 90 places in 311 ms of which 0 ms to minimize.
[2022-06-09 03:22:41] [INFO ] Deduced a trap composed of 90 places in 307 ms of which 1 ms to minimize.
[2022-06-09 03:22:42] [INFO ] Deduced a trap composed of 90 places in 317 ms of which 1 ms to minimize.
[2022-06-09 03:22:42] [INFO ] Deduced a trap composed of 90 places in 315 ms of which 1 ms to minimize.
[2022-06-09 03:22:42] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 1 ms to minimize.
[2022-06-09 03:22:43] [INFO ] Deduced a trap composed of 90 places in 322 ms of which 0 ms to minimize.
[2022-06-09 03:22:43] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 12436 ms
[2022-06-09 03:22:43] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 219 ms.
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 69 places in 325 ms of which 1 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Deduced a trap composed of 38 places in 323 ms of which 0 ms to minimize.
[2022-06-09 03:22:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 990 ms
[2022-06-09 03:22:48] [INFO ] Added : 114 causal constraints over 24 iterations in 4892 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1138600 steps, including 1000 resets, run finished after 8786 ms. (steps per millisecond=129 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, 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.
[2022-06-09 03:22:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:57] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 03:22:57] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-06-09 03:22:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:22:57] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 03:22:58] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:04] [INFO ] Implicit Places using invariants and state equation in 6860 ms returned []
Implicit Place search using SMT with State Equation took 7280 ms to find 0 implicit places.
[2022-06-09 03:23:04] [INFO ] Redundant transitions in 222 ms returned []
[2022-06-09 03:23:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:04] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 03:23:05] [INFO ] Dead Transitions using invariants and state equation in 1052 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-01 in 44448 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:05] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10091 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
[2022-06-09 03:23:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:05] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:06] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-06-09 03:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:07] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2022-06-09 03:23:07] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:07] [INFO ] [Nat]Added 296 Read/Feed constraints in 211 ms returned sat
[2022-06-09 03:23:07] [INFO ] Deduced a trap composed of 14 places in 464 ms of which 0 ms to minimize.
[2022-06-09 03:23:08] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 1 ms to minimize.
[2022-06-09 03:23:08] [INFO ] Deduced a trap composed of 103 places in 364 ms of which 0 ms to minimize.
[2022-06-09 03:23:09] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 1 ms to minimize.
[2022-06-09 03:23:09] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 1 ms to minimize.
[2022-06-09 03:23:10] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 0 ms to minimize.
[2022-06-09 03:23:10] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 0 ms to minimize.
[2022-06-09 03:23:10] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 1 ms to minimize.
[2022-06-09 03:23:10] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3523 ms
[2022-06-09 03:23:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 244 ms.
[2022-06-09 03:23:11] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:11] [INFO ] Computed 8 place invariants in 12 ms
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=1996 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1891 ms. (steps per millisecond=528 ) properties (out of 1) seen :0
[2022-06-09 03:23:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:14] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 03:23:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:14] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-06-09 03:23:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:15] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2022-06-09 03:23:15] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:15] [INFO ] [Nat]Added 296 Read/Feed constraints in 210 ms returned sat
[2022-06-09 03:23:15] [INFO ] Deduced a trap composed of 14 places in 453 ms of which 0 ms to minimize.
[2022-06-09 03:23:16] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2022-06-09 03:23:16] [INFO ] Deduced a trap composed of 103 places in 398 ms of which 0 ms to minimize.
[2022-06-09 03:23:17] [INFO ] Deduced a trap composed of 9 places in 421 ms of which 0 ms to minimize.
[2022-06-09 03:23:17] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 1 ms to minimize.
[2022-06-09 03:23:18] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 0 ms to minimize.
[2022-06-09 03:23:18] [INFO ] Deduced a trap composed of 43 places in 309 ms of which 0 ms to minimize.
[2022-06-09 03:23:19] [INFO ] Deduced a trap composed of 23 places in 315 ms of which 1 ms to minimize.
[2022-06-09 03:23:19] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3667 ms
[2022-06-09 03:23:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 238 ms.
[2022-06-09 03:23:23] [INFO ] Added : 140 causal constraints over 28 iterations in 4409 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1272700 steps, including 1000 resets, run finished after 11284 ms. (steps per millisecond=112 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 03:23:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:35] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 03:23:35] [INFO ] Implicit Places using invariants in 396 ms returned []
[2022-06-09 03:23:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:35] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 03:23:35] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:41] [INFO ] Implicit Places using invariants and state equation in 6525 ms returned []
Implicit Place search using SMT with State Equation took 6922 ms to find 0 implicit places.
[2022-06-09 03:23:42] [INFO ] Redundant transitions in 169 ms returned []
[2022-06-09 03:23:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:42] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 03:23:43] [INFO ] Dead Transitions using invariants and state equation in 970 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-02 in 37236 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:43] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10089 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1441 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 03:23:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:43] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 03:23:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:43] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-09 03:23:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:44] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2022-06-09 03:23:44] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:44] [INFO ] [Nat]Added 296 Read/Feed constraints in 204 ms returned sat
[2022-06-09 03:23:44] [INFO ] Deduced a trap composed of 16 places in 477 ms of which 2 ms to minimize.
[2022-06-09 03:23:45] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 0 ms to minimize.
[2022-06-09 03:23:46] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 1 ms to minimize.
[2022-06-09 03:23:46] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 0 ms to minimize.
[2022-06-09 03:23:46] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 0 ms to minimize.
[2022-06-09 03:23:47] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2022-06-09 03:23:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2635 ms
[2022-06-09 03:23:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 233 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2022-06-09 03:23:49] [INFO ] Deduced a trap composed of 7 places in 559 ms of which 1 ms to minimize.
[2022-06-09 03:23:49] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:49] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 1) seen :0
[2022-06-09 03:23:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:23:51] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 03:23:51] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:52] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2022-06-09 03:23:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:23:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:23:52] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2022-06-09 03:23:52] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:23:53] [INFO ] [Nat]Added 296 Read/Feed constraints in 208 ms returned sat
[2022-06-09 03:23:53] [INFO ] Deduced a trap composed of 16 places in 502 ms of which 0 ms to minimize.
[2022-06-09 03:23:54] [INFO ] Deduced a trap composed of 27 places in 434 ms of which 0 ms to minimize.
[2022-06-09 03:23:54] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 0 ms to minimize.
[2022-06-09 03:23:55] [INFO ] Deduced a trap composed of 26 places in 438 ms of which 0 ms to minimize.
[2022-06-09 03:23:55] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2022-06-09 03:23:55] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2022-06-09 03:23:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2836 ms
[2022-06-09 03:23:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 242 ms.
[2022-06-09 03:23:59] [INFO ] Added : 102 causal constraints over 21 iterations in 3463 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1224400 steps, including 1000 resets, run finished after 10955 ms. (steps per millisecond=111 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, 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.
[2022-06-09 03:24:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:10] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 03:24:11] [INFO ] Implicit Places using invariants in 406 ms returned []
[2022-06-09 03:24:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:11] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 03:24:11] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:24:17] [INFO ] Implicit Places using invariants and state equation in 6533 ms returned []
Implicit Place search using SMT with State Equation took 6939 ms to find 0 implicit places.
[2022-06-09 03:24:17] [INFO ] Redundant transitions in 130 ms returned []
[2022-06-09 03:24:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:17] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 03:24:18] [INFO ] Dead Transitions using invariants and state equation in 985 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-04 in 35531 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:18] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 10123 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=920 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 03:24:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:18] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 03:24:18] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:19] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-06-09 03:24:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:19] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2022-06-09 03:24:19] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:24:19] [INFO ] [Nat]Added 296 Read/Feed constraints in 188 ms returned sat
[2022-06-09 03:24:20] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 1 ms to minimize.
[2022-06-09 03:24:20] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 0 ms to minimize.
[2022-06-09 03:24:20] [INFO ] Deduced a trap composed of 60 places in 233 ms of which 0 ms to minimize.
[2022-06-09 03:24:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1013 ms
[2022-06-09 03:24:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 232 ms.
[2022-06-09 03:24:24] [INFO ] Deduced a trap composed of 7 places in 572 ms of which 1 ms to minimize.
[2022-06-09 03:24:24] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:25] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000051 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 03:24:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:27] [INFO ] Computed 8 place invariants in 18 ms
[2022-06-09 03:24:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 03:24:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:27] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2022-06-09 03:24:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:24:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 03:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:24:28] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2022-06-09 03:24:28] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:24:28] [INFO ] [Nat]Added 296 Read/Feed constraints in 222 ms returned sat
[2022-06-09 03:24:29] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 0 ms to minimize.
[2022-06-09 03:24:29] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2022-06-09 03:24:29] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 0 ms to minimize.
[2022-06-09 03:24:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1065 ms
[2022-06-09 03:24:30] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 229 ms.
[2022-06-09 03:24:34] [INFO ] Deduced a trap composed of 35 places in 187 ms of which 0 ms to minimize.
[2022-06-09 03:24:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2022-06-09 03:24:34] [INFO ] Added : 123 causal constraints over 25 iterations in 4670 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1512100 steps, including 1000 resets, run finished after 12052 ms. (steps per millisecond=125 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 03:24:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:46] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 03:24:47] [INFO ] Implicit Places using invariants in 403 ms returned []
[2022-06-09 03:24:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:47] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 03:24:47] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 03:24:53] [INFO ] Implicit Places using invariants and state equation in 6818 ms returned []
Implicit Place search using SMT with State Equation took 7223 ms to find 0 implicit places.
[2022-06-09 03:24:54] [INFO ] Redundant transitions in 133 ms returned []
[2022-06-09 03:24:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 03:24:54] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 03:24:55] [INFO ] Dead Transitions using invariants and state equation in 1012 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-05 in 36467 ms.
[2022-06-09 03:24:55] [INFO ] Flatten gal took : 369 ms
[2022-06-09 03:24:55] [INFO ] Applying decomposition
[2022-06-09 03:24:56] [INFO ] Flatten gal took : 195 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15500853839019903506.txt, -o, /tmp/graph15500853839019903506.bin, -w, /tmp/graph15500853839019903506.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15500853839019903506.bin, -l, -1, -v, -w, /tmp/graph15500853839019903506.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:24:56] [INFO ] Decomposing Gal with order
[2022-06-09 03:24:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:24:57] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 03:24:57] [INFO ] Flatten gal took : 429 ms
[2022-06-09 03:24:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 28 ms.
[2022-06-09 03:24:57] [INFO ] Time to serialize gal into /tmp/UpperBounds5080756203371870156.gal : 74 ms
[2022-06-09 03:24:57] [INFO ] Time to serialize properties into /tmp/UpperBounds4951530662535276828.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5080756203371870156.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4951530662535276828.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5080756203371870156.gal -t CGAL -reachable-file /tmp/UpperBounds4951530662535276828.prop --nowitness
Loading property file /tmp/UpperBounds4951530662535276828.prop.
Detected timeout of ITS tools.
[2022-06-09 03:46:33] [INFO ] Flatten gal took : 876 ms
[2022-06-09 03:46:33] [INFO ] Time to serialize gal into /tmp/UpperBounds13589429057168355462.gal : 161 ms
[2022-06-09 03:46:33] [INFO ] Time to serialize properties into /tmp/UpperBounds14010302268077105766.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds13589429057168355462.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14010302268077105766.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds13589429057168355462.gal -t CGAL -reachable-file /tmp/UpperBounds14010302268077105766.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds14010302268077105766.prop.
Detected timeout of ITS tools.
[2022-06-09 04:08:07] [INFO ] Flatten gal took : 636 ms
[2022-06-09 04:08:12] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 04:08:12] [INFO ] Transformed 269 places.
[2022-06-09 04:08:12] [INFO ] Transformed 3871 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 04:08:12] [INFO ] Time to serialize gal into /tmp/UpperBounds3167677734842897156.gal : 94 ms
[2022-06-09 04:08:12] [INFO ] Time to serialize properties into /tmp/UpperBounds13741538394505289854.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3167677734842897156.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13741538394505289854.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3167677734842897156.gal -t CGAL -reachable-file /tmp/UpperBounds13741538394505289854.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13741538394505289854.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is BugTracking-PT-q8m256, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292600046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m256.tgz
mv BugTracking-PT-q8m256 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;