About the Execution of 2023-gold for BugTracking-PT-q8m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16215.876 | 3600000.00 | 3643148.00 | 92821.90 | ? 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/mcc2024-input.r065-tajo-171620414700266.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BugTracking-PT-q8m064, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 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-q8m064-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m064-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716648091414
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m064
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 14:41:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 14:41:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:41:33] [INFO ] Load time of PNML (sax parser for PT used): 681 ms
[2024-05-25 14:41:33] [INFO ] Transformed 754 places.
[2024-05-25 14:41:33] [INFO ] Transformed 27370 transitions.
[2024-05-25 14:41:33] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 855 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 110 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m064-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 3729 out of 3904 initially.
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:41:34] [INFO ] Computed 10 invariants in 54 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
[2024-05-25 14:41:34] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 14:41:34] [INFO ] Computed 10 invariants in 29 ms
[2024-05-25 14:41:34] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-25 14:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:35] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2024-05-25 14:41:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:41:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:36] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-25 14:41:36] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-25 14:41:36] [INFO ] [Nat]Added 303 Read/Feed constraints in 274 ms returned sat
[2024-05-25 14:41:37] [INFO ] Deduced a trap composed of 46 places in 580 ms of which 5 ms to minimize.
[2024-05-25 14:41:37] [INFO ] Deduced a trap composed of 38 places in 646 ms of which 2 ms to minimize.
[2024-05-25 14:41:38] [INFO ] Deduced a trap composed of 17 places in 559 ms of which 1 ms to minimize.
[2024-05-25 14:41:38] [INFO ] Deduced a trap composed of 103 places in 427 ms of which 1 ms to minimize.
[2024-05-25 14:41:39] [INFO ] Deduced a trap composed of 63 places in 433 ms of which 2 ms to minimize.
[2024-05-25 14:41:40] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 1 ms to minimize.
[2024-05-25 14:41:40] [INFO ] Deduced a trap composed of 60 places in 503 ms of which 1 ms to minimize.
[2024-05-25 14:41:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:41:40] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:41] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2024-05-25 14:41:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:42] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2024-05-25 14:41:42] [INFO ] [Nat]Added 303 Read/Feed constraints in 171 ms returned sat
[2024-05-25 14:41:42] [INFO ] Deduced a trap composed of 45 places in 502 ms of which 0 ms to minimize.
[2024-05-25 14:41:43] [INFO ] Deduced a trap composed of 15 places in 517 ms of which 2 ms to minimize.
[2024-05-25 14:41:44] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 0 ms to minimize.
[2024-05-25 14:41:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1855 ms
[2024-05-25 14:41:44] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 333 ms.
[2024-05-25 14:41:44] [INFO ] Added : 3 causal constraints over 1 iterations in 783 ms. Result :sat
[2024-05-25 14:41:45] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:45] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-25 14:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:46] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-25 14:41:46] [INFO ] [Nat]Added 303 Read/Feed constraints in 73 ms returned sat
[2024-05-25 14:41:47] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 463 ms.
[2024-05-25 14:41:47] [INFO ] Added : 2 causal constraints over 1 iterations in 915 ms. Result :sat
[2024-05-25 14:41:47] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:48] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2024-05-25 14:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:49] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-05-25 14:41:49] [INFO ] [Nat]Added 303 Read/Feed constraints in 251 ms returned sat
[2024-05-25 14:41:50] [INFO ] Deduced a trap composed of 91 places in 419 ms of which 0 ms to minimize.
[2024-05-25 14:41:50] [INFO ] Deduced a trap composed of 19 places in 517 ms of which 1 ms to minimize.
[2024-05-25 14:41:51] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 0 ms to minimize.
[2024-05-25 14:41:51] [INFO ] Deduced a trap composed of 71 places in 423 ms of which 1 ms to minimize.
[2024-05-25 14:41:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2280 ms
[2024-05-25 14:41:52] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 264 ms.
[2024-05-25 14:41:52] [INFO ] Added : 8 causal constraints over 2 iterations in 853 ms. Result :sat
[2024-05-25 14:41:53] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:41:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:53] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2024-05-25 14:41:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-25 14:41:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:54] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2024-05-25 14:41:54] [INFO ] [Nat]Added 303 Read/Feed constraints in 388 ms returned sat
[2024-05-25 14:41:55] [INFO ] Deduced a trap composed of 59 places in 410 ms of which 1 ms to minimize.
[2024-05-25 14:41:55] [INFO ] Deduced a trap composed of 56 places in 339 ms of which 0 ms to minimize.
[2024-05-25 14:41:56] [INFO ] Deduced a trap composed of 45 places in 345 ms of which 0 ms to minimize.
[2024-05-25 14:41:56] [INFO ] Deduced a trap composed of 29 places in 369 ms of which 1 ms to minimize.
[2024-05-25 14:41:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1876 ms
[2024-05-25 14:41:57] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 338 ms.
[2024-05-25 14:41:57] [INFO ] Added : 13 causal constraints over 3 iterations in 1122 ms. Result :sat
[2024-05-25 14:41:58] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:58] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-25 14:41:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:41:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:41:59] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2024-05-25 14:41:59] [INFO ] [Nat]Added 303 Read/Feed constraints in 234 ms returned sat
[2024-05-25 14:42:00] [INFO ] Deduced a trap composed of 12 places in 466 ms of which 0 ms to minimize.
[2024-05-25 14:42:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 654 ms
[2024-05-25 14:42:00] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 324 ms.
[2024-05-25 14:42:01] [INFO ] Deduced a trap composed of 8 places in 413 ms of which 0 ms to minimize.
[2024-05-25 14:42:02] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 0 ms to minimize.
[2024-05-25 14:42:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1170 ms
[2024-05-25 14:42:02] [INFO ] Added : 11 causal constraints over 3 iterations in 2526 ms. Result :sat
[2024-05-25 14:42:03] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2024-05-25 14:42:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:03] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-05-25 14:42:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:04] [INFO ] [Nat]Absence check using state equation in 641 ms returned sat
[2024-05-25 14:42:04] [INFO ] [Nat]Added 303 Read/Feed constraints in 309 ms returned sat
[2024-05-25 14:42:05] [INFO ] Deduced a trap composed of 59 places in 695 ms of which 1 ms to minimize.
[2024-05-25 14:42:06] [INFO ] Deduced a trap composed of 14 places in 706 ms of which 1 ms to minimize.
[2024-05-25 14:42:07] [INFO ] Deduced a trap composed of 58 places in 419 ms of which 1 ms to minimize.
[2024-05-25 14:42:07] [INFO ] Deduced a trap composed of 38 places in 342 ms of which 1 ms to minimize.
[2024-05-25 14:42:07] [INFO ] Deduced a trap composed of 33 places in 331 ms of which 1 ms to minimize.
[2024-05-25 14:42:08] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 1 ms to minimize.
[2024-05-25 14:42:08] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 1 ms to minimize.
[2024-05-25 14:42:08] [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 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-25 14:42:09] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 14:42:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:09] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2024-05-25 14:42:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 14:42:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:10] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2024-05-25 14:42:10] [INFO ] [Nat]Added 303 Read/Feed constraints in 69 ms returned sat
[2024-05-25 14:42:10] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 271 ms.
[2024-05-25 14:42:12] [INFO ] Deduced a trap composed of 13 places in 492 ms of which 0 ms to minimize.
[2024-05-25 14:42:13] [INFO ] Deduced a trap composed of 14 places in 496 ms of which 1 ms to minimize.
[2024-05-25 14:42:14] [INFO ] Deduced a trap composed of 48 places in 499 ms of which 1 ms to minimize.
[2024-05-25 14:42:14] [INFO ] Deduced a trap composed of 18 places in 351 ms of which 0 ms to minimize.
[2024-05-25 14:42:14] [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 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, 1, -1, -1, 1, 1, -1] Max seen :[0, 1, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 352 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 353 ms. Remains : 269/280 places, 3871/3904 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:42:16] [INFO ] Computed 8 invariants in 26 ms
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2029 ms. (steps per millisecond=492 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2018 ms. (steps per millisecond=495 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1811 ms. (steps per millisecond=552 ) properties (out of 8) seen :0
[2024-05-25 14:42:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:42:32] [INFO ] Computed 8 invariants in 36 ms
[2024-05-25 14:42:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:32] [INFO ] [Real]Absence check using state equation in 617 ms returned sat
[2024-05-25 14:42:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:33] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2024-05-25 14:42:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:42:33] [INFO ] [Nat]Added 283 Read/Feed constraints in 308 ms returned sat
[2024-05-25 14:42:34] [INFO ] Deduced a trap composed of 17 places in 478 ms of which 1 ms to minimize.
[2024-05-25 14:42:35] [INFO ] Deduced a trap composed of 88 places in 490 ms of which 1 ms to minimize.
[2024-05-25 14:42:35] [INFO ] Deduced a trap composed of 64 places in 494 ms of which 1 ms to minimize.
[2024-05-25 14:42:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1939 ms
[2024-05-25 14:42:36] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2024-05-25 14:42:37] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 0 ms to minimize.
[2024-05-25 14:42:38] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 1 ms to minimize.
[2024-05-25 14:42:38] [INFO ] Deduced a trap composed of 67 places in 300 ms of which 0 ms to minimize.
[2024-05-25 14:42:39] [INFO ] Deduced a trap composed of 59 places in 320 ms of which 0 ms to minimize.
[2024-05-25 14:42:39] [INFO ] Deduced a trap composed of 59 places in 301 ms of which 1 ms to minimize.
[2024-05-25 14:42:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2511 ms
[2024-05-25 14:42:40] [INFO ] Added : 16 causal constraints over 5 iterations in 4338 ms. Result :sat
[2024-05-25 14:42:40] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:41] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2024-05-25 14:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:41] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2024-05-25 14:42:42] [INFO ] [Nat]Added 283 Read/Feed constraints in 176 ms returned sat
[2024-05-25 14:42:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 297 ms.
[2024-05-25 14:42:42] [INFO ] Added : 4 causal constraints over 1 iterations in 733 ms. Result :sat
[2024-05-25 14:42:43] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:43] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2024-05-25 14:42:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:44] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2024-05-25 14:42:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 96 ms returned sat
[2024-05-25 14:42:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 306 ms.
[2024-05-25 14:42:46] [INFO ] Deduced a trap composed of 7 places in 605 ms of which 0 ms to minimize.
[2024-05-25 14:42:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 905 ms
[2024-05-25 14:42:47] [INFO ] Added : 10 causal constraints over 3 iterations in 2438 ms. Result :sat
[2024-05-25 14:42:47] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:48] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2024-05-25 14:42:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:48] [INFO ] [Nat]Absence check using state equation in 664 ms returned sat
[2024-05-25 14:42:49] [INFO ] [Nat]Added 283 Read/Feed constraints in 172 ms returned sat
[2024-05-25 14:42:49] [INFO ] Deduced a trap composed of 10 places in 493 ms of which 1 ms to minimize.
[2024-05-25 14:42:50] [INFO ] Deduced a trap composed of 53 places in 431 ms of which 1 ms to minimize.
[2024-05-25 14:42:50] [INFO ] Deduced a trap composed of 67 places in 466 ms of which 1 ms to minimize.
[2024-05-25 14:42:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1802 ms
[2024-05-25 14:42:51] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 326 ms.
[2024-05-25 14:42:51] [INFO ] Added : 2 causal constraints over 1 iterations in 697 ms. Result :sat
[2024-05-25 14:42:51] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:52] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-25 14:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:42:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:53] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2024-05-25 14:42:53] [INFO ] [Nat]Added 283 Read/Feed constraints in 360 ms returned sat
[2024-05-25 14:42:53] [INFO ] Deduced a trap composed of 19 places in 379 ms of which 5 ms to minimize.
[2024-05-25 14:42:54] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 0 ms to minimize.
[2024-05-25 14:42:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1010 ms
[2024-05-25 14:42:54] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 340 ms.
[2024-05-25 14:42:55] [INFO ] Added : 8 causal constraints over 2 iterations in 1021 ms. Result :sat
[2024-05-25 14:42:55] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:56] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2024-05-25 14:42:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:42:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:42:57] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2024-05-25 14:42:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 353 ms returned sat
[2024-05-25 14:42:57] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-05-25 14:42:58] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 0 ms to minimize.
[2024-05-25 14:42:58] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 0 ms to minimize.
[2024-05-25 14:42:59] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 1 ms to minimize.
[2024-05-25 14:42:59] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 2 ms to minimize.
[2024-05-25 14:42:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2243 ms
[2024-05-25 14:43:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 377 ms.
[2024-05-25 14:43:00] [INFO ] Added : 11 causal constraints over 3 iterations in 1234 ms. Result :sat
[2024-05-25 14:43:01] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:01] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-25 14:43:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:43:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:02] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-25 14:43:02] [INFO ] [Nat]Added 283 Read/Feed constraints in 150 ms returned sat
[2024-05-25 14:43:03] [INFO ] Deduced a trap composed of 14 places in 417 ms of which 0 ms to minimize.
[2024-05-25 14:43:03] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 0 ms to minimize.
[2024-05-25 14:43:04] [INFO ] Deduced a trap composed of 55 places in 418 ms of which 1 ms to minimize.
[2024-05-25 14:43:04] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 1 ms to minimize.
[2024-05-25 14:43:05] [INFO ] Deduced a trap composed of 30 places in 429 ms of which 1 ms to minimize.
[2024-05-25 14:43:05] [INFO ] Deduced a trap composed of 61 places in 325 ms of which 1 ms to minimize.
[2024-05-25 14:43:06] [INFO ] Deduced a trap composed of 47 places in 317 ms of which 0 ms to minimize.
[2024-05-25 14:43:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3706 ms
[2024-05-25 14:43:06] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 328 ms.
[2024-05-25 14:43:07] [INFO ] Added : 10 causal constraints over 3 iterations in 1176 ms. Result :sat
[2024-05-25 14:43:07] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-25 14:43:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:08] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2024-05-25 14:43:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:09] [INFO ] [Nat]Absence check using state equation in 610 ms returned sat
[2024-05-25 14:43:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 63 ms returned sat
[2024-05-25 14:43:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 332 ms.
[2024-05-25 14:43:10] [INFO ] Added : 1 causal constraints over 1 iterations in 763 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, -1, 1, -1, -1, 1, 1, -1] Max seen :[0, 1, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:43:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:10] [INFO ] Invariant cache hit.
[2024-05-25 14:43:11] [INFO ] Implicit Places using invariants in 549 ms returned []
[2024-05-25 14:43:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:11] [INFO ] Invariant cache hit.
[2024-05-25 14:43:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:14] [INFO ] Implicit Places using invariants and state equation in 2741 ms returned []
Implicit Place search using SMT with State Equation took 3294 ms to find 0 implicit places.
[2024-05-25 14:43:14] [INFO ] Redundant transitions in 467 ms returned []
[2024-05-25 14:43:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:14] [INFO ] Invariant cache hit.
[2024-05-25 14:43:16] [INFO ] Dead Transitions using invariants and state equation in 1294 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5146 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-00
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:16] [INFO ] Computed 8 invariants in 14 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
[2024-05-25 14:43:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:16] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 14:43:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:16] [INFO ] [Real]Absence check using state equation in 528 ms returned sat
[2024-05-25 14:43:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:17] [INFO ] [Nat]Absence check using state equation in 597 ms returned sat
[2024-05-25 14:43:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:17] [INFO ] [Nat]Added 283 Read/Feed constraints in 327 ms returned sat
[2024-05-25 14:43:18] [INFO ] Deduced a trap composed of 17 places in 455 ms of which 2 ms to minimize.
[2024-05-25 14:43:18] [INFO ] Deduced a trap composed of 88 places in 403 ms of which 1 ms to minimize.
[2024-05-25 14:43:19] [INFO ] Deduced a trap composed of 64 places in 468 ms of which 0 ms to minimize.
[2024-05-25 14:43:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1735 ms
[2024-05-25 14:43:19] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 329 ms.
[2024-05-25 14:43:21] [INFO ] Deduced a trap composed of 26 places in 299 ms of which 1 ms to minimize.
[2024-05-25 14:43:21] [INFO ] Deduced a trap composed of 30 places in 309 ms of which 0 ms to minimize.
[2024-05-25 14:43:21] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 876 ms
[2024-05-25 14:43:22] [INFO ] Deduced a trap composed of 7 places in 730 ms of which 1 ms to minimize.
[2024-05-25 14:43:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:22] [INFO ] Computed 8 invariants in 14 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1976 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
[2024-05-25 14:43:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:25] [INFO ] Computed 8 invariants in 26 ms
[2024-05-25 14:43:25] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:26] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2024-05-25 14:43:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:26] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2024-05-25 14:43:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:27] [INFO ] [Nat]Added 283 Read/Feed constraints in 330 ms returned sat
[2024-05-25 14:43:27] [INFO ] Deduced a trap composed of 17 places in 458 ms of which 0 ms to minimize.
[2024-05-25 14:43:28] [INFO ] Deduced a trap composed of 88 places in 384 ms of which 1 ms to minimize.
[2024-05-25 14:43:28] [INFO ] Deduced a trap composed of 64 places in 403 ms of which 2 ms to minimize.
[2024-05-25 14:43:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1716 ms
[2024-05-25 14:43:29] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 347 ms.
[2024-05-25 14:43:30] [INFO ] Deduced a trap composed of 26 places in 267 ms of which 0 ms to minimize.
[2024-05-25 14:43:31] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 1 ms to minimize.
[2024-05-25 14:43:31] [INFO ] Deduced a trap composed of 67 places in 282 ms of which 0 ms to minimize.
[2024-05-25 14:43:32] [INFO ] Deduced a trap composed of 59 places in 306 ms of which 1 ms to minimize.
[2024-05-25 14:43:32] [INFO ] Deduced a trap composed of 59 places in 300 ms of which 1 ms to minimize.
[2024-05-25 14:43:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2410 ms
[2024-05-25 14:43:33] [INFO ] Added : 16 causal constraints over 5 iterations in 4346 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 91 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 78 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:43:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:33] [INFO ] Invariant cache hit.
[2024-05-25 14:43:34] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-25 14:43:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:34] [INFO ] Invariant cache hit.
[2024-05-25 14:43:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:37] [INFO ] Implicit Places using invariants and state equation in 3000 ms returned []
Implicit Place search using SMT with State Equation took 3521 ms to find 0 implicit places.
[2024-05-25 14:43:37] [INFO ] Redundant transitions in 281 ms returned []
[2024-05-25 14:43:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:37] [INFO ] Invariant cache hit.
[2024-05-25 14:43:38] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5028 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-00 in 22606 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-02
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:38] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10053 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1005 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
[2024-05-25 14:43:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:38] [INFO ] Computed 8 invariants in 13 ms
[2024-05-25 14:43:38] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:39] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-05-25 14:43:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:39] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2024-05-25 14:43:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 147 ms returned sat
[2024-05-25 14:43:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 233 ms.
[2024-05-25 14:43:40] [INFO ] Added : 4 causal constraints over 1 iterations in 583 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 70 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:40] [INFO ] Computed 8 invariants in 16 ms
Incomplete random walk after 1000038 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
[2024-05-25 14:43:43] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:43] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 14:43:43] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:44] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-25 14:43:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:45] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-25 14:43:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:45] [INFO ] [Nat]Added 283 Read/Feed constraints in 170 ms returned sat
[2024-05-25 14:43:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 311 ms.
[2024-05-25 14:43:46] [INFO ] Added : 4 causal constraints over 1 iterations in 704 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:43:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:46] [INFO ] Invariant cache hit.
[2024-05-25 14:43:46] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-25 14:43:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:46] [INFO ] Invariant cache hit.
[2024-05-25 14:43:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:49] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
[2024-05-25 14:43:49] [INFO ] Redundant transitions in 105 ms returned []
[2024-05-25 14:43:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:43:49] [INFO ] Invariant cache hit.
[2024-05-25 14:43:50] [INFO ] Dead Transitions using invariants and state equation in 1232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4086 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-02 in 11768 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-03
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:50] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10014 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
[2024-05-25 14:43:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:50] [INFO ] Computed 8 invariants in 21 ms
[2024-05-25 14:43:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:51] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2024-05-25 14:43:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:51] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2024-05-25 14:43:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:51] [INFO ] [Nat]Added 283 Read/Feed constraints in 84 ms returned sat
[2024-05-25 14:43:52] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 342 ms.
[2024-05-25 14:43:53] [INFO ] Deduced a trap composed of 7 places in 608 ms of which 1 ms to minimize.
[2024-05-25 14:43:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 926 ms
[2024-05-25 14:43:54] [INFO ] Added : 10 causal constraints over 3 iterations in 2446 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:54] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1973 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
[2024-05-25 14:43:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:43:57] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 14:43:57] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:58] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-25 14:43:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:43:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:43:58] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-25 14:43:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:43:59] [INFO ] [Nat]Added 283 Read/Feed constraints in 72 ms returned sat
[2024-05-25 14:43:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 351 ms.
[2024-05-25 14:44:01] [INFO ] Deduced a trap composed of 7 places in 548 ms of which 1 ms to minimize.
[2024-05-25 14:44:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 834 ms
[2024-05-25 14:44:01] [INFO ] Added : 10 causal constraints over 3 iterations in 2392 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 76 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 105 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:44:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:01] [INFO ] Invariant cache hit.
[2024-05-25 14:44:02] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-25 14:44:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:02] [INFO ] Invariant cache hit.
[2024-05-25 14:44:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:05] [INFO ] Implicit Places using invariants and state equation in 3032 ms returned []
Implicit Place search using SMT with State Equation took 3538 ms to find 0 implicit places.
[2024-05-25 14:44:05] [INFO ] Redundant transitions in 153 ms returned []
[2024-05-25 14:44:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:05] [INFO ] Invariant cache hit.
[2024-05-25 14:44:06] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4986 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-03 in 16367 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:06] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 10044 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2024-05-25 14:44:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:06] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 14:44:06] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:07] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2024-05-25 14:44:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:08] [INFO ] [Nat]Absence check using state equation in 589 ms returned sat
[2024-05-25 14:44:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2024-05-25 14:44:08] [INFO ] Deduced a trap composed of 10 places in 478 ms of which 1 ms to minimize.
[2024-05-25 14:44:09] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 0 ms to minimize.
[2024-05-25 14:44:09] [INFO ] Deduced a trap composed of 67 places in 433 ms of which 1 ms to minimize.
[2024-05-25 14:44:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1770 ms
[2024-05-25 14:44:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 283 ms.
[2024-05-25 14:44:10] [INFO ] Added : 2 causal constraints over 1 iterations in 715 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:11] [INFO ] Computed 8 invariants in 21 ms
Incomplete random walk after 1000046 steps, including 2 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2067 ms. (steps per millisecond=483 ) properties (out of 1) seen :0
[2024-05-25 14:44:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:14] [INFO ] Computed 8 invariants in 11 ms
[2024-05-25 14:44:14] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:14] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2024-05-25 14:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:15] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-25 14:44:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 134 ms returned sat
[2024-05-25 14:44:15] [INFO ] Deduced a trap composed of 10 places in 447 ms of which 1 ms to minimize.
[2024-05-25 14:44:16] [INFO ] Deduced a trap composed of 53 places in 433 ms of which 0 ms to minimize.
[2024-05-25 14:44:17] [INFO ] Deduced a trap composed of 67 places in 467 ms of which 1 ms to minimize.
[2024-05-25 14:44:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1694 ms
[2024-05-25 14:44:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 348 ms.
[2024-05-25 14:44:17] [INFO ] Added : 2 causal constraints over 1 iterations in 777 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 74 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:44:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:18] [INFO ] Invariant cache hit.
[2024-05-25 14:44:18] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-25 14:44:18] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:18] [INFO ] Invariant cache hit.
[2024-05-25 14:44:19] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:21] [INFO ] Implicit Places using invariants and state equation in 2800 ms returned []
Implicit Place search using SMT with State Equation took 3333 ms to find 0 implicit places.
[2024-05-25 14:44:21] [INFO ] Redundant transitions in 157 ms returned []
[2024-05-25 14:44:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:21] [INFO ] Invariant cache hit.
[2024-05-25 14:44:23] [INFO ] Dead Transitions using invariants and state equation in 1336 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4913 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-04 in 16292 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-05
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:23] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 10041 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=912 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:44:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:23] [INFO ] Computed 8 invariants in 8 ms
[2024-05-25 14:44:23] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:23] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2024-05-25 14:44:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:24] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-05-25 14:44:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 324 ms returned sat
[2024-05-25 14:44:25] [INFO ] Deduced a trap composed of 19 places in 361 ms of which 0 ms to minimize.
[2024-05-25 14:44:25] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 1 ms to minimize.
[2024-05-25 14:44:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 919 ms
[2024-05-25 14:44:26] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 357 ms.
[2024-05-25 14:44:26] [INFO ] Added : 8 causal constraints over 2 iterations in 1015 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:27] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000017 steps, including 2 resets, run finished after 1232 ms. (steps per millisecond=811 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1997 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 14:44:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:30] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 14:44:30] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:31] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2024-05-25 14:44:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:44:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:31] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-25 14:44:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 322 ms returned sat
[2024-05-25 14:44:32] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 0 ms to minimize.
[2024-05-25 14:44:32] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 1 ms to minimize.
[2024-05-25 14:44:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 806 ms
[2024-05-25 14:44:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 368 ms.
[2024-05-25 14:44:33] [INFO ] Added : 8 causal constraints over 2 iterations in 1037 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 57 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:44:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:34] [INFO ] Invariant cache hit.
[2024-05-25 14:44:34] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-25 14:44:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:34] [INFO ] Invariant cache hit.
[2024-05-25 14:44:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:37] [INFO ] Implicit Places using invariants and state equation in 2400 ms returned []
Implicit Place search using SMT with State Equation took 2911 ms to find 0 implicit places.
[2024-05-25 14:44:37] [INFO ] Redundant transitions in 170 ms returned []
[2024-05-25 14:44:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:37] [INFO ] Invariant cache hit.
[2024-05-25 14:44:38] [INFO ] Dead Transitions using invariants and state equation in 1176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4323 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-05 in 15428 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-07
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:38] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10017 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
[2024-05-25 14:44:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:38] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 14:44:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:39] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2024-05-25 14:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:39] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2024-05-25 14:44:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 350 ms returned sat
[2024-05-25 14:44:40] [INFO ] Deduced a trap composed of 10 places in 383 ms of which 1 ms to minimize.
[2024-05-25 14:44:41] [INFO ] Deduced a trap composed of 38 places in 352 ms of which 0 ms to minimize.
[2024-05-25 14:44:41] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 1 ms to minimize.
[2024-05-25 14:44:41] [INFO ] Deduced a trap composed of 19 places in 349 ms of which 0 ms to minimize.
[2024-05-25 14:44:42] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2024-05-25 14:44:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2170 ms
[2024-05-25 14:44:42] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 343 ms.
[2024-05-25 14:44:43] [INFO ] Added : 11 causal constraints over 3 iterations in 1158 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 69 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:43] [INFO ] Computed 8 invariants in 12 ms
Incomplete random walk after 1000053 steps, including 2 resets, run finished after 1075 ms. (steps per millisecond=930 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2018 ms. (steps per millisecond=495 ) properties (out of 1) seen :0
[2024-05-25 14:44:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:46] [INFO ] Computed 8 invariants in 20 ms
[2024-05-25 14:44:47] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:47] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2024-05-25 14:44:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:48] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2024-05-25 14:44:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 390 ms returned sat
[2024-05-25 14:44:49] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 0 ms to minimize.
[2024-05-25 14:44:49] [INFO ] Deduced a trap composed of 38 places in 304 ms of which 0 ms to minimize.
[2024-05-25 14:44:49] [INFO ] Deduced a trap composed of 14 places in 201 ms of which 0 ms to minimize.
[2024-05-25 14:44:50] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 1 ms to minimize.
[2024-05-25 14:44:50] [INFO ] Deduced a trap composed of 27 places in 213 ms of which 0 ms to minimize.
[2024-05-25 14:44:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1823 ms
[2024-05-25 14:44:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 297 ms.
[2024-05-25 14:44:51] [INFO ] Added : 11 causal constraints over 3 iterations in 1057 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 56 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:44:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:51] [INFO ] Invariant cache hit.
[2024-05-25 14:44:52] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-25 14:44:52] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:52] [INFO ] Invariant cache hit.
[2024-05-25 14:44:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:54] [INFO ] Implicit Places using invariants and state equation in 2667 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
[2024-05-25 14:44:55] [INFO ] Redundant transitions in 149 ms returned []
[2024-05-25 14:44:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:44:55] [INFO ] Invariant cache hit.
[2024-05-25 14:44:56] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4418 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-07 in 17769 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-09
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:56] [INFO ] Computed 8 invariants in 11 ms
Incomplete random walk after 10019 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 1) 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 1) seen :0
[2024-05-25 14:44:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:44:56] [INFO ] Computed 8 invariants in 10 ms
[2024-05-25 14:44:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 14:44:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:56] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2024-05-25 14:44:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:44:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:44:57] [INFO ] [Nat]Absence check using state equation in 617 ms returned sat
[2024-05-25 14:44:57] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:44:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 151 ms returned sat
[2024-05-25 14:44:58] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 1 ms to minimize.
[2024-05-25 14:44:58] [INFO ] Deduced a trap composed of 31 places in 368 ms of which 1 ms to minimize.
[2024-05-25 14:44:59] [INFO ] Deduced a trap composed of 55 places in 346 ms of which 1 ms to minimize.
[2024-05-25 14:44:59] [INFO ] Deduced a trap composed of 74 places in 354 ms of which 1 ms to minimize.
[2024-05-25 14:44:59] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2024-05-25 14:45:00] [INFO ] Deduced a trap composed of 61 places in 250 ms of which 1 ms to minimize.
[2024-05-25 14:45:00] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 1 ms to minimize.
[2024-05-25 14:45:00] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3163 ms
[2024-05-25 14:45:01] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 323 ms.
[2024-05-25 14:45:02] [INFO ] Deduced a trap composed of 7 places in 614 ms of which 1 ms to minimize.
[2024-05-25 14:45: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 51 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:02] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 1000054 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1988 ms. (steps per millisecond=503 ) properties (out of 1) seen :0
[2024-05-25 14:45:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:05] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 14:45:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:06] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2024-05-25 14:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:45:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 14:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:06] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2024-05-25 14:45:06] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:45:07] [INFO ] [Nat]Added 283 Read/Feed constraints in 149 ms returned sat
[2024-05-25 14:45:07] [INFO ] Deduced a trap composed of 14 places in 383 ms of which 0 ms to minimize.
[2024-05-25 14:45:08] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 0 ms to minimize.
[2024-05-25 14:45:08] [INFO ] Deduced a trap composed of 55 places in 359 ms of which 1 ms to minimize.
[2024-05-25 14:45:08] [INFO ] Deduced a trap composed of 74 places in 363 ms of which 1 ms to minimize.
[2024-05-25 14:45:09] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 0 ms to minimize.
[2024-05-25 14:45:09] [INFO ] Deduced a trap composed of 61 places in 300 ms of which 1 ms to minimize.
[2024-05-25 14:45:10] [INFO ] Deduced a trap composed of 47 places in 283 ms of which 0 ms to minimize.
[2024-05-25 14:45:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3224 ms
[2024-05-25 14:45:10] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2024-05-25 14:45:11] [INFO ] Added : 10 causal constraints over 3 iterations in 966 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 73 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 78 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:45:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:11] [INFO ] Invariant cache hit.
[2024-05-25 14:45:12] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-25 14:45:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:12] [INFO ] Invariant cache hit.
[2024-05-25 14:45:12] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:45:13] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2024-05-25 14:45:13] [INFO ] Redundant transitions in 103 ms returned []
[2024-05-25 14:45:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:13] [INFO ] Invariant cache hit.
[2024-05-25 14:45:14] [INFO ] Dead Transitions using invariants and state equation in 1186 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3118 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-09 in 18447 ms.
Starting property specific reduction for BugTracking-PT-q8m064-UpperBounds-12
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:14] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10023 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
[2024-05-25 14:45:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:14] [INFO ] Computed 8 invariants in 9 ms
[2024-05-25 14:45:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:15] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2024-05-25 14:45:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:45:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 14:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:16] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-25 14:45:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:45:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 60 ms returned sat
[2024-05-25 14:45:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 294 ms.
[2024-05-25 14:45:17] [INFO ] Added : 1 causal constraints over 1 iterations in 653 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 67 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 269/269 places, 3871/3871 transitions.
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:17] [INFO ] Computed 8 invariants in 18 ms
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=956 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
[2024-05-25 14:45:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 14:45:20] [INFO ] Computed 8 invariants in 35 ms
[2024-05-25 14:45:20] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 14:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:20] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2024-05-25 14:45:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 14:45:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 14:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 14:45:21] [INFO ] [Nat]Absence check using state equation in 556 ms returned sat
[2024-05-25 14:45:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:45:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 52 ms returned sat
[2024-05-25 14:45:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 308 ms.
[2024-05-25 14:45:22] [INFO ] Added : 1 causal constraints over 1 iterations in 665 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 14:45:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:22] [INFO ] Invariant cache hit.
[2024-05-25 14:45:23] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-05-25 14:45:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:23] [INFO ] Invariant cache hit.
[2024-05-25 14:45:23] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 14:45:25] [INFO ] Implicit Places using invariants and state equation in 2196 ms returned []
Implicit Place search using SMT with State Equation took 2805 ms to find 0 implicit places.
[2024-05-25 14:45:25] [INFO ] Redundant transitions in 168 ms returned []
[2024-05-25 14:45:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 14:45:25] [INFO ] Invariant cache hit.
[2024-05-25 14:45:26] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4155 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m064-UpperBounds-12 in 11944 ms.
[2024-05-25 14:45:27] [INFO ] Flatten gal took : 546 ms
[2024-05-25 14:45:27] [INFO ] Applying decomposition
[2024-05-25 14:45:27] [INFO ] Flatten gal took : 181 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17247985004331351123.txt' '-o' '/tmp/graph17247985004331351123.bin' '-w' '/tmp/graph17247985004331351123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17247985004331351123.bin' '-l' '-1' '-v' '-w' '/tmp/graph17247985004331351123.weights' '-q' '0' '-e' '0.001'
[2024-05-25 14:45:28] [INFO ] Decomposing Gal with order
[2024-05-25 14:45:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 14:45:28] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 14:45:29] [INFO ] Flatten gal took : 448 ms
[2024-05-25 14:45:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 25 ms.
[2024-05-25 14:45:29] [INFO ] Time to serialize gal into /tmp/UpperBounds648638334037253946.gal : 34 ms
[2024-05-25 14:45:29] [INFO ] Time to serialize properties into /tmp/UpperBounds17994764899901725587.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds648638334037253946.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17994764899901725587.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds17994764899901725587.prop.
Detected timeout of ITS tools.
[2024-05-25 15:06:53] [INFO ] Flatten gal took : 1190 ms
[2024-05-25 15:06:53] [INFO ] Time to serialize gal into /tmp/UpperBounds11598630562553422188.gal : 129 ms
[2024-05-25 15:06:53] [INFO ] Time to serialize properties into /tmp/UpperBounds2151407651445182915.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11598630562553422188.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2151407651445182915.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds2151407651445182915.prop.
Detected timeout of ITS tools.
[2024-05-25 15:28:13] [INFO ] Flatten gal took : 825 ms
[2024-05-25 15:28:16] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 15:28:16] [INFO ] Transformed 269 places.
[2024-05-25 15:28:16] [INFO ] Transformed 3871 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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
[2024-05-25 15:28:16] [INFO ] Time to serialize gal into /tmp/UpperBounds14495092274598083511.gal : 43 ms
[2024-05-25 15:28:16] [INFO ] Time to serialize properties into /tmp/UpperBounds6974629666762189238.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14495092274598083511.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6974629666762189238.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds6974629666762189238.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5068916 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16170996 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-q8m064"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BugTracking-PT-q8m064, 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 r065-tajo-171620414700266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 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 ;