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-165472292600031.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-q8m008, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292600031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 7 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 7 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 18K Jun 7 17:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 7 17:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Jun 7 17:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q8m008-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m008-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654737541356

Running Version 0
[2022-06-09 01:19:02] [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 01:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 01:19:03] [INFO ] Load time of PNML (sax parser for PT used): 896 ms
[2022-06-09 01:19:03] [INFO ] Transformed 754 places.
[2022-06-09 01:19:03] [INFO ] Transformed 27370 transitions.
[2022-06-09 01:19:03] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 1053 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 474 places in 164 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:19:04] [INFO ] Computed 10 place invariants in 66 ms
Incomplete random walk after 10004 steps, including 55 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
[2022-06-09 01:19:04] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2022-06-09 01:19:04] [INFO ] Computed 10 place invariants in 26 ms
[2022-06-09 01:19:04] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2022-06-09 01:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:05] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2022-06-09 01:19:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:06] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-06-09 01:19:06] [INFO ] State equation strengthened by 316 read => feed constraints.
[2022-06-09 01:19:06] [INFO ] [Nat]Added 316 Read/Feed constraints in 199 ms returned sat
[2022-06-09 01:19:06] [INFO ] Deduced a trap composed of 34 places in 403 ms of which 4 ms to minimize.
[2022-06-09 01:19:07] [INFO ] Deduced a trap composed of 44 places in 385 ms of which 3 ms to minimize.
[2022-06-09 01:19:07] [INFO ] Deduced a trap composed of 29 places in 332 ms of which 1 ms to minimize.
[2022-06-09 01:19:08] [INFO ] Deduced a trap composed of 24 places in 385 ms of which 1 ms to minimize.
[2022-06-09 01:19:08] [INFO ] Deduced a trap composed of 17 places in 361 ms of which 0 ms to minimize.
[2022-06-09 01:19:08] [INFO ] Deduced a trap composed of 19 places in 209 ms of which 1 ms to minimize.
[2022-06-09 01:19:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2788 ms
[2022-06-09 01:19:09] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 299 ms.
[2022-06-09 01:19:10] [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: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 01:19:10] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:11] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2022-06-09 01:19:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:11] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2022-06-09 01:19:11] [INFO ] [Nat]Added 316 Read/Feed constraints in 192 ms returned sat
[2022-06-09 01:19:12] [INFO ] Deduced a trap composed of 55 places in 388 ms of which 0 ms to minimize.
[2022-06-09 01:19:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2022-06-09 01:19:12] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 465 ms.
[2022-06-09 01:19:16] [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 01:19:16] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:16] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2022-06-09 01:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:17] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:19:17] [INFO ] [Nat]Added 316 Read/Feed constraints in 189 ms returned sat
[2022-06-09 01:19:17] [INFO ] Deduced a trap composed of 67 places in 459 ms of which 1 ms to minimize.
[2022-06-09 01:19:18] [INFO ] Deduced a trap composed of 68 places in 511 ms of which 2 ms to minimize.
[2022-06-09 01:19:19] [INFO ] Deduced a trap composed of 24 places in 488 ms of which 0 ms to minimize.
[2022-06-09 01:19:19] [INFO ] Deduced a trap composed of 12 places in 487 ms of which 1 ms to minimize.
[2022-06-09 01:19:20] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 1 ms to minimize.
[2022-06-09 01:19:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2793 ms
[2022-06-09 01:19:20] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 241 ms.
[2022-06-09 01:19:21] [INFO ] Added : 45 causal constraints over 9 iterations in 1532 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, -1, -1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 2001500 steps, including 1003 resets, run finished after 9165 ms. (steps per millisecond=218 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 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.15 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 6 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 407 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 01:19:31] [INFO ] Computed 8 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4013 ms. (steps per millisecond=249 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2020 ms. (steps per millisecond=495 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1996 ms. (steps per millisecond=501 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1955 ms. (steps per millisecond=511 ) properties (out of 3) seen :0
[2022-06-09 01:19:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:19:41] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:19:41] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:42] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2022-06-09 01:19:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:42] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-06-09 01:19:42] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:19:42] [INFO ] [Nat]Added 296 Read/Feed constraints in 213 ms returned sat
[2022-06-09 01:19:43] [INFO ] Deduced a trap composed of 5 places in 434 ms of which 0 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 53 places in 448 ms of which 0 ms to minimize.
[2022-06-09 01:19:44] [INFO ] Deduced a trap composed of 53 places in 431 ms of which 0 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 52 places in 445 ms of which 0 ms to minimize.
[2022-06-09 01:19:45] [INFO ] Deduced a trap composed of 30 places in 411 ms of which 0 ms to minimize.
[2022-06-09 01:19:46] [INFO ] Deduced a trap composed of 10 places in 459 ms of which 1 ms to minimize.
[2022-06-09 01:19:46] [INFO ] Deduced a trap composed of 51 places in 465 ms of which 1 ms to minimize.
[2022-06-09 01:19:47] [INFO ] Deduced a trap composed of 52 places in 455 ms of which 1 ms to minimize.
[2022-06-09 01:19:47] [INFO ] Deduced a trap composed of 52 places in 444 ms of which 0 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 9 places in 436 ms of which 1 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 0 ms to minimize.
[2022-06-09 01:19:48] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 1 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 58 places in 262 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Deduced a trap composed of 58 places in 253 ms of which 0 ms to minimize.
[2022-06-09 01:19:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6749 ms
[2022-06-09 01:19:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 229 ms.
[2022-06-09 01:19:53] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 1 ms to minimize.
[2022-06-09 01:19:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 460 ms
[2022-06-09 01:19:54] [INFO ] Added : 107 causal constraints over 23 iterations in 4356 ms. Result :sat
[2022-06-09 01:19:54] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:54] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-06-09 01:19:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:19:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:19:55] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:19:55] [INFO ] [Nat]Added 296 Read/Feed constraints in 214 ms returned sat
[2022-06-09 01:19:55] [INFO ] Deduced a trap composed of 90 places in 357 ms of which 0 ms to minimize.
[2022-06-09 01:19:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2022-06-09 01:19:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 278 ms.
[2022-06-09 01:19:58] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 0 ms to minimize.
[2022-06-09 01:19:59] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 0 ms to minimize.
[2022-06-09 01:19:59] [INFO ] Deduced a trap composed of 83 places in 313 ms of which 1 ms to minimize.
[2022-06-09 01:20:00] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 0 ms to minimize.
[2022-06-09 01:20:00] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 1 ms to minimize.
[2022-06-09 01:20:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2346 ms
[2022-06-09 01:20:01] [INFO ] Deduced a trap composed of 58 places in 356 ms of which 1 ms to minimize.
[2022-06-09 01:20:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2022-06-09 01:20:01] [INFO ] Added : 64 causal constraints over 14 iterations in 5892 ms. Result :sat
[2022-06-09 01:20:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:02] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2022-06-09 01:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:20:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:03] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2022-06-09 01:20:03] [INFO ] [Nat]Added 296 Read/Feed constraints in 209 ms returned sat
[2022-06-09 01:20:03] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 8 ms to minimize.
[2022-06-09 01:20:03] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2022-06-09 01:20:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2022-06-09 01:20:04] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 246 ms.
[2022-06-09 01:20:07] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 0 ms to minimize.
[2022-06-09 01:20:07] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 0 ms to minimize.
[2022-06-09 01:20:07] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 1 ms to minimize.
[2022-06-09 01:20:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1356 ms
[2022-06-09 01:20:08] [INFO ] Added : 70 causal constraints over 15 iterations in 4187 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, -1, -1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 1100800 steps, including 1000 resets, run finished after 10220 ms. (steps per millisecond=107 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 880400 steps, including 1000 resets, run finished after 8081 ms. (steps per millisecond=108 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1280600 steps, including 1000 resets, run finished after 11492 ms. (steps per millisecond=111 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 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 92 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 87 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:20:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:38] [INFO ] Computed 8 place invariants in 11 ms
[2022-06-09 01:20:38] [INFO ] Implicit Places using invariants in 532 ms returned []
[2022-06-09 01:20:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:38] [INFO ] Computed 8 place invariants in 28 ms
[2022-06-09 01:20:39] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:20:45] [INFO ] Implicit Places using invariants and state equation in 7132 ms returned []
Implicit Place search using SMT with State Equation took 7666 ms to find 0 implicit places.
[2022-06-09 01:20:46] [INFO ] Redundant transitions in 307 ms returned []
[2022-06-09 01:20:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:46] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:20:47] [INFO ] Dead Transitions using invariants and state equation in 1076 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:47] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) 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 01:20:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:20:47] [INFO ] Computed 8 place invariants in 10 ms
[2022-06-09 01:20:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:20:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:48] [INFO ] [Real]Absence check using state equation in 505 ms returned sat
[2022-06-09 01:20:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:20:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:20:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:20:48] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2022-06-09 01:20:48] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:20:48] [INFO ] [Nat]Added 296 Read/Feed constraints in 217 ms returned sat
[2022-06-09 01:20:49] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 0 ms to minimize.
[2022-06-09 01:20:49] [INFO ] Deduced a trap composed of 53 places in 426 ms of which 0 ms to minimize.
[2022-06-09 01:20:50] [INFO ] Deduced a trap composed of 53 places in 412 ms of which 0 ms to minimize.
[2022-06-09 01:20:50] [INFO ] Deduced a trap composed of 52 places in 400 ms of which 0 ms to minimize.
[2022-06-09 01:20:51] [INFO ] Deduced a trap composed of 30 places in 413 ms of which 0 ms to minimize.
[2022-06-09 01:20:51] [INFO ] Deduced a trap composed of 10 places in 501 ms of which 0 ms to minimize.
[2022-06-09 01:20:52] [INFO ] Deduced a trap composed of 51 places in 468 ms of which 1 ms to minimize.
[2022-06-09 01:20:53] [INFO ] Deduced a trap composed of 52 places in 460 ms of which 0 ms to minimize.
[2022-06-09 01:20:53] [INFO ] Deduced a trap composed of 7 places in 536 ms of which 0 ms to minimize.
[2022-06-09 01:20:53] [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 84 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 01:20:53] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 4417 ms. (steps per millisecond=226 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2066 ms. (steps per millisecond=484 ) properties (out of 1) seen :0
[2022-06-09 01:21:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:00] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:21:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:00] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-06-09 01:21:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:01] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2022-06-09 01:21:01] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:21:01] [INFO ] [Nat]Added 296 Read/Feed constraints in 224 ms returned sat
[2022-06-09 01:21:02] [INFO ] Deduced a trap composed of 5 places in 473 ms of which 1 ms to minimize.
[2022-06-09 01:21:02] [INFO ] Deduced a trap composed of 53 places in 466 ms of which 1 ms to minimize.
[2022-06-09 01:21:03] [INFO ] Deduced a trap composed of 53 places in 460 ms of which 0 ms to minimize.
[2022-06-09 01:21:03] [INFO ] Deduced a trap composed of 52 places in 471 ms of which 1 ms to minimize.
[2022-06-09 01:21:04] [INFO ] Deduced a trap composed of 30 places in 404 ms of which 0 ms to minimize.
[2022-06-09 01:21:04] [INFO ] Deduced a trap composed of 10 places in 471 ms of which 1 ms to minimize.
[2022-06-09 01:21:05] [INFO ] Deduced a trap composed of 51 places in 474 ms of which 1 ms to minimize.
[2022-06-09 01:21:06] [INFO ] Deduced a trap composed of 52 places in 475 ms of which 0 ms to minimize.
[2022-06-09 01:21:06] [INFO ] Deduced a trap composed of 52 places in 422 ms of which 0 ms to minimize.
[2022-06-09 01:21:07] [INFO ] Deduced a trap composed of 9 places in 425 ms of which 0 ms to minimize.
[2022-06-09 01:21:07] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 1 ms to minimize.
[2022-06-09 01:21:07] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2022-06-09 01:21:08] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 0 ms to minimize.
[2022-06-09 01:21:08] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 1 ms to minimize.
[2022-06-09 01:21:08] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6938 ms
[2022-06-09 01:21:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 209 ms.
[2022-06-09 01:21:12] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 0 ms to minimize.
[2022-06-09 01:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2022-06-09 01:21:12] [INFO ] Added : 107 causal constraints over 23 iterations in 4211 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 1280600 steps, including 1001 resets, run finished after 10563 ms. (steps per millisecond=121 ) 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 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:21:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:23] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:21:23] [INFO ] Implicit Places using invariants in 397 ms returned []
[2022-06-09 01:21:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:23] [INFO ] Computed 8 place invariants in 14 ms
[2022-06-09 01:21:24] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:21:31] [INFO ] Implicit Places using invariants and state equation in 7399 ms returned []
Implicit Place search using SMT with State Equation took 7798 ms to find 0 implicit places.
[2022-06-09 01:21:31] [INFO ] Redundant transitions in 248 ms returned []
[2022-06-09 01:21:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:31] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:21:32] [INFO ] Dead Transitions using invariants and state equation in 1073 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-01 in 45323 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:32] [INFO ] Computed 8 place invariants in 10 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2022-06-09 01:21:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:32] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:21:32] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:33] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2022-06-09 01:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:33] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-06-09 01:21:33] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:21:34] [INFO ] [Nat]Added 296 Read/Feed constraints in 223 ms returned sat
[2022-06-09 01:21:34] [INFO ] Deduced a trap composed of 90 places in 371 ms of which 0 ms to minimize.
[2022-06-09 01:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 539 ms
[2022-06-09 01:21:34] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 286 ms.
[2022-06-09 01:21:37] [INFO ] Deduced a trap composed of 17 places in 359 ms of which 0 ms to minimize.
[2022-06-09 01:21:38] [INFO ] Deduced a trap composed of 13 places in 348 ms of which 1 ms to minimize.
[2022-06-09 01:21:38] [INFO ] Deduced a trap composed of 83 places in 356 ms of which 5 ms to minimize.
[2022-06-09 01:21:38] [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 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.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:38] [INFO ] Computed 8 place invariants in 17 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 4284 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2135 ms. (steps per millisecond=468 ) properties (out of 1) seen :0
[2022-06-09 01:21:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:21:45] [INFO ] Computed 8 place invariants in 13 ms
[2022-06-09 01:21:45] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:45] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2022-06-09 01:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:21:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:21:46] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2022-06-09 01:21:46] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:21:46] [INFO ] [Nat]Added 296 Read/Feed constraints in 218 ms returned sat
[2022-06-09 01:21:46] [INFO ] Deduced a trap composed of 90 places in 362 ms of which 2 ms to minimize.
[2022-06-09 01:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 524 ms
[2022-06-09 01:21:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 207 ms.
[2022-06-09 01:21:49] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 1 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 0 ms to minimize.
[2022-06-09 01:21:50] [INFO ] Deduced a trap composed of 83 places in 364 ms of which 0 ms to minimize.
[2022-06-09 01:21:51] [INFO ] Deduced a trap composed of 60 places in 380 ms of which 0 ms to minimize.
[2022-06-09 01:21:51] [INFO ] Deduced a trap composed of 58 places in 361 ms of which 1 ms to minimize.
[2022-06-09 01:21:51] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2567 ms
[2022-06-09 01:21:52] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 1 ms to minimize.
[2022-06-09 01:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2022-06-09 01:21:52] [INFO ] Added : 64 causal constraints over 14 iterations in 5868 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 880400 steps, including 1000 resets, run finished after 7338 ms. (steps per millisecond=119 ) 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 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:22:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:00] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:22:00] [INFO ] Implicit Places using invariants in 408 ms returned []
[2022-06-09 01:22:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:00] [INFO ] Computed 8 place invariants in 12 ms
[2022-06-09 01:22:01] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:08] [INFO ] Implicit Places using invariants and state equation in 7245 ms returned []
Implicit Place search using SMT with State Equation took 7655 ms to find 0 implicit places.
[2022-06-09 01:22:08] [INFO ] Redundant transitions in 125 ms returned []
[2022-06-09 01:22:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:08] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:22:09] [INFO ] Dead Transitions using invariants and state equation in 1123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-02 in 36616 ms.
Starting property specific reduction for BugTracking-PT-q8m008-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:09] [INFO ] Computed 8 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2022-06-09 01:22:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:09] [INFO ] Computed 8 place invariants in 9 ms
[2022-06-09 01:22:09] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:09] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2022-06-09 01:22:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:10] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2022-06-09 01:22:10] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:10] [INFO ] [Nat]Added 296 Read/Feed constraints in 204 ms returned sat
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 1 ms to minimize.
[2022-06-09 01:22:11] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 0 ms to minimize.
[2022-06-09 01:22:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2022-06-09 01:22:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 225 ms.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 0 ms to minimize.
[2022-06-09 01:22:14] [INFO ] Deduced a trap composed of 16 places in 254 ms of which 0 ms to minimize.
[2022-06-09 01:22:15] [INFO ] Deduced a trap composed of 60 places in 242 ms of which 1 ms to minimize.
[2022-06-09 01:22:15] [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 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.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:15] [INFO ] Computed 8 place invariants in 16 ms
Incomplete random walk after 1000005 steps, including 3 resets, run finished after 4672 ms. (steps per millisecond=214 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 1) seen :0
[2022-06-09 01:22:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:21] [INFO ] Computed 8 place invariants in 16 ms
[2022-06-09 01:22:21] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2022-06-09 01:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:22] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2022-06-09 01:22:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 01:22:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2022-06-09 01:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 01:22:22] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2022-06-09 01:22:22] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:23] [INFO ] [Nat]Added 296 Read/Feed constraints in 208 ms returned sat
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 1 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 0 ms to minimize.
[2022-06-09 01:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 634 ms
[2022-06-09 01:22:24] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 265 ms.
[2022-06-09 01:22:26] [INFO ] Deduced a trap composed of 19 places in 273 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Deduced a trap composed of 60 places in 282 ms of which 0 ms to minimize.
[2022-06-09 01:22:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1285 ms
[2022-06-09 01:22:27] [INFO ] Added : 70 causal constraints over 15 iterations in 4110 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 1100800 steps, including 1000 resets, run finished after 10344 ms. (steps per millisecond=106 ) 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 57 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 50 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2022-06-09 01:22:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:38] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:22:38] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-09 01:22:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:38] [INFO ] Computed 8 place invariants in 17 ms
[2022-06-09 01:22:39] [INFO ] State equation strengthened by 296 read => feed constraints.
[2022-06-09 01:22:45] [INFO ] Implicit Places using invariants and state equation in 6400 ms returned []
Implicit Place search using SMT with State Equation took 6816 ms to find 0 implicit places.
[2022-06-09 01:22:45] [INFO ] Redundant transitions in 126 ms returned []
[2022-06-09 01:22:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2022-06-09 01:22:45] [INFO ] Computed 8 place invariants in 15 ms
[2022-06-09 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 1141 ms returned []
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m008-UpperBounds-11 in 37223 ms.
[2022-06-09 01:22:47] [INFO ] Flatten gal took : 449 ms
[2022-06-09 01:22:47] [INFO ] Applying decomposition
[2022-06-09 01:22:47] [INFO ] Flatten gal took : 219 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/graph14383690485241109293.txt, -o, /tmp/graph14383690485241109293.bin, -w, /tmp/graph14383690485241109293.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/graph14383690485241109293.bin, -l, -1, -v, -w, /tmp/graph14383690485241109293.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 01:22:48] [INFO ] Decomposing Gal with order
[2022-06-09 01:22:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 01:22:48] [INFO ] Removed a total of 424 redundant transitions.
[2022-06-09 01:22:48] [INFO ] Flatten gal took : 491 ms
[2022-06-09 01:22:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 47 ms.
[2022-06-09 01:22:48] [INFO ] Time to serialize gal into /tmp/UpperBounds5042955479919406344.gal : 107 ms
[2022-06-09 01:22:48] [INFO ] Time to serialize properties into /tmp/UpperBounds6651095546851011450.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/UpperBounds5042955479919406344.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6651095546851011450.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/UpperBounds5042955479919406344.gal -t CGAL -reachable-file /tmp/UpperBounds6651095546851011450.prop --nowitness
Loading property file /tmp/UpperBounds6651095546851011450.prop.
Detected timeout of ITS tools.
[2022-06-09 01:44:07] [INFO ] Flatten gal took : 877 ms
[2022-06-09 01:44:07] [INFO ] Time to serialize gal into /tmp/UpperBounds16936989523074260538.gal : 51 ms
[2022-06-09 01:44:07] [INFO ] Time to serialize properties into /tmp/UpperBounds6025225603289838768.prop : 2 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/UpperBounds16936989523074260538.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds6025225603289838768.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/UpperBounds16936989523074260538.gal -t CGAL -reachable-file /tmp/UpperBounds6025225603289838768.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds6025225603289838768.prop.
Detected timeout of ITS tools.
[2022-06-09 02:05:22] [INFO ] Flatten gal took : 669 ms
[2022-06-09 02:05:27] [INFO ] Input system was already deterministic with 3871 transitions.
[2022-06-09 02:05:27] [INFO ] Transformed 269 places.
[2022-06-09 02:05:27] [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 02:05:28] [INFO ] Time to serialize gal into /tmp/UpperBounds14131073878388102544.gal : 35 ms
[2022-06-09 02:05:28] [INFO ] Time to serialize properties into /tmp/UpperBounds16385400460644066164.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/UpperBounds14131073878388102544.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16385400460644066164.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/UpperBounds14131073878388102544.gal -t CGAL -reachable-file /tmp/UpperBounds16385400460644066164.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/UpperBounds16385400460644066164.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-q8m008"
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-q8m008, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r323-tall-165472292600031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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