About the Execution of 2023-gold for BugTracking-PT-q8m004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.268 | 3600000.00 | 3622734.00 | 67841.90 | 0 ? 0 0 ? 0 0 1 ? ? ? 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-171620414700246.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-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414700246
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:30 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 17K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716645203737
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-q8m004
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 13:53:26] [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 13:53:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 13:53:27] [INFO ] Load time of PNML (sax parser for PT used): 973 ms
[2024-05-25 13:53:27] [INFO ] Transformed 754 places.
[2024-05-25 13:53:27] [INFO ] Transformed 27370 transitions.
[2024-05-25 13:53:27] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 128 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-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 13:53:27] [INFO ] Computed 10 invariants in 49 ms
Incomplete random walk after 10000 steps, including 91 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) seen :1
FORMULA BugTracking-PT-q8m004-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
[2024-05-25 13:53:28] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-25 13:53:28] [INFO ] Computed 10 invariants in 40 ms
[2024-05-25 13:53:28] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-25 13:53:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:29] [INFO ] [Real]Absence check using state equation in 1106 ms returned sat
[2024-05-25 13:53:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:30] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2024-05-25 13:53:30] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-25 13:53:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 306 ms returned sat
[2024-05-25 13:53:31] [INFO ] Deduced a trap composed of 61 places in 836 ms of which 5 ms to minimize.
[2024-05-25 13:53:32] [INFO ] Deduced a trap composed of 57 places in 721 ms of which 1 ms to minimize.
[2024-05-25 13:53:33] [INFO ] Deduced a trap composed of 58 places in 645 ms of which 2 ms to minimize.
[2024-05-25 13:53:34] [INFO ] Deduced a trap composed of 47 places in 732 ms of which 2 ms to minimize.
[2024-05-25 13:53:35] [INFO ] Deduced a trap composed of 53 places in 679 ms of which 1 ms to minimize.
[2024-05-25 13:53:35] [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 13:53:35] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 13:53:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:36] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2024-05-25 13:53:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:36] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2024-05-25 13:53:37] [INFO ] [Nat]Added 303 Read/Feed constraints in 188 ms returned sat
[2024-05-25 13:53:37] [INFO ] Deduced a trap composed of 33 places in 635 ms of which 1 ms to minimize.
[2024-05-25 13:53:38] [INFO ] Deduced a trap composed of 31 places in 615 ms of which 1 ms to minimize.
[2024-05-25 13:53:39] [INFO ] Deduced a trap composed of 62 places in 581 ms of which 1 ms to minimize.
[2024-05-25 13:53:39] [INFO ] Deduced a trap composed of 12 places in 590 ms of which 1 ms to minimize.
[2024-05-25 13:53:40] [INFO ] Deduced a trap composed of 50 places in 607 ms of which 0 ms to minimize.
[2024-05-25 13:53:40] [INFO ] Deduced a trap composed of 38 places in 380 ms of which 0 ms to minimize.
[2024-05-25 13:53:41] [INFO ] Deduced a trap composed of 14 places in 346 ms of which 1 ms to minimize.
[2024-05-25 13:53:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 13:53:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-25 13:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:42] [INFO ] [Real]Absence check using state equation in 1125 ms returned sat
[2024-05-25 13:53:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:43] [INFO ] [Nat]Absence check using state equation in 636 ms returned sat
[2024-05-25 13:53:43] [INFO ] [Nat]Added 303 Read/Feed constraints in 355 ms returned sat
[2024-05-25 13:53:44] [INFO ] Deduced a trap composed of 23 places in 649 ms of which 1 ms to minimize.
[2024-05-25 13:53:44] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 1 ms to minimize.
[2024-05-25 13:53:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1259 ms
[2024-05-25 13:53:45] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 569 ms.
[2024-05-25 13:53:46] [INFO ] Added : 11 causal constraints over 3 iterations in 1449 ms. Result :sat
[2024-05-25 13:53:46] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:53:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:47] [INFO ] [Real]Absence check using state equation in 678 ms returned sat
[2024-05-25 13:53:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:48] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-05-25 13:53:48] [INFO ] [Nat]Added 303 Read/Feed constraints in 54 ms returned sat
[2024-05-25 13:53:48] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 313 ms.
[2024-05-25 13:53:49] [INFO ] Added : 2 causal constraints over 1 iterations in 644 ms. Result :sat
[2024-05-25 13:53:49] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-25 13:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:49] [INFO ] [Real]Absence check using state equation in 644 ms returned sat
[2024-05-25 13:53:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:50] [INFO ] [Nat]Absence check using state equation in 747 ms returned sat
[2024-05-25 13:53:50] [INFO ] [Nat]Added 303 Read/Feed constraints in 198 ms returned sat
[2024-05-25 13:53:51] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 0 ms to minimize.
[2024-05-25 13:53:51] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 0 ms to minimize.
[2024-05-25 13:53:52] [INFO ] Deduced a trap composed of 19 places in 561 ms of which 0 ms to minimize.
[2024-05-25 13:53:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1736 ms
[2024-05-25 13:53:53] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 485 ms.
[2024-05-25 13:53:53] [INFO ] Added : 6 causal constraints over 2 iterations in 1094 ms. Result :sat
[2024-05-25 13:53:54] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:54] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2024-05-25 13:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:53:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-25 13:53:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:53:55] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2024-05-25 13:53:56] [INFO ] [Nat]Added 303 Read/Feed constraints in 429 ms returned sat
[2024-05-25 13:53:57] [INFO ] Deduced a trap composed of 31 places in 837 ms of which 0 ms to minimize.
[2024-05-25 13:53:58] [INFO ] Deduced a trap composed of 14 places in 766 ms of which 0 ms to minimize.
[2024-05-25 13:53:59] [INFO ] Deduced a trap composed of 57 places in 766 ms of which 1 ms to minimize.
[2024-05-25 13:54:00] [INFO ] Deduced a trap composed of 95 places in 820 ms of which 1 ms to minimize.
[2024-05-25 13:54:00] [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 5
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)
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 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.33 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 506 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 508 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 13:54:00] [INFO ] Computed 8 invariants in 38 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6309 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1943 ms. (steps per millisecond=514 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2230 ms. (steps per millisecond=448 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1979 ms. (steps per millisecond=505 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2237 ms. (steps per millisecond=447 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 6) seen :0
[2024-05-25 13:54:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:54:19] [INFO ] Computed 8 invariants in 28 ms
[2024-05-25 13:54:19] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-25 13:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:20] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2024-05-25 13:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:21] [INFO ] [Nat]Absence check using state equation in 495 ms returned sat
[2024-05-25 13:54:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:54:21] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2024-05-25 13:54:21] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2024-05-25 13:54:22] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 1 ms to minimize.
[2024-05-25 13:54:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1085 ms
[2024-05-25 13:54:22] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 281 ms.
[2024-05-25 13:54:22] [INFO ] Added : 2 causal constraints over 1 iterations in 581 ms. Result :sat
[2024-05-25 13:54:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:54:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:23] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2024-05-25 13:54:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:54:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:24] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2024-05-25 13:54:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 318 ms returned sat
[2024-05-25 13:54:25] [INFO ] Deduced a trap composed of 57 places in 299 ms of which 0 ms to minimize.
[2024-05-25 13:54:25] [INFO ] Deduced a trap composed of 59 places in 299 ms of which 0 ms to minimize.
[2024-05-25 13:54:25] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 1 ms to minimize.
[2024-05-25 13:54:26] [INFO ] Deduced a trap composed of 54 places in 299 ms of which 0 ms to minimize.
[2024-05-25 13:54:29] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 4633 ms
[2024-05-25 13:54:29] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:54:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:29] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2024-05-25 13:54:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:54:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:30] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-05-25 13:54:30] [INFO ] [Nat]Added 283 Read/Feed constraints in 254 ms returned sat
[2024-05-25 13:54:31] [INFO ] Deduced a trap composed of 57 places in 294 ms of which 1 ms to minimize.
[2024-05-25 13:54:31] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 0 ms to minimize.
[2024-05-25 13:54:32] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 1 ms to minimize.
[2024-05-25 13:54:32] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 1 ms to minimize.
[2024-05-25 13:54:32] [INFO ] Deduced a trap composed of 54 places in 273 ms of which 1 ms to minimize.
[2024-05-25 13:54:33] [INFO ] Deduced a trap composed of 68 places in 313 ms of which 1 ms to minimize.
[2024-05-25 13:54:33] [INFO ] Deduced a trap composed of 54 places in 289 ms of which 1 ms to minimize.
[2024-05-25 13:54:33] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2766 ms
[2024-05-25 13:54:33] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 312 ms.
[2024-05-25 13:54:34] [INFO ] Added : 5 causal constraints over 1 iterations in 732 ms. Result :sat
[2024-05-25 13:54:34] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:35] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-05-25 13:54:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:35] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2024-05-25 13:54:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 40 ms returned sat
[2024-05-25 13:54:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2024-05-25 13:54:37] [INFO ] Deduced a trap composed of 112 places in 454 ms of which 0 ms to minimize.
[2024-05-25 13:54:37] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 1 ms to minimize.
[2024-05-25 13:54:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1082 ms
[2024-05-25 13:54:38] [INFO ] Added : 4 causal constraints over 3 iterations in 2465 ms. Result :sat
[2024-05-25 13:54:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:39] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2024-05-25 13:54:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:39] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2024-05-25 13:54:40] [INFO ] [Nat]Added 283 Read/Feed constraints in 280 ms returned sat
[2024-05-25 13:54:40] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 287 ms.
[2024-05-25 13:54:40] [INFO ] Added : 4 causal constraints over 1 iterations in 712 ms. Result :sat
[2024-05-25 13:54:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:41] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2024-05-25 13:54:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:42] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2024-05-25 13:54:42] [INFO ] [Nat]Added 283 Read/Feed constraints in 282 ms returned sat
[2024-05-25 13:54:43] [INFO ] Deduced a trap composed of 31 places in 447 ms of which 0 ms to minimize.
[2024-05-25 13:54:43] [INFO ] Deduced a trap composed of 28 places in 407 ms of which 1 ms to minimize.
[2024-05-25 13:54:44] [INFO ] Deduced a trap composed of 99 places in 375 ms of which 1 ms to minimize.
[2024-05-25 13:54:44] [INFO ] Deduced a trap composed of 39 places in 334 ms of which 0 ms to minimize.
[2024-05-25 13:54:45] [INFO ] Deduced a trap composed of 91 places in 341 ms of which 0 ms to minimize.
[2024-05-25 13:54:45] [INFO ] Deduced a trap composed of 95 places in 343 ms of which 1 ms to minimize.
[2024-05-25 13:54:46] [INFO ] Deduced a trap composed of 76 places in 316 ms of which 0 ms to minimize.
[2024-05-25 13:54:46] [INFO ] Deduced a trap composed of 44 places in 356 ms of which 1 ms to minimize.
[2024-05-25 13:54:47] [INFO ] Deduced a trap composed of 68 places in 270 ms of which 1 ms to minimize.
[2024-05-25 13:54:47] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 0 ms to minimize.
[2024-05-25 13:54:47] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 1 ms to minimize.
[2024-05-25 13:54:48] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 0 ms to minimize.
[2024-05-25 13:54:48] [INFO ] Deduced a trap composed of 90 places in 437 ms of which 0 ms to minimize.
[2024-05-25 13:54:49] [INFO ] Deduced a trap composed of 42 places in 392 ms of which 1 ms to minimize.
[2024-05-25 13:54:49] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6815 ms
[2024-05-25 13:54:49] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 273 ms.
[2024-05-25 13:54:50] [INFO ] Deduced a trap composed of 54 places in 376 ms of which 0 ms to minimize.
[2024-05-25 13:54:51] [INFO ] Deduced a trap composed of 69 places in 368 ms of which 0 ms to minimize.
[2024-05-25 13:54:51] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 1 ms to minimize.
[2024-05-25 13:54:52] [INFO ] Deduced a trap composed of 57 places in 420 ms of which 0 ms to minimize.
[2024-05-25 13:54:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2379 ms
[2024-05-25 13:54:53] [INFO ] Added : 8 causal constraints over 3 iterations in 3569 ms. Result :sat
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 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 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 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:54:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:54:53] [INFO ] Invariant cache hit.
[2024-05-25 13:54:54] [INFO ] Implicit Places using invariants in 564 ms returned []
[2024-05-25 13:54:54] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:54:54] [INFO ] Invariant cache hit.
[2024-05-25 13:54:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:54:55] [INFO ] Implicit Places using invariants and state equation in 1464 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
[2024-05-25 13:54:56] [INFO ] Redundant transitions in 449 ms returned []
[2024-05-25 13:54:56] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:54:56] [INFO ] Invariant cache hit.
[2024-05-25 13:54:57] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3694 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-01
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:54:57] [INFO ] Computed 8 invariants in 27 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 13:54:57] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:54:57] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 13:54:57] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:57] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2024-05-25 13:54:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:54:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:54:58] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2024-05-25 13:54:58] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:54:58] [INFO ] [Nat]Added 283 Read/Feed constraints in 301 ms returned sat
[2024-05-25 13:54:59] [INFO ] Deduced a trap composed of 17 places in 458 ms of which 0 ms to minimize.
[2024-05-25 13:54:59] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 1 ms to minimize.
[2024-05-25 13:55:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1127 ms
[2024-05-25 13:55:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 297 ms.
[2024-05-25 13:55:00] [INFO ] Added : 2 causal constraints over 1 iterations in 703 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 106 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 108 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 13:55:01] [INFO ] Computed 8 invariants in 21 ms
Incomplete random walk after 1000000 steps, including 5 resets, run finished after 4987 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1783 ms. (steps per millisecond=560 ) properties (out of 1) seen :0
[2024-05-25 13:55:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:07] [INFO ] Computed 8 invariants in 25 ms
[2024-05-25 13:55:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:08] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-05-25 13:55:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:09] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-25 13:55:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:09] [INFO ] [Nat]Added 283 Read/Feed constraints in 285 ms returned sat
[2024-05-25 13:55:10] [INFO ] Deduced a trap composed of 17 places in 391 ms of which 2 ms to minimize.
[2024-05-25 13:55:10] [INFO ] Deduced a trap composed of 26 places in 498 ms of which 1 ms to minimize.
[2024-05-25 13:55:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1219 ms
[2024-05-25 13:55:11] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 343 ms.
[2024-05-25 13:55:11] [INFO ] Added : 2 causal constraints over 1 iterations in 785 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 114 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 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 71 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:55:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:11] [INFO ] Invariant cache hit.
[2024-05-25 13:55:12] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-05-25 13:55:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:12] [INFO ] Invariant cache hit.
[2024-05-25 13:55:13] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:15] [INFO ] Implicit Places using invariants and state equation in 2808 ms returned []
Implicit Place search using SMT with State Equation took 3286 ms to find 0 implicit places.
[2024-05-25 13:55:15] [INFO ] Redundant transitions in 281 ms returned []
[2024-05-25 13:55:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:15] [INFO ] Invariant cache hit.
[2024-05-25 13:55:16] [INFO ] Dead Transitions using invariants and state equation in 1148 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4801 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-01 in 19456 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-04
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:16] [INFO ] Computed 8 invariants in 10 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
[2024-05-25 13:55:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:16] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 13:55:16] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:17] [INFO ] [Real]Absence check using state equation in 577 ms returned sat
[2024-05-25 13:55:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:55:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:18] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-05-25 13:55:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 333 ms returned sat
[2024-05-25 13:55:18] [INFO ] Deduced a trap composed of 57 places in 322 ms of which 0 ms to minimize.
[2024-05-25 13:55:19] [INFO ] Deduced a trap composed of 59 places in 306 ms of which 0 ms to minimize.
[2024-05-25 13:55:19] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 1 ms to minimize.
[2024-05-25 13:55:19] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 0 ms to minimize.
[2024-05-25 13:55:22] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 4077 ms
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 94 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 96 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 13:55:22] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5190 ms. (steps per millisecond=192 ) 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 13:55:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:29] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 13:55:29] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-25 13:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:30] [INFO ] [Real]Absence check using state equation in 556 ms returned sat
[2024-05-25 13:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:55:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:31] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2024-05-25 13:55:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:31] [INFO ] [Nat]Added 283 Read/Feed constraints in 318 ms returned sat
[2024-05-25 13:55:31] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 0 ms to minimize.
[2024-05-25 13:55:32] [INFO ] Deduced a trap composed of 59 places in 290 ms of which 1 ms to minimize.
[2024-05-25 13:55:32] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 3 ms to minimize.
[2024-05-25 13:55:32] [INFO ] Deduced a trap composed of 54 places in 310 ms of which 0 ms to minimize.
[2024-05-25 13:55:35] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 4626 ms
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 74 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 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:55:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:36] [INFO ] Invariant cache hit.
[2024-05-25 13:55:36] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-05-25 13:55:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:36] [INFO ] Invariant cache hit.
[2024-05-25 13:55:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:38] [INFO ] Implicit Places using invariants and state equation in 2331 ms returned []
Implicit Place search using SMT with State Equation took 2808 ms to find 0 implicit places.
[2024-05-25 13:55:39] [INFO ] Redundant transitions in 180 ms returned []
[2024-05-25 13:55:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:39] [INFO ] Invariant cache hit.
[2024-05-25 13:55:40] [INFO ] Dead Transitions using invariants and state equation in 1264 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4321 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-04 in 23834 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-08
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:40] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) 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 13:55:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:40] [INFO ] Computed 8 invariants in 19 ms
[2024-05-25 13:55:40] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-25 13:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:41] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2024-05-25 13:55:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:55:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:55:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:41] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2024-05-25 13:55:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:42] [INFO ] [Nat]Added 283 Read/Feed constraints in 296 ms returned sat
[2024-05-25 13:55:42] [INFO ] Deduced a trap composed of 57 places in 304 ms of which 2 ms to minimize.
[2024-05-25 13:55:42] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-05-25 13:55:43] [INFO ] Deduced a trap composed of 54 places in 284 ms of which 0 ms to minimize.
[2024-05-25 13:55:43] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 1 ms to minimize.
[2024-05-25 13:55:44] [INFO ] Deduced a trap composed of 54 places in 285 ms of which 0 ms to minimize.
[2024-05-25 13:55:44] [INFO ] Deduced a trap composed of 68 places in 332 ms of which 1 ms to minimize.
[2024-05-25 13:55:45] [INFO ] Deduced a trap composed of 54 places in 337 ms of which 0 ms to minimize.
[2024-05-25 13:55:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2977 ms
[2024-05-25 13:55:45] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 356 ms.
[2024-05-25 13:55:45] [INFO ] Added : 5 causal constraints over 1 iterations in 769 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 97 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 98 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 13:55:46] [INFO ] Computed 8 invariants in 24 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5578 ms. (steps per millisecond=179 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1969 ms. (steps per millisecond=507 ) properties (out of 1) seen :0
[2024-05-25 13:55:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:55:53] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 13:55:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:54] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-25 13:55:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:55:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:55:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:55:55] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2024-05-25 13:55:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:55:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 234 ms returned sat
[2024-05-25 13:55:55] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 0 ms to minimize.
[2024-05-25 13:55:56] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 0 ms to minimize.
[2024-05-25 13:55:56] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 0 ms to minimize.
[2024-05-25 13:55:56] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 0 ms to minimize.
[2024-05-25 13:55:57] [INFO ] Deduced a trap composed of 54 places in 298 ms of which 1 ms to minimize.
[2024-05-25 13:55:57] [INFO ] Deduced a trap composed of 68 places in 290 ms of which 0 ms to minimize.
[2024-05-25 13:55:58] [INFO ] Deduced a trap composed of 54 places in 274 ms of which 2 ms to minimize.
[2024-05-25 13:55:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2751 ms
[2024-05-25 13:55:58] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 295 ms.
[2024-05-25 13:55:58] [INFO ] Added : 5 causal constraints over 1 iterations in 769 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 58 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 59 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 60 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:55:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:59] [INFO ] Invariant cache hit.
[2024-05-25 13:55:59] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-25 13:55:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:55:59] [INFO ] Invariant cache hit.
[2024-05-25 13:56:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:01] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 2576 ms to find 0 implicit places.
[2024-05-25 13:56:01] [INFO ] Redundant transitions in 199 ms returned []
[2024-05-25 13:56:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:01] [INFO ] Invariant cache hit.
[2024-05-25 13:56:03] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4182 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-08 in 22847 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-09
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:03] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2024-05-25 13:56:03] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:03] [INFO ] Computed 8 invariants in 23 ms
[2024-05-25 13:56:03] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:56:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:04] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2024-05-25 13:56:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:04] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2024-05-25 13:56:04] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:04] [INFO ] [Nat]Added 283 Read/Feed constraints in 58 ms returned sat
[2024-05-25 13:56:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 289 ms.
[2024-05-25 13:56:06] [INFO ] Deduced a trap composed of 112 places in 375 ms of which 1 ms to minimize.
[2024-05-25 13:56:06] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 1 ms to minimize.
[2024-05-25 13:56:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1060 ms
[2024-05-25 13:56:07] [INFO ] Added : 4 causal constraints over 3 iterations in 2374 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 68 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 13:56:07] [INFO ] Computed 8 invariants in 15 ms
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 5953 ms. (steps per millisecond=167 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 1) seen :0
[2024-05-25 13:56:15] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:15] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 13:56:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:16] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-25 13:56:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:16] [INFO ] [Nat]Absence check using state equation in 486 ms returned sat
[2024-05-25 13:56:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:16] [INFO ] [Nat]Added 283 Read/Feed constraints in 40 ms returned sat
[2024-05-25 13:56:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 253 ms.
[2024-05-25 13:56:18] [INFO ] Deduced a trap composed of 112 places in 525 ms of which 0 ms to minimize.
[2024-05-25 13:56:18] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 0 ms to minimize.
[2024-05-25 13:56:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1167 ms
[2024-05-25 13:56:19] [INFO ] Added : 4 causal constraints over 3 iterations in 2640 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 47 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 48 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 44 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:56:19] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:19] [INFO ] Invariant cache hit.
[2024-05-25 13:56:20] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-25 13:56:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:20] [INFO ] Invariant cache hit.
[2024-05-25 13:56:20] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:22] [INFO ] Implicit Places using invariants and state equation in 1995 ms returned []
Implicit Place search using SMT with State Equation took 2434 ms to find 0 implicit places.
[2024-05-25 13:56:22] [INFO ] Redundant transitions in 109 ms returned []
[2024-05-25 13:56:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:22] [INFO ] Invariant cache hit.
[2024-05-25 13:56:23] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3621 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-09 in 20108 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-10
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:23] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) 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 13:56:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:23] [INFO ] Computed 8 invariants in 22 ms
[2024-05-25 13:56:23] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:24] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2024-05-25 13:56:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-25 13:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:24] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-25 13:56:24] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2024-05-25 13:56:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 248 ms.
[2024-05-25 13:56:25] [INFO ] Added : 4 causal constraints over 1 iterations in 675 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 68 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 13:56:25] [INFO ] Computed 8 invariants in 16 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 6287 ms. (steps per millisecond=159 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties (out of 1) seen :0
[2024-05-25 13:56:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:33] [INFO ] Computed 8 invariants in 14 ms
[2024-05-25 13:56:33] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:34] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2024-05-25 13:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:35] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-25 13:56:35] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:35] [INFO ] [Nat]Added 283 Read/Feed constraints in 269 ms returned sat
[2024-05-25 13:56:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 270 ms.
[2024-05-25 13:56:36] [INFO ] Added : 4 causal constraints over 1 iterations in 620 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 66 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 66 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 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-25 13:56:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:36] [INFO ] Invariant cache hit.
[2024-05-25 13:56:36] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-25 13:56:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:36] [INFO ] Invariant cache hit.
[2024-05-25 13:56:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:38] [INFO ] Implicit Places using invariants and state equation in 1863 ms returned []
Implicit Place search using SMT with State Equation took 2372 ms to find 0 implicit places.
[2024-05-25 13:56:38] [INFO ] Redundant transitions in 152 ms returned []
[2024-05-25 13:56:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:56:38] [INFO ] Invariant cache hit.
[2024-05-25 13:56:39] [INFO ] Dead Transitions using invariants and state equation in 959 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3558 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-10 in 16491 ms.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-13
Normalized transition count is 3699 out of 3871 initially.
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:39] [INFO ] Computed 8 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 13:56:39] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:40] [INFO ] Computed 8 invariants in 24 ms
[2024-05-25 13:56:40] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-25 13:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:40] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-05-25 13:56:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:41] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2024-05-25 13:56:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:41] [INFO ] [Nat]Added 283 Read/Feed constraints in 316 ms returned sat
[2024-05-25 13:56:42] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 0 ms to minimize.
[2024-05-25 13:56:42] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 0 ms to minimize.
[2024-05-25 13:56:43] [INFO ] Deduced a trap composed of 99 places in 395 ms of which 1 ms to minimize.
[2024-05-25 13:56:43] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 0 ms to minimize.
[2024-05-25 13:56:44] [INFO ] Deduced a trap composed of 91 places in 417 ms of which 1 ms to minimize.
[2024-05-25 13:56:44] [INFO ] Deduced a trap composed of 95 places in 449 ms of which 0 ms to minimize.
[2024-05-25 13:56:45] [INFO ] Deduced a trap composed of 76 places in 344 ms of which 1 ms to minimize.
[2024-05-25 13:56:45] [INFO ] Deduced a trap composed of 44 places in 387 ms of which 0 ms to minimize.
[2024-05-25 13:56:45] [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: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 45 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 46 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 13:56:45] [INFO ] Computed 8 invariants in 22 ms
Incomplete random walk after 1000000 steps, including 3 resets, run finished after 5814 ms. (steps per millisecond=171 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3 resets, run finished after 2083 ms. (steps per millisecond=480 ) properties (out of 1) seen :0
[2024-05-25 13:56:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-25 13:56:53] [INFO ] Computed 8 invariants in 17 ms
[2024-05-25 13:56:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-25 13:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:54] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-05-25 13:56:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 13:56:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-25 13:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 13:56:55] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-25 13:56:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:56:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 281 ms returned sat
[2024-05-25 13:56:56] [INFO ] Deduced a trap composed of 31 places in 556 ms of which 1 ms to minimize.
[2024-05-25 13:56:56] [INFO ] Deduced a trap composed of 28 places in 433 ms of which 0 ms to minimize.
[2024-05-25 13:56:57] [INFO ] Deduced a trap composed of 99 places in 443 ms of which 1 ms to minimize.
[2024-05-25 13:56:57] [INFO ] Deduced a trap composed of 39 places in 440 ms of which 1 ms to minimize.
[2024-05-25 13:56:58] [INFO ] Deduced a trap composed of 91 places in 424 ms of which 1 ms to minimize.
[2024-05-25 13:56:58] [INFO ] Deduced a trap composed of 95 places in 428 ms of which 0 ms to minimize.
[2024-05-25 13:56:59] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 1 ms to minimize.
[2024-05-25 13:56:59] [INFO ] Deduced a trap composed of 44 places in 353 ms of which 1 ms to minimize.
[2024-05-25 13:57:00] [INFO ] Deduced a trap composed of 68 places in 341 ms of which 0 ms to minimize.
[2024-05-25 13:57:00] [INFO ] Deduced a trap composed of 23 places in 411 ms of which 1 ms to minimize.
[2024-05-25 13:57:01] [INFO ] Deduced a trap composed of 47 places in 316 ms of which 0 ms to minimize.
[2024-05-25 13:57:01] [INFO ] Deduced a trap composed of 62 places in 342 ms of which 0 ms to minimize.
[2024-05-25 13:57:02] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 0 ms to minimize.
[2024-05-25 13:57:02] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 1 ms to minimize.
[2024-05-25 13:57:02] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7529 ms
[2024-05-25 13:57:03] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 342 ms.
[2024-05-25 13:57:04] [INFO ] Deduced a trap composed of 54 places in 426 ms of which 1 ms to minimize.
[2024-05-25 13:57:04] [INFO ] Deduced a trap composed of 69 places in 415 ms of which 0 ms to minimize.
[2024-05-25 13:57:05] [INFO ] Deduced a trap composed of 36 places in 544 ms of which 1 ms to minimize.
[2024-05-25 13:57:06] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 0 ms to minimize.
[2024-05-25 13:57:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2554 ms
[2024-05-25 13:57:06] [INFO ] Added : 8 causal constraints over 3 iterations in 3884 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 66 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 66 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 13:57:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:57:07] [INFO ] Invariant cache hit.
[2024-05-25 13:57:07] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-25 13:57:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:57:07] [INFO ] Invariant cache hit.
[2024-05-25 13:57:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-25 13:57:09] [INFO ] Implicit Places using invariants and state equation in 1982 ms returned []
Implicit Place search using SMT with State Equation took 2488 ms to find 0 implicit places.
[2024-05-25 13:57:09] [INFO ] Redundant transitions in 188 ms returned []
[2024-05-25 13:57:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-25 13:57:09] [INFO ] Invariant cache hit.
[2024-05-25 13:57:10] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3799 ms. Remains : 269/269 places, 3871/3871 transitions.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-13 in 30959 ms.
[2024-05-25 13:57:11] [INFO ] Flatten gal took : 314 ms
[2024-05-25 13:57:11] [INFO ] Applying decomposition
[2024-05-25 13:57:11] [INFO ] Flatten gal took : 188 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/graph879948554042323423.txt' '-o' '/tmp/graph879948554042323423.bin' '-w' '/tmp/graph879948554042323423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph879948554042323423.bin' '-l' '-1' '-v' '-w' '/tmp/graph879948554042323423.weights' '-q' '0' '-e' '0.001'
[2024-05-25 13:57:12] [INFO ] Decomposing Gal with order
[2024-05-25 13:57:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 13:57:12] [INFO ] Removed a total of 424 redundant transitions.
[2024-05-25 13:57:12] [INFO ] Flatten gal took : 388 ms
[2024-05-25 13:57:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 27 ms.
[2024-05-25 13:57:12] [INFO ] Time to serialize gal into /tmp/UpperBounds3910238112273878309.gal : 61 ms
[2024-05-25 13:57:12] [INFO ] Time to serialize properties into /tmp/UpperBounds3818754452821000499.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/UpperBounds3910238112273878309.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3818754452821000499.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/UpperBounds3818754452821000499.prop.
Detected timeout of ITS tools.
[2024-05-25 14:18:36] [INFO ] Flatten gal took : 3070 ms
[2024-05-25 14:18:36] [INFO ] Time to serialize gal into /tmp/UpperBounds15293367585651758403.gal : 97 ms
[2024-05-25 14:18:36] [INFO ] Time to serialize properties into /tmp/UpperBounds8220954570423650637.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/UpperBounds15293367585651758403.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8220954570423650637.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/UpperBounds8220954570423650637.prop.
Detected timeout of ITS tools.
[2024-05-25 14:39:52] [INFO ] Flatten gal took : 694 ms
[2024-05-25 14:39:53] [INFO ] Input system was already deterministic with 3871 transitions.
[2024-05-25 14:39:53] [INFO ] Transformed 269 places.
[2024-05-25 14:39:53] [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 14:39:53] [INFO ] Time to serialize gal into /tmp/UpperBounds12707560474268332674.gal : 18 ms
[2024-05-25 14:39:53] [INFO ] Time to serialize properties into /tmp/UpperBounds5749939535532776223.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/UpperBounds12707560474268332674.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5749939535532776223.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/UpperBounds5749939535532776223.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 4945136 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16112592 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-q8m004"
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-q8m004, 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-171620414700246"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 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 ;