About the Execution of 2022-gold for BugTracking-PT-q8m256
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.884 | 3600000.00 | 3632552.00 | 57096.00 | 0 0 ? 0 0 0 0 0 ? 0 0 ? ? 0 0 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r063-tajo-167813711600056.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r063-tajo-167813711600056
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.8K Feb 26 06:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 06:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 06:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 06:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 07:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 07:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 06:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-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 1678931135837
Running Version 202205111006
[2023-03-16 01:45:37] [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]
[2023-03-16 01:45:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 01:45:38] [INFO ] Load time of PNML (sax parser for PT used): 750 ms
[2023-03-16 01:45:38] [INFO ] Transformed 754 places.
[2023-03-16 01:45:38] [INFO ] Transformed 27370 transitions.
[2023-03-16 01:45:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions in 951 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 80 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-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-05 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-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:45:38] [INFO ] Computed 10 place invariants in 49 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) 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 5) seen :0
[2023-03-16 01:45:38] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2023-03-16 01:45:38] [INFO ] Computed 10 place invariants in 34 ms
[2023-03-16 01:45:38] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-16 01:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:39] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2023-03-16 01:45:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:45:39] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:40] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2023-03-16 01:45:40] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-16 01:45:40] [INFO ] [Nat]Added 303 Read/Feed constraints in 95 ms returned sat
[2023-03-16 01:45:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 355 ms.
[2023-03-16 01:45:41] [INFO ] Added : 2 causal constraints over 1 iterations in 843 ms. Result :sat
[2023-03-16 01:45:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:45:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:42] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2023-03-16 01:45:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:45:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 01:45:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:43] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2023-03-16 01:45:43] [INFO ] [Nat]Added 303 Read/Feed constraints in 143 ms returned sat
[2023-03-16 01:45:43] [INFO ] Deduced a trap composed of 17 places in 515 ms of which 6 ms to minimize.
[2023-03-16 01:45:44] [INFO ] Deduced a trap composed of 61 places in 522 ms of which 1 ms to minimize.
[2023-03-16 01:45:45] [INFO ] Deduced a trap composed of 22 places in 467 ms of which 1 ms to minimize.
[2023-03-16 01:45:45] [INFO ] Deduced a trap composed of 62 places in 456 ms of which 2 ms to minimize.
[2023-03-16 01:45:46] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 1 ms to minimize.
[2023-03-16 01:45:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3084 ms
[2023-03-16 01:45:46] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 373 ms.
[2023-03-16 01:45:47] [INFO ] Added : 4 causal constraints over 1 iterations in 768 ms. Result :sat
[2023-03-16 01:45:47] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-16 01:45:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:47] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2023-03-16 01:45:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:45:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 01:45:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:48] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2023-03-16 01:45:48] [INFO ] [Nat]Added 303 Read/Feed constraints in 206 ms returned sat
[2023-03-16 01:45:49] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 0 ms to minimize.
[2023-03-16 01:45:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 578 ms
[2023-03-16 01:45:49] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 309 ms.
[2023-03-16 01:45:50] [INFO ] Added : 7 causal constraints over 2 iterations in 939 ms. Result :sat
[2023-03-16 01:45:50] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-16 01:45:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:51] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-16 01:45:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:45:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:45:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:51] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2023-03-16 01:45:52] [INFO ] [Nat]Added 303 Read/Feed constraints in 152 ms returned sat
[2023-03-16 01:45:52] [INFO ] Deduced a trap composed of 59 places in 548 ms of which 1 ms to minimize.
[2023-03-16 01:45:53] [INFO ] Deduced a trap composed of 107 places in 652 ms of which 3 ms to minimize.
[2023-03-16 01:45:54] [INFO ] Deduced a trap composed of 52 places in 628 ms of which 1 ms to minimize.
[2023-03-16 01:45:54] [INFO ] Deduced a trap composed of 14 places in 563 ms of which 0 ms to minimize.
[2023-03-16 01:45:55] [INFO ] Deduced a trap composed of 19 places in 545 ms of which 1 ms to minimize.
[2023-03-16 01:45:56] [INFO ] Deduced a trap composed of 59 places in 565 ms of which 1 ms to minimize.
[2023-03-16 01:45:56] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 01:45:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-16 01:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:56] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-16 01:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:45:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-16 01:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:45:57] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-16 01:45:57] [INFO ] [Nat]Added 303 Read/Feed constraints in 139 ms returned sat
[2023-03-16 01:45:58] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 0 ms to minimize.
[2023-03-16 01:45:58] [INFO ] Deduced a trap composed of 38 places in 385 ms of which 0 ms to minimize.
[2023-03-16 01:45:59] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 0 ms to minimize.
[2023-03-16 01:45:59] [INFO ] Deduced a trap composed of 14 places in 373 ms of which 1 ms to minimize.
[2023-03-16 01:46:00] [INFO ] Deduced a trap composed of 59 places in 388 ms of which 1 ms to minimize.
[2023-03-16 01:46:00] [INFO ] Deduced a trap composed of 60 places in 374 ms of which 1 ms to minimize.
[2023-03-16 01:46:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3130 ms
[2023-03-16 01:46:01] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 342 ms.
[2023-03-16 01:46:02] [INFO ] Deduced a trap composed of 15 places in 763 ms of which 1 ms to minimize.
[2023-03-16 01:46:02] [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 4
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.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 313 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
[2023-03-16 01:46:04] [INFO ] Computed 8 place invariants in 29 ms
Incomplete random walk after 1000102 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1796 ms. (steps per millisecond=556 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2082 ms. (steps per millisecond=480 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1624 ms. (steps per millisecond=615 ) properties (out of 5) 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 5) seen :0
[2023-03-16 01:46:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:13] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-16 01:46:13] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:14] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2023-03-16 01:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:15] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2023-03-16 01:46:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 34 ms returned sat
[2023-03-16 01:46:15] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 269 ms.
[2023-03-16 01:46:15] [INFO ] Added : 2 causal constraints over 1 iterations in 692 ms. Result :sat
[2023-03-16 01:46:16] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-16 01:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:16] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-16 01:46:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:46:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:17] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-16 01:46:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 71 ms returned sat
[2023-03-16 01:46:17] [INFO ] Deduced a trap composed of 54 places in 421 ms of which 1 ms to minimize.
[2023-03-16 01:46:18] [INFO ] Deduced a trap composed of 88 places in 397 ms of which 0 ms to minimize.
[2023-03-16 01:46:19] [INFO ] Deduced a trap composed of 89 places in 395 ms of which 1 ms to minimize.
[2023-03-16 01:46:19] [INFO ] Deduced a trap composed of 49 places in 402 ms of which 0 ms to minimize.
[2023-03-16 01:46:20] [INFO ] Deduced a trap composed of 81 places in 433 ms of which 0 ms to minimize.
[2023-03-16 01:46:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3132 ms
[2023-03-16 01:46:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 263 ms.
[2023-03-16 01:46:21] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 2 ms to minimize.
[2023-03-16 01:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 674 ms
[2023-03-16 01:46:22] [INFO ] Added : 4 causal constraints over 1 iterations in 1515 ms. Result :sat
[2023-03-16 01:46:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:22] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-16 01:46:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:23] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-16 01:46:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 161 ms returned sat
[2023-03-16 01:46:24] [INFO ] Deduced a trap composed of 36 places in 490 ms of which 1 ms to minimize.
[2023-03-16 01:46:24] [INFO ] Deduced a trap composed of 23 places in 418 ms of which 0 ms to minimize.
[2023-03-16 01:46:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1185 ms
[2023-03-16 01:46:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 282 ms.
[2023-03-16 01:46:25] [INFO ] Added : 2 causal constraints over 1 iterations in 696 ms. Result :sat
[2023-03-16 01:46:25] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-16 01:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:26] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-16 01:46:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:27] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-16 01:46:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 215 ms returned sat
[2023-03-16 01:46:27] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 0 ms to minimize.
[2023-03-16 01:46:28] [INFO ] Deduced a trap composed of 53 places in 348 ms of which 1 ms to minimize.
[2023-03-16 01:46:28] [INFO ] Deduced a trap composed of 56 places in 349 ms of which 1 ms to minimize.
[2023-03-16 01:46:29] [INFO ] Deduced a trap composed of 10 places in 347 ms of which 1 ms to minimize.
[2023-03-16 01:46:29] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 5 ms to minimize.
[2023-03-16 01:46:30] [INFO ] Deduced a trap composed of 60 places in 381 ms of which 0 ms to minimize.
[2023-03-16 01:46:30] [INFO ] Deduced a trap composed of 29 places in 379 ms of which 0 ms to minimize.
[2023-03-16 01:46:31] [INFO ] Deduced a trap composed of 61 places in 365 ms of which 5 ms to minimize.
[2023-03-16 01:46:31] [INFO ] Deduced a trap composed of 57 places in 354 ms of which 0 ms to minimize.
[2023-03-16 01:46:32] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2023-03-16 01:46:32] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4959 ms
[2023-03-16 01:46:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 257 ms.
[2023-03-16 01:46:33] [INFO ] Added : 6 causal constraints over 2 iterations in 824 ms. Result :sat
[2023-03-16 01:46:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:33] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-16 01:46:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:34] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-03-16 01:46:34] [INFO ] [Nat]Added 283 Read/Feed constraints in 194 ms returned sat
[2023-03-16 01:46:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 293 ms.
[2023-03-16 01:46:35] [INFO ] Added : 5 causal constraints over 1 iterations in 768 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1, 1, -1, -1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:46:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:36] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-16 01:46:36] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-16 01:46:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:36] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-16 01:46:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:38] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2023-03-16 01:46:39] [INFO ] Redundant transitions in 384 ms returned []
[2023-03-16 01:46:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:39] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-16 01:46:40] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
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
[2023-03-16 01:46:40] [INFO ] Computed 8 place invariants in 9 ms
Incomplete random walk after 10107 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-16 01:46:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:40] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-16 01:46:40] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-16 01:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:40] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-16 01:46:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:41] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2023-03-16 01:46:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 43 ms returned sat
[2023-03-16 01:46:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 266 ms.
[2023-03-16 01:46:42] [INFO ] Added : 2 causal constraints over 1 iterations in 669 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 66 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
[2023-03-16 01:46:42] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000156 steps, including 2 resets, run finished after 525 ms. (steps per millisecond=1905 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
[2023-03-16 01:46:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:44] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-16 01:46:44] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:45] [INFO ] [Real]Absence check using state equation in 561 ms returned sat
[2023-03-16 01:46:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:46] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2023-03-16 01:46:46] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:46] [INFO ] [Nat]Added 283 Read/Feed constraints in 45 ms returned sat
[2023-03-16 01:46:46] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 278 ms.
[2023-03-16 01:46:46] [INFO ] Added : 2 causal constraints over 1 iterations in 707 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 110 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:46:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:47] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:46:47] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-16 01:46:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:47] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:46:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:49] [INFO ] Implicit Places using invariants and state equation in 1915 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
[2023-03-16 01:46:49] [INFO ] Redundant transitions in 300 ms returned []
[2023-03-16 01:46:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:49] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:46:50] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-02 in 10582 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:50] [INFO ] Computed 8 place invariants in 8 ms
Incomplete random walk after 10094 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2018 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
[2023-03-16 01:46:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:50] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-16 01:46:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:51] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-03-16 01:46:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:51] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2023-03-16 01:46:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:46:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 66 ms returned sat
[2023-03-16 01:46:52] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 0 ms to minimize.
[2023-03-16 01:46:52] [INFO ] Deduced a trap composed of 88 places in 480 ms of which 1 ms to minimize.
[2023-03-16 01:46:53] [INFO ] Deduced a trap composed of 89 places in 363 ms of which 1 ms to minimize.
[2023-03-16 01:46:54] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-16 01:46:54] [INFO ] Deduced a trap composed of 81 places in 385 ms of which 1 ms to minimize.
[2023-03-16 01:46:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2959 ms
[2023-03-16 01:46:55] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 271 ms.
[2023-03-16 01:46:56] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 1 ms to minimize.
[2023-03-16 01:46:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 685 ms
[2023-03-16 01:46:56] [INFO ] Added : 4 causal constraints over 1 iterations in 1527 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 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
[2023-03-16 01:46:56] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000017 steps, including 2 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
[2023-03-16 01:46:58] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:46:58] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:46:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:46:59] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2023-03-16 01:46:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:46:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:00] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2023-03-16 01:47:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:00] [INFO ] [Nat]Added 283 Read/Feed constraints in 99 ms returned sat
[2023-03-16 01:47:00] [INFO ] Deduced a trap composed of 54 places in 452 ms of which 0 ms to minimize.
[2023-03-16 01:47:01] [INFO ] Deduced a trap composed of 88 places in 472 ms of which 1 ms to minimize.
[2023-03-16 01:47:02] [INFO ] Deduced a trap composed of 89 places in 404 ms of which 1 ms to minimize.
[2023-03-16 01:47:02] [INFO ] Deduced a trap composed of 49 places in 385 ms of which 1 ms to minimize.
[2023-03-16 01:47:03] [INFO ] Deduced a trap composed of 81 places in 404 ms of which 1 ms to minimize.
[2023-03-16 01:47:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3323 ms
[2023-03-16 01:47:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 267 ms.
[2023-03-16 01:47:04] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 1 ms to minimize.
[2023-03-16 01:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 660 ms
[2023-03-16 01:47:05] [INFO ] Added : 4 causal constraints over 1 iterations in 1525 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 81 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 in SAFETY mode, 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.
[2023-03-16 01:47:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:05] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-16 01:47:05] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-16 01:47:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:05] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:47:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:06] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2023-03-16 01:47:07] [INFO ] Redundant transitions in 136 ms returned []
[2023-03-16 01:47:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:07] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:47:08] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-08 in 17269 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-11
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:08] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10110 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2527 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-16 01:47:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:08] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-16 01:47:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:08] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2023-03-16 01:47:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:09] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2023-03-16 01:47:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 157 ms returned sat
[2023-03-16 01:47:09] [INFO ] Deduced a trap composed of 36 places in 391 ms of which 0 ms to minimize.
[2023-03-16 01:47:10] [INFO ] Deduced a trap composed of 23 places in 345 ms of which 2 ms to minimize.
[2023-03-16 01:47:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 974 ms
[2023-03-16 01:47:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 272 ms.
[2023-03-16 01:47:11] [INFO ] Added : 2 causal constraints over 1 iterations in 676 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
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
[2023-03-16 01:47:11] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 583 ms. (steps per millisecond=1715 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1781 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
[2023-03-16 01:47:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:13] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-16 01:47:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:14] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-16 01:47:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:14] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2023-03-16 01:47:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 113 ms returned sat
[2023-03-16 01:47:15] [INFO ] Deduced a trap composed of 36 places in 433 ms of which 0 ms to minimize.
[2023-03-16 01:47:15] [INFO ] Deduced a trap composed of 23 places in 310 ms of which 1 ms to minimize.
[2023-03-16 01:47:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 950 ms
[2023-03-16 01:47:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 228 ms.
[2023-03-16 01:47:16] [INFO ] Added : 2 causal constraints over 1 iterations in 633 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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.
Starting structural reductions in SAFETY mode, 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.
[2023-03-16 01:47:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:16] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-16 01:47:17] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-16 01:47:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:17] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:47:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:19] [INFO ] Implicit Places using invariants and state equation in 1715 ms returned []
Implicit Place search using SMT with State Equation took 2116 ms to find 0 implicit places.
[2023-03-16 01:47:19] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-16 01:47:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:19] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:47:20] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-11 in 12045 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:20] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10130 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2532 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-16 01:47:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:20] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-16 01:47:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-16 01:47:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:20] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-16 01:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:47:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:21] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2023-03-16 01:47:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 155 ms returned sat
[2023-03-16 01:47:21] [INFO ] Deduced a trap composed of 52 places in 345 ms of which 1 ms to minimize.
[2023-03-16 01:47:22] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 0 ms to minimize.
[2023-03-16 01:47:22] [INFO ] Deduced a trap composed of 56 places in 346 ms of which 2 ms to minimize.
[2023-03-16 01:47:23] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2023-03-16 01:47:23] [INFO ] Deduced a trap composed of 31 places in 337 ms of which 0 ms to minimize.
[2023-03-16 01:47:24] [INFO ] Deduced a trap composed of 60 places in 328 ms of which 0 ms to minimize.
[2023-03-16 01:47:24] [INFO ] Deduced a trap composed of 29 places in 321 ms of which 0 ms to minimize.
[2023-03-16 01:47:25] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 0 ms to minimize.
[2023-03-16 01:47:25] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 0 ms to minimize.
[2023-03-16 01:47:25] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 0 ms to minimize.
[2023-03-16 01:47:25] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:26] [INFO ] Computed 8 place invariants in 20 ms
Incomplete random walk after 1000233 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2027 ms. (steps per millisecond=493 ) properties (out of 1) seen :0
[2023-03-16 01:47:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:28] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:47:28] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:29] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2023-03-16 01:47:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:29] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:29] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2023-03-16 01:47:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 217 ms returned sat
[2023-03-16 01:47:30] [INFO ] Deduced a trap composed of 52 places in 362 ms of which 0 ms to minimize.
[2023-03-16 01:47:31] [INFO ] Deduced a trap composed of 53 places in 355 ms of which 1 ms to minimize.
[2023-03-16 01:47:31] [INFO ] Deduced a trap composed of 56 places in 336 ms of which 2 ms to minimize.
[2023-03-16 01:47:32] [INFO ] Deduced a trap composed of 10 places in 367 ms of which 3 ms to minimize.
[2023-03-16 01:47:32] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 12 ms to minimize.
[2023-03-16 01:47:33] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 2 ms to minimize.
[2023-03-16 01:47:33] [INFO ] Deduced a trap composed of 29 places in 343 ms of which 0 ms to minimize.
[2023-03-16 01:47:33] [INFO ] Deduced a trap composed of 61 places in 339 ms of which 0 ms to minimize.
[2023-03-16 01:47:34] [INFO ] Deduced a trap composed of 57 places in 323 ms of which 1 ms to minimize.
[2023-03-16 01:47:34] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 0 ms to minimize.
[2023-03-16 01:47:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4720 ms
[2023-03-16 01:47:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 253 ms.
[2023-03-16 01:47:35] [INFO ] Added : 6 causal constraints over 2 iterations in 801 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 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 in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:47:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:36] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:47:36] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-16 01:47:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:36] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:47:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:38] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-03-16 01:47:38] [INFO ] Redundant transitions in 182 ms returned []
[2023-03-16 01:47:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:38] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:47:39] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-12 in 19280 ms.
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-15
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:39] [INFO ] Computed 8 place invariants in 7 ms
Incomplete random walk after 10140 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2028 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-03-16 01:47:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:39] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:47:39] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-16 01:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:39] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2023-03-16 01:47:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:40] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-16 01:47:40] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 189 ms returned sat
[2023-03-16 01:47:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2023-03-16 01:47:41] [INFO ] Added : 5 causal constraints over 1 iterations in 726 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 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
[2023-03-16 01:47:41] [INFO ] Computed 8 place invariants in 18 ms
Incomplete random walk after 1000172 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=1754 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1663 ms. (steps per millisecond=601 ) properties (out of 1) seen :0
[2023-03-16 01:47:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:44] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-16 01:47:44] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-16 01:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:44] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2023-03-16 01:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 01:47:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-16 01:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 01:47:45] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2023-03-16 01:47:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 133 ms returned sat
[2023-03-16 01:47:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2023-03-16 01:47:46] [INFO ] Added : 5 causal constraints over 1 iterations in 736 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 99 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 in SAFETY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-16 01:47:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:46] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:47:46] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-16 01:47:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:46] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-16 01:47:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-16 01:47:48] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
[2023-03-16 01:47:48] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-16 01:47:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-16 01:47:48] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-16 01:47:49] [INFO ] Dead Transitions using invariants and state equation in 1051 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-15 in 10469 ms.
[2023-03-16 01:47:50] [INFO ] Flatten gal took : 302 ms
[2023-03-16 01:47:50] [INFO ] Applying decomposition
[2023-03-16 01:47:50] [INFO ] Flatten gal took : 174 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2889460294708085874.txt' '-o' '/tmp/graph2889460294708085874.bin' '-w' '/tmp/graph2889460294708085874.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2889460294708085874.bin' '-l' '-1' '-v' '-w' '/tmp/graph2889460294708085874.weights' '-q' '0' '-e' '0.001'
[2023-03-16 01:47:51] [INFO ] Decomposing Gal with order
[2023-03-16 01:47:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-16 01:47:51] [INFO ] Removed a total of 424 redundant transitions.
[2023-03-16 01:47:51] [INFO ] Flatten gal took : 427 ms
[2023-03-16 01:47:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 23 ms.
[2023-03-16 01:47:51] [INFO ] Time to serialize gal into /tmp/UpperBounds10014788468430996603.gal : 27 ms
[2023-03-16 01:47:51] [INFO ] Time to serialize properties into /tmp/UpperBounds11467286496786501900.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds10014788468430996603.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11467286496786501900.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...276
Loading property file /tmp/UpperBounds11467286496786501900.prop.
Detected timeout of ITS tools.
[2023-03-16 02:08:39] [INFO ] Flatten gal took : 1051 ms
[2023-03-16 02:08:39] [INFO ] Time to serialize gal into /tmp/UpperBounds3831723442913291000.gal : 125 ms
[2023-03-16 02:08:39] [INFO ] Time to serialize properties into /tmp/UpperBounds2873941249409407183.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3831723442913291000.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2873941249409407183.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds2873941249409407183.prop.
Detected timeout of ITS tools.
[2023-03-16 02:29:26] [INFO ] Flatten gal took : 1085 ms
[2023-03-16 02:29:29] [INFO ] Input system was already deterministic with 3871 transitions.
[2023-03-16 02:29:29] [INFO ] Transformed 269 places.
[2023-03-16 02:29:29] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 02:29:29] [INFO ] Time to serialize gal into /tmp/UpperBounds9403188678497218499.gal : 21 ms
[2023-03-16 02:29:29] [INFO ] Time to serialize properties into /tmp/UpperBounds869472243958813316.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9403188678497218499.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds869472243958813316.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...339
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds869472243958813316.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
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 r063-tajo-167813711600056"
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 '
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 ;