About the Execution of 2023-gold for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9501.035 | 1973403.00 | 2030205.00 | 409.70 | 2 2 6 1 1 5 1 1 1 1 1 0 1 1 1 1 | 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.r307-tajo-171654460500151.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 PolyORBLF-PT-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460500151
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 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 PolyORBLF-PT-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717116301188
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=PolyORBLF-PT-S02J06T06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 00:45:03] [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-31 00:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 00:45:03] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2024-05-31 00:45:03] [INFO ] Transformed 536 places.
[2024-05-31 00:45:03] [INFO ] Transformed 1064 transitions.
[2024-05-31 00:45:03] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 956 out of 968 initially.
// Phase 1: matrix 956 rows 536 cols
[2024-05-31 00:45:03] [INFO ] Computed 50 invariants in 78 ms
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 15) seen :22
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :18
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :17
[2024-05-31 00:45:04] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2024-05-31 00:45:04] [INFO ] Computed 50 invariants in 30 ms
[2024-05-31 00:45:05] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:45:05] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2024-05-31 00:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:05] [INFO ] [Real]Absence check using state equation in 824 ms returned sat
[2024-05-31 00:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:45:06] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 49 ms returned sat
[2024-05-31 00:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:11] [INFO ] [Nat]Absence check using state equation in 4854 ms returned unknown
[2024-05-31 00:45:11] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:45:11] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 25 ms returned sat
[2024-05-31 00:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:11] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2024-05-31 00:45:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:12] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 24 ms returned sat
[2024-05-31 00:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:13] [INFO ] [Nat]Absence check using state equation in 1170 ms returned sat
[2024-05-31 00:45:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:45:14] [INFO ] [Nat]Added 72 Read/Feed constraints in 1172 ms returned sat
[2024-05-31 00:45:14] [INFO ] Deduced a trap composed of 15 places in 336 ms of which 5 ms to minimize.
[2024-05-31 00:45:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 931 ms
[2024-05-31 00:45:15] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 196 ms.
[2024-05-31 00:45:17] [INFO ] Added : 40 causal constraints over 8 iterations in 1612 ms. Result :unknown
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 14 ms returned unsat
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:45:17] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2024-05-31 00:45:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:18] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2024-05-31 00:45:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:18] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2024-05-31 00:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:18] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2024-05-31 00:45:19] [INFO ] [Nat]Added 72 Read/Feed constraints in 245 ms returned sat
[2024-05-31 00:45:19] [INFO ] Deduced a trap composed of 116 places in 396 ms of which 2 ms to minimize.
[2024-05-31 00:45:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 435 ms
[2024-05-31 00:45:19] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:19] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2024-05-31 00:45:19] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:45:19] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2024-05-31 00:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:20] [INFO ] [Real]Absence check using state equation in 1079 ms returned sat
[2024-05-31 00:45:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 00:45:21] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 37 ms returned sat
[2024-05-31 00:45:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:22] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2024-05-31 00:45:23] [INFO ] [Nat]Added 72 Read/Feed constraints in 802 ms returned sat
[2024-05-31 00:45:23] [INFO ] Deduced a trap composed of 67 places in 233 ms of which 2 ms to minimize.
[2024-05-31 00:45:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 274 ms
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 12 ms returned unsat
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned unsat
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2024-05-31 00:45:23] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2024-05-31 00:45:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:24] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2024-05-31 00:45:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:24] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:45:24] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2024-05-31 00:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:26] [INFO ] [Nat]Absence check using state equation in 1890 ms returned sat
[2024-05-31 00:45:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 640 ms returned sat
[2024-05-31 00:45:27] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 2 ms to minimize.
[2024-05-31 00:45:27] [INFO ] Deduced a trap composed of 252 places in 311 ms of which 1 ms to minimize.
[2024-05-31 00:45:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1170 ms
[2024-05-31 00:45:28] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 102 ms.
[2024-05-31 00:45:29] [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 9
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.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-31 00:45:29] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:29] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2024-05-31 00:45:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:30] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2024-05-31 00:45:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:30] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:30] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 21 ms returned sat
[2024-05-31 00:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:32] [INFO ] [Nat]Absence check using state equation in 2399 ms returned sat
[2024-05-31 00:45:33] [INFO ] [Nat]Added 72 Read/Feed constraints in 424 ms returned sat
[2024-05-31 00:45:33] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2024-05-31 00:45:33] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 0 ms to minimize.
[2024-05-31 00:45:34] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 1 ms to minimize.
[2024-05-31 00:45:35] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2040 ms
Current structural bounds on expressions (after SMT) : [-1, 798, 6, 1, 5, 1, 1, 1, 1, 3, 46] Max seen :[2, 2, 6, 1, 5, 1, 1, 1, 1, 0, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 14 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 534 transition count 921
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 487 transition count 921
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 96 place count 487 transition count 861
Deduced a syphon composed of 60 places in 5 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 216 place count 427 transition count 861
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 5 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 298 place count 386 transition count 820
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 304 place count 386 transition count 814
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 310 place count 380 transition count 814
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 311 place count 380 transition count 814
Applied a total of 311 rules in 228 ms. Remains 380 /536 variables (removed 156) and now considering 814/968 (removed 154) transitions.
[2024-05-31 00:45:36] [INFO ] Flow matrix only has 802 transitions (discarded 12 similar events)
// Phase 1: matrix 802 rows 380 cols
[2024-05-31 00:45:36] [INFO ] Computed 48 invariants in 12 ms
[2024-05-31 00:45:37] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 380/536 places, 748/968 transitions.
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 379 transition count 736
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 13 place count 367 transition count 724
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 13 rules in 34 ms. Remains 367 /380 variables (removed 13) and now considering 724/748 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1037 ms. Remains : 367/536 places, 724/968 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 712 out of 724 initially.
// Phase 1: matrix 712 rows 366 cols
[2024-05-31 00:45:37] [INFO ] Computed 48 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 437 resets, run finished after 3553 ms. (steps per millisecond=281 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 169 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 200 resets, run finished after 1614 ms. (steps per millisecond=619 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 3) seen :5
[2024-05-31 00:45:44] [INFO ] Flow matrix only has 712 transitions (discarded 12 similar events)
// Phase 1: matrix 712 rows 366 cols
[2024-05-31 00:45:44] [INFO ] Computed 48 invariants in 34 ms
[2024-05-31 00:45:44] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned sat
[2024-05-31 00:45:45] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 19 ms returned unsat
[2024-05-31 00:45:45] [INFO ] [Real]Absence check using 14 positive place invariants in 31 ms returned sat
[2024-05-31 00:45:45] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 5 ms returned unsat
[2024-05-31 00:45:45] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2024-05-31 00:45:45] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 19 ms returned sat
[2024-05-31 00:45:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:46] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2024-05-31 00:45:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:45:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2024-05-31 00:45:46] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 11 ms returned sat
[2024-05-31 00:45:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:45:47] [INFO ] [Nat]Absence check using state equation in 842 ms returned sat
[2024-05-31 00:45:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:45:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 188 ms returned sat
[2024-05-31 00:45:47] [INFO ] Deduced a trap composed of 46 places in 82 ms of which 1 ms to minimize.
[2024-05-31 00:45:47] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-31 00:45:47] [INFO ] Deduced a trap composed of 88 places in 305 ms of which 1 ms to minimize.
[2024-05-31 00:45:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 622 ms
[2024-05-31 00:45:47] [INFO ] Computed and/alt/rep : 476/2076/470 causal constraints (skipped 240 transitions) in 70 ms.
[2024-05-31 00:45:51] [INFO ] Deduced a trap composed of 118 places in 246 ms of which 1 ms to minimize.
[2024-05-31 00:45:51] [INFO ] Deduced a trap composed of 151 places in 316 ms of which 1 ms to minimize.
[2024-05-31 00:45:52] [INFO ] Deduced a trap composed of 133 places in 266 ms of which 2 ms to minimize.
[2024-05-31 00:45:52] [INFO ] Deduced a trap composed of 141 places in 237 ms of which 1 ms to minimize.
[2024-05-31 00:45:52] [INFO ] Deduced a trap composed of 152 places in 243 ms of which 1 ms to minimize.
[2024-05-31 00:45:53] [INFO ] Deduced a trap composed of 114 places in 248 ms of which 0 ms to minimize.
[2024-05-31 00:45:53] [INFO ] Deduced a trap composed of 138 places in 211 ms of which 0 ms to minimize.
[2024-05-31 00:45:54] [INFO ] Deduced a trap composed of 91 places in 237 ms of which 0 ms to minimize.
[2024-05-31 00:45:54] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 1 ms to minimize.
[2024-05-31 00:45:54] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 1 ms to minimize.
[2024-05-31 00:45:55] [INFO ] Deduced a trap composed of 69 places in 253 ms of which 1 ms to minimize.
[2024-05-31 00:45:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3906 ms
[2024-05-31 00:45:55] [INFO ] Added : 301 causal constraints over 61 iterations in 7432 ms. Result :sat
Minimization took 1515 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 3, 46] Max seen :[2, 2, 1, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 724/724 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 366 transition count 718
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 360 transition count 718
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 354 transition count 712
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 354 transition count 706
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 36 place count 348 transition count 706
Applied a total of 36 rules in 45 ms. Remains 348 /366 variables (removed 18) and now considering 706/724 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 348/366 places, 706/724 transitions.
Normalized transition count is 694 out of 706 initially.
// Phase 1: matrix 694 rows 348 cols
[2024-05-31 00:45:57] [INFO ] Computed 48 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 554 resets, run finished after 3241 ms. (steps per millisecond=308 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 1) seen :1
[2024-05-31 00:46:01] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
// Phase 1: matrix 694 rows 348 cols
[2024-05-31 00:46:01] [INFO ] Computed 48 invariants in 25 ms
[2024-05-31 00:46:01] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-31 00:46:01] [INFO ] [Real]Absence check using 19 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-31 00:46:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:02] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2024-05-31 00:46:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:46:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-31 00:46:02] [INFO ] [Nat]Absence check using 19 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-31 00:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:04] [INFO ] [Nat]Absence check using state equation in 1792 ms returned sat
[2024-05-31 00:46:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:46:04] [INFO ] [Nat]Added 72 Read/Feed constraints in 318 ms returned sat
[2024-05-31 00:46:04] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-31 00:46:04] [INFO ] Deduced a trap composed of 127 places in 121 ms of which 1 ms to minimize.
[2024-05-31 00:46:05] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 0 ms to minimize.
[2024-05-31 00:46:05] [INFO ] Deduced a trap composed of 132 places in 162 ms of which 1 ms to minimize.
[2024-05-31 00:46:05] [INFO ] Deduced a trap composed of 119 places in 164 ms of which 1 ms to minimize.
[2024-05-31 00:46:05] [INFO ] Deduced a trap composed of 145 places in 169 ms of which 1 ms to minimize.
[2024-05-31 00:46:06] [INFO ] Deduced a trap composed of 146 places in 181 ms of which 1 ms to minimize.
[2024-05-31 00:46:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1661 ms
[2024-05-31 00:46:06] [INFO ] Computed and/alt/rep : 422/1902/416 causal constraints (skipped 276 transitions) in 76 ms.
[2024-05-31 00:46:08] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-31 00:46:09] [INFO ] Deduced a trap composed of 118 places in 246 ms of which 0 ms to minimize.
[2024-05-31 00:46:09] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 0 ms to minimize.
[2024-05-31 00:46:09] [INFO ] Deduced a trap composed of 68 places in 229 ms of which 1 ms to minimize.
[2024-05-31 00:46:10] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 2 ms to minimize.
[2024-05-31 00:46:10] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 3 ms to minimize.
[2024-05-31 00:46:10] [INFO ] Deduced a trap composed of 62 places in 215 ms of which 1 ms to minimize.
[2024-05-31 00:46:10] [INFO ] Deduced a trap composed of 71 places in 193 ms of which 0 ms to minimize.
[2024-05-31 00:46:11] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 1 ms to minimize.
[2024-05-31 00:46:11] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 0 ms to minimize.
[2024-05-31 00:46:11] [INFO ] Deduced a trap composed of 80 places in 178 ms of which 1 ms to minimize.
[2024-05-31 00:46:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3339 ms
[2024-05-31 00:46:12] [INFO ] Added : 150 causal constraints over 31 iterations in 5932 ms. Result :sat
Minimization took 718 ms.
Current structural bounds on expressions (after SMT) : [3, 46] Max seen :[1, 1]
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 706/706 transitions.
Applied a total of 0 rules in 23 ms. Remains 348 /348 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 348/348 places, 706/706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 706/706 transitions.
Applied a total of 0 rules in 13 ms. Remains 348 /348 variables (removed 0) and now considering 706/706 (removed 0) transitions.
[2024-05-31 00:46:13] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
[2024-05-31 00:46:13] [INFO ] Invariant cache hit.
[2024-05-31 00:46:15] [INFO ] Implicit Places using invariants in 1796 ms returned [69, 76, 153, 163, 198, 327]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1799 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 342/348 places, 706/706 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 339 transition count 703
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 339 transition count 703
Applied a total of 6 rules in 30 ms. Remains 339 /342 variables (removed 3) and now considering 703/706 (removed 3) transitions.
[2024-05-31 00:46:15] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:15] [INFO ] Computed 42 invariants in 9 ms
[2024-05-31 00:46:15] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-31 00:46:15] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:46:15] [INFO ] Invariant cache hit.
[2024-05-31 00:46:16] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:46:19] [INFO ] Implicit Places using invariants and state equation in 3376 ms returned []
Implicit Place search using SMT with State Equation took 3783 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 339/348 places, 703/706 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5628 ms. Remains : 339/348 places, 703/706 transitions.
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:19] [INFO ] Computed 42 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 543 resets, run finished after 3105 ms. (steps per millisecond=322 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 1) seen :1
[2024-05-31 00:46:23] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:23] [INFO ] Computed 42 invariants in 29 ms
[2024-05-31 00:46:23] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-31 00:46:23] [INFO ] [Real]Absence check using 20 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-31 00:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:24] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2024-05-31 00:46:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:46:24] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-31 00:46:24] [INFO ] [Nat]Absence check using 20 positive and 22 generalized place invariants in 12 ms returned sat
[2024-05-31 00:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:26] [INFO ] [Nat]Absence check using state equation in 1686 ms returned sat
[2024-05-31 00:46:26] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:46:26] [INFO ] [Nat]Added 72 Read/Feed constraints in 615 ms returned sat
[2024-05-31 00:46:26] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 1 ms to minimize.
[2024-05-31 00:46:26] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-31 00:46:27] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 0 ms to minimize.
[2024-05-31 00:46:27] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 1 ms to minimize.
[2024-05-31 00:46:27] [INFO ] Deduced a trap composed of 79 places in 189 ms of which 0 ms to minimize.
[2024-05-31 00:46:28] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 0 ms to minimize.
[2024-05-31 00:46:28] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 0 ms to minimize.
[2024-05-31 00:46:28] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 0 ms to minimize.
[2024-05-31 00:46:28] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 0 ms to minimize.
[2024-05-31 00:46:29] [INFO ] Deduced a trap composed of 51 places in 207 ms of which 1 ms to minimize.
[2024-05-31 00:46:29] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 3 ms to minimize.
[2024-05-31 00:46:29] [INFO ] Deduced a trap composed of 151 places in 242 ms of which 2 ms to minimize.
[2024-05-31 00:46:30] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 0 ms to minimize.
[2024-05-31 00:46:30] [INFO ] Deduced a trap composed of 114 places in 205 ms of which 1 ms to minimize.
[2024-05-31 00:46:30] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 1 ms to minimize.
[2024-05-31 00:46:30] [INFO ] Deduced a trap composed of 151 places in 164 ms of which 0 ms to minimize.
[2024-05-31 00:46:30] [INFO ] Deduced a trap composed of 75 places in 204 ms of which 7 ms to minimize.
[2024-05-31 00:46:31] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 1 ms to minimize.
[2024-05-31 00:46:31] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 0 ms to minimize.
[2024-05-31 00:46:31] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 1 ms to minimize.
[2024-05-31 00:46:31] [INFO ] Deduced a trap composed of 116 places in 216 ms of which 1 ms to minimize.
[2024-05-31 00:46:32] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 1 ms to minimize.
[2024-05-31 00:46:32] [INFO ] Deduced a trap composed of 87 places in 208 ms of which 0 ms to minimize.
[2024-05-31 00:46:32] [INFO ] Deduced a trap composed of 139 places in 167 ms of which 0 ms to minimize.
[2024-05-31 00:46:32] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 1 ms to minimize.
[2024-05-31 00:46:33] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 0 ms to minimize.
[2024-05-31 00:46:33] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 1 ms to minimize.
[2024-05-31 00:46:33] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 2 ms to minimize.
[2024-05-31 00:46:33] [INFO ] Deduced a trap composed of 61 places in 207 ms of which 5 ms to minimize.
[2024-05-31 00:46:34] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 0 ms to minimize.
[2024-05-31 00:46:34] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 1 ms to minimize.
[2024-05-31 00:46:34] [INFO ] Deduced a trap composed of 174 places in 164 ms of which 0 ms to minimize.
[2024-05-31 00:46:34] [INFO ] Deduced a trap composed of 139 places in 209 ms of which 0 ms to minimize.
[2024-05-31 00:46:35] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 1 ms to minimize.
[2024-05-31 00:46:35] [INFO ] Deduced a trap composed of 82 places in 170 ms of which 1 ms to minimize.
[2024-05-31 00:46:35] [INFO ] Deduced a trap composed of 72 places in 181 ms of which 1 ms to minimize.
[2024-05-31 00:46:35] [INFO ] Deduced a trap composed of 68 places in 220 ms of which 0 ms to minimize.
[2024-05-31 00:46:36] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 0 ms to minimize.
[2024-05-31 00:46:36] [INFO ] Deduced a trap composed of 86 places in 198 ms of which 0 ms to minimize.
[2024-05-31 00:46:36] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 0 ms to minimize.
[2024-05-31 00:46:37] [INFO ] Deduced a trap composed of 65 places in 207 ms of which 1 ms to minimize.
[2024-05-31 00:46:37] [INFO ] Deduced a trap composed of 131 places in 298 ms of which 1 ms to minimize.
[2024-05-31 00:46:37] [INFO ] Deduced a trap composed of 109 places in 220 ms of which 1 ms to minimize.
[2024-05-31 00:46:38] [INFO ] Deduced a trap composed of 109 places in 192 ms of which 1 ms to minimize.
[2024-05-31 00:46:38] [INFO ] Deduced a trap composed of 143 places in 191 ms of which 1 ms to minimize.
[2024-05-31 00:46:38] [INFO ] Deduced a trap composed of 135 places in 209 ms of which 0 ms to minimize.
[2024-05-31 00:46:38] [INFO ] Deduced a trap composed of 147 places in 203 ms of which 0 ms to minimize.
[2024-05-31 00:46:39] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 0 ms to minimize.
[2024-05-31 00:46:39] [INFO ] Deduced a trap composed of 83 places in 254 ms of which 1 ms to minimize.
[2024-05-31 00:46:40] [INFO ] Deduced a trap composed of 74 places in 218 ms of which 1 ms to minimize.
[2024-05-31 00:46:40] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 13557 ms
[2024-05-31 00:46:40] [INFO ] Computed and/alt/rep : 419/1898/413 causal constraints (skipped 276 transitions) in 55 ms.
[2024-05-31 00:46:43] [INFO ] Deduced a trap composed of 75 places in 287 ms of which 1 ms to minimize.
[2024-05-31 00:46:43] [INFO ] Deduced a trap composed of 83 places in 314 ms of which 1 ms to minimize.
[2024-05-31 00:46:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 904 ms
[2024-05-31 00:46:43] [INFO ] Added : 178 causal constraints over 36 iterations in 3455 ms. Result :sat
Minimization took 1023 ms.
Current structural bounds on expressions (after SMT) : [3, 46] Max seen :[1, 1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 19 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 339/339 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 16 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2024-05-31 00:46:45] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:46:45] [INFO ] Invariant cache hit.
[2024-05-31 00:46:45] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-31 00:46:45] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:46:45] [INFO ] Invariant cache hit.
[2024-05-31 00:46:45] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:46:50] [INFO ] Implicit Places using invariants and state equation in 4442 ms returned []
Implicit Place search using SMT with State Equation took 4773 ms to find 0 implicit places.
[2024-05-31 00:46:50] [INFO ] Redundant transitions in 60 ms returned []
[2024-05-31 00:46:50] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:46:50] [INFO ] Invariant cache hit.
[2024-05-31 00:46:50] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5278 ms. Remains : 339/339 places, 703/703 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-14
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:50] [INFO ] Computed 42 invariants in 16 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :1
[2024-05-31 00:46:50] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:50] [INFO ] Computed 42 invariants in 8 ms
[2024-05-31 00:46:50] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-31 00:46:50] [INFO ] [Real]Absence check using 20 positive and 22 generalized place invariants in 13 ms returned sat
[2024-05-31 00:46:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:51] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2024-05-31 00:46:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:46:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-05-31 00:46:51] [INFO ] [Nat]Absence check using 20 positive and 22 generalized place invariants in 8 ms returned sat
[2024-05-31 00:46:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:46:53] [INFO ] [Nat]Absence check using state equation in 1937 ms returned sat
[2024-05-31 00:46:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:46:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 604 ms returned sat
[2024-05-31 00:46:54] [INFO ] Deduced a trap composed of 43 places in 323 ms of which 1 ms to minimize.
[2024-05-31 00:46:54] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 7 ms to minimize.
[2024-05-31 00:46:55] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 2 ms to minimize.
[2024-05-31 00:46:55] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 0 ms to minimize.
[2024-05-31 00:46:55] [INFO ] Deduced a trap composed of 79 places in 226 ms of which 1 ms to minimize.
[2024-05-31 00:46:56] [INFO ] Deduced a trap composed of 66 places in 244 ms of which 1 ms to minimize.
[2024-05-31 00:46:56] [INFO ] Deduced a trap composed of 84 places in 200 ms of which 0 ms to minimize.
[2024-05-31 00:46:56] [INFO ] Deduced a trap composed of 86 places in 309 ms of which 0 ms to minimize.
[2024-05-31 00:46:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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) : [52] Max seen :[1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 17 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2024-05-31 00:46:56] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:46:56] [INFO ] Invariant cache hit.
[2024-05-31 00:46:57] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 894 ms. Remains : 339/339 places, 703/703 transitions.
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:46:57] [INFO ] Computed 42 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 534 resets, run finished after 3158 ms. (steps per millisecond=316 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :1
[2024-05-31 00:47:02] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2024-05-31 00:47:02] [INFO ] Computed 42 invariants in 27 ms
[2024-05-31 00:47:02] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2024-05-31 00:47:02] [INFO ] [Real]Absence check using 20 positive and 22 generalized place invariants in 27 ms returned sat
[2024-05-31 00:47:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 00:47:02] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2024-05-31 00:47:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 00:47:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-31 00:47:02] [INFO ] [Nat]Absence check using 20 positive and 22 generalized place invariants in 13 ms returned sat
[2024-05-31 00:47:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 00:47:04] [INFO ] [Nat]Absence check using state equation in 1651 ms returned sat
[2024-05-31 00:47:04] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:47:05] [INFO ] [Nat]Added 72 Read/Feed constraints in 581 ms returned sat
[2024-05-31 00:47:05] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 1 ms to minimize.
[2024-05-31 00:47:05] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-31 00:47:05] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2024-05-31 00:47:05] [INFO ] Deduced a trap composed of 84 places in 176 ms of which 1 ms to minimize.
[2024-05-31 00:47:06] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 1 ms to minimize.
[2024-05-31 00:47:06] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 0 ms to minimize.
[2024-05-31 00:47:06] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 1 ms to minimize.
[2024-05-31 00:47:06] [INFO ] Deduced a trap composed of 86 places in 232 ms of which 0 ms to minimize.
[2024-05-31 00:47:07] [INFO ] Deduced a trap composed of 52 places in 309 ms of which 1 ms to minimize.
[2024-05-31 00:47:07] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 1 ms to minimize.
[2024-05-31 00:47:07] [INFO ] Deduced a trap composed of 165 places in 215 ms of which 1 ms to minimize.
[2024-05-31 00:47:08] [INFO ] Deduced a trap composed of 151 places in 206 ms of which 0 ms to minimize.
[2024-05-31 00:47:08] [INFO ] Deduced a trap composed of 144 places in 176 ms of which 1 ms to minimize.
[2024-05-31 00:47:08] [INFO ] Deduced a trap composed of 114 places in 237 ms of which 1 ms to minimize.
[2024-05-31 00:47:08] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 0 ms to minimize.
[2024-05-31 00:47:09] [INFO ] Deduced a trap composed of 151 places in 294 ms of which 1 ms to minimize.
[2024-05-31 00:47:09] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 1 ms to minimize.
[2024-05-31 00:47:09] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 0 ms to minimize.
[2024-05-31 00:47:09] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 1 ms to minimize.
[2024-05-31 00:47:10] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 1 ms to minimize.
[2024-05-31 00:47:10] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 0 ms to minimize.
[2024-05-31 00:47:10] [INFO ] Deduced a trap composed of 100 places in 150 ms of which 1 ms to minimize.
[2024-05-31 00:47:10] [INFO ] Deduced a trap composed of 87 places in 180 ms of which 14 ms to minimize.
[2024-05-31 00:47:11] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 0 ms to minimize.
[2024-05-31 00:47:11] [INFO ] Deduced a trap composed of 87 places in 217 ms of which 0 ms to minimize.
[2024-05-31 00:47:11] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 0 ms to minimize.
[2024-05-31 00:47:12] [INFO ] Deduced a trap composed of 68 places in 298 ms of which 1 ms to minimize.
[2024-05-31 00:47:12] [INFO ] Deduced a trap composed of 75 places in 330 ms of which 1 ms to minimize.
[2024-05-31 00:47:12] [INFO ] Deduced a trap composed of 61 places in 314 ms of which 1 ms to minimize.
[2024-05-31 00:47:13] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 1 ms to minimize.
[2024-05-31 00:47:13] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 1 ms to minimize.
[2024-05-31 00:47:13] [INFO ] Deduced a trap composed of 174 places in 216 ms of which 0 ms to minimize.
[2024-05-31 00:47:14] [INFO ] Deduced a trap composed of 139 places in 245 ms of which 1 ms to minimize.
[2024-05-31 00:47:14] [INFO ] Deduced a trap composed of 98 places in 183 ms of which 0 ms to minimize.
[2024-05-31 00:47:14] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 1 ms to minimize.
[2024-05-31 00:47:14] [INFO ] Deduced a trap composed of 72 places in 199 ms of which 1 ms to minimize.
[2024-05-31 00:47:14] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 1 ms to minimize.
[2024-05-31 00:47:15] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 0 ms to minimize.
[2024-05-31 00:47:15] [INFO ] Deduced a trap composed of 86 places in 311 ms of which 0 ms to minimize.
[2024-05-31 00:47:16] [INFO ] Deduced a trap composed of 78 places in 260 ms of which 1 ms to minimize.
[2024-05-31 00:47:16] [INFO ] Deduced a trap composed of 65 places in 297 ms of which 1 ms to minimize.
[2024-05-31 00:47:17] [INFO ] Deduced a trap composed of 131 places in 318 ms of which 2 ms to minimize.
[2024-05-31 00:47:17] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 2 ms to minimize.
[2024-05-31 00:47:17] [INFO ] Deduced a trap composed of 109 places in 166 ms of which 1 ms to minimize.
[2024-05-31 00:47:17] [INFO ] Deduced a trap composed of 143 places in 184 ms of which 1 ms to minimize.
[2024-05-31 00:47:18] [INFO ] Deduced a trap composed of 135 places in 201 ms of which 1 ms to minimize.
[2024-05-31 00:47:18] [INFO ] Deduced a trap composed of 147 places in 220 ms of which 0 ms to minimize.
[2024-05-31 00:47:18] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 0 ms to minimize.
[2024-05-31 00:47:18] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 0 ms to minimize.
[2024-05-31 00:47:19] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 0 ms to minimize.
[2024-05-31 00:47:19] [INFO ] Trap strengthening (SAT) tested/added 51/50 trap constraints in 14278 ms
[2024-05-31 00:47:19] [INFO ] Computed and/alt/rep : 419/1898/413 causal constraints (skipped 276 transitions) in 48 ms.
[2024-05-31 00:47:21] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 0 ms to minimize.
[2024-05-31 00:47:21] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 1 ms to minimize.
[2024-05-31 00:47:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 667 ms
[2024-05-31 00:47:22] [INFO ] Added : 178 causal constraints over 36 iterations in 2719 ms. Result :sat
Minimization took 882 ms.
Current structural bounds on expressions (after SMT) : [52] Max seen :[1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 32 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 339/339 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 32 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2024-05-31 00:47:23] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:47:23] [INFO ] Invariant cache hit.
[2024-05-31 00:47:24] [INFO ] Implicit Places using invariants in 510 ms returned []
[2024-05-31 00:47:24] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:47:24] [INFO ] Invariant cache hit.
[2024-05-31 00:47:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-31 00:47:30] [INFO ] Implicit Places using invariants and state equation in 6667 ms returned []
Implicit Place search using SMT with State Equation took 7179 ms to find 0 implicit places.
[2024-05-31 00:47:30] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-31 00:47:30] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2024-05-31 00:47:30] [INFO ] Invariant cache hit.
[2024-05-31 00:47:31] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7666 ms. Remains : 339/339 places, 703/703 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-14 in 40574 ms.
[2024-05-31 00:47:31] [INFO ] Flatten gal took : 171 ms
[2024-05-31 00:47:31] [INFO ] Applying decomposition
[2024-05-31 00:47:31] [INFO ] Flatten gal took : 95 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/graph135348440127741395.txt' '-o' '/tmp/graph135348440127741395.bin' '-w' '/tmp/graph135348440127741395.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph135348440127741395.bin' '-l' '-1' '-v' '-w' '/tmp/graph135348440127741395.weights' '-q' '0' '-e' '0.001'
[2024-05-31 00:47:32] [INFO ] Decomposing Gal with order
[2024-05-31 00:47:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 00:47:32] [INFO ] Removed a total of 565 redundant transitions.
[2024-05-31 00:47:32] [INFO ] Flatten gal took : 424 ms
[2024-05-31 00:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 496 labels/synchronizations in 65 ms.
[2024-05-31 00:47:32] [INFO ] Time to serialize gal into /tmp/UpperBounds9450639493450714097.gal : 37 ms
[2024-05-31 00:47:32] [INFO ] Time to serialize properties into /tmp/UpperBounds1749238901221510522.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9450639493450714097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1749238901221510522.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/UpperBounds1749238901221510522.prop.
Detected timeout of ITS tools.
[2024-05-31 01:08:22] [INFO ] Flatten gal took : 40 ms
[2024-05-31 01:08:22] [INFO ] Time to serialize gal into /tmp/UpperBounds58529939161733231.gal : 8 ms
[2024-05-31 01:08:22] [INFO ] Time to serialize properties into /tmp/UpperBounds6690275868502850387.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds58529939161733231.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6690275868502850387.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 ...302
Loading property file /tmp/UpperBounds6690275868502850387.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.734e+07,571.512,7397344,2,688628,5,7.90622e+06,6,0,2071,1.1877e+07,0
Total reachable state count : 17340048
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property PolyORBLF-PT-S02J06T06-UpperBounds-14 :0 <= RunB_3 <= 1
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
PolyORBLF-PT-S02J06T06-UpperBounds-14,0,571.724,7397344,1,0,7,7.90622e+06,9,1,2553,1.1877e+07,4
Total runtime 1970916 ms.
BK_STOP 1717118274591
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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 r307-tajo-171654460500151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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 ;