Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654371900031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654371900031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.0K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 06:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 06:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.3M 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716628724886

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=MultiCrashLeafsetExtension-PT-S16C08
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 09:18:46] [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 09:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:18:47] [INFO ] Load time of PNML (sax parser for PT used): 763 ms
[2024-05-25 09:18:47] [INFO ] Transformed 6876 places.
[2024-05-25 09:18:47] [INFO ] Transformed 9571 transitions.
[2024-05-25 09:18:47] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 878 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 9299 out of 9571 initially.
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-25 09:18:47] [INFO ] Computed 649 invariants in 517 ms
Incomplete random walk after 10000 steps, including 120 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 16) seen :8
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :4
[2024-05-25 09:18:48] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2024-05-25 09:18:49] [INFO ] Computed 649 invariants in 329 ms
[2024-05-25 09:18:50] [INFO ] [Real]Absence check using 54 positive place invariants in 88 ms returned sat
[2024-05-25 09:18:50] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 222 ms returned unsat
[2024-05-25 09:18:50] [INFO ] [Real]Absence check using 54 positive place invariants in 82 ms returned sat
[2024-05-25 09:18:51] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 260 ms returned sat
[2024-05-25 09:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:18:55] [INFO ] [Real]Absence check using state equation in 4012 ms returned unknown
[2024-05-25 09:18:55] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2024-05-25 09:18:56] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 250 ms returned sat
[2024-05-25 09:18:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:19:00] [INFO ] [Real]Absence check using state equation in 4078 ms returned unknown
[2024-05-25 09:19:00] [INFO ] [Real]Absence check using 54 positive place invariants in 81 ms returned sat
[2024-05-25 09:19:01] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 229 ms returned unsat
[2024-05-25 09:19:01] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2024-05-25 09:19:02] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned unsat
[2024-05-25 09:19:02] [INFO ] [Real]Absence check using 54 positive place invariants in 77 ms returned sat
[2024-05-25 09:19:03] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 252 ms returned sat
[2024-05-25 09:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:19:07] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:902)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2621)
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 09:19:07] [INFO ] [Real]Absence check using 54 positive place invariants in 74 ms returned sat
[2024-05-25 09:19:08] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 227 ms returned unsat
[2024-05-25 09:19:08] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2024-05-25 09:19:08] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 228 ms returned unsat
[2024-05-25 09:19:09] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2024-05-25 09:19:09] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 270 ms returned sat
[2024-05-25 09:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:19:13] [INFO ] [Real]Absence check using state equation in 4028 ms returned unknown
[2024-05-25 09:19:14] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2024-05-25 09:19:14] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 218 ms returned unsat
[2024-05-25 09:19:15] [INFO ] [Real]Absence check using 54 positive place invariants in 79 ms returned sat
[2024-05-25 09:19:15] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 217 ms returned unsat
[2024-05-25 09:19:16] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2024-05-25 09:19:16] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 238 ms returned sat
[2024-05-25 09:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:19:20] [INFO ] [Real]Absence check using state equation in 4149 ms returned unknown
[2024-05-25 09:19:21] [INFO ] [Real]Absence check using 54 positive place invariants in 84 ms returned sat
[2024-05-25 09:19:21] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 257 ms returned sat
[2024-05-25 09:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:19:25] [INFO ] [Real]Absence check using state equation in 4139 ms returned unknown
[2024-05-25 09:19:26] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2024-05-25 09:19:26] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 226 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 51, 1, 1, 1, 17, 1, 1, 51, 1, 1, 1, 51, 1] Max seen :[1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.23 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2172 transitions
Trivial Post-agglo rules discarded 2172 transitions
Performed 2172 trivial Post agglomeration. Transition count delta: 2172
Iterating post reduction 0 with 2172 rules applied. Total rules applied 2173 place count 6840 transition count 7399
Reduce places removed 2172 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4348 place count 4668 transition count 7396
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 8 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1900 places :
Symmetric choice reduction at 3 with 1900 rule applications. Total rules 6795 place count 2493 transition count 5224
Iterating global reduction 3 with 1900 rules applied. Total rules applied 8695 place count 2493 transition count 5224
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 8695 place count 2493 transition count 5212
Deduced a syphon composed of 12 places in 9 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 8719 place count 2481 transition count 5212
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 8953 place count 2247 transition count 3340
Iterating global reduction 3 with 234 rules applied. Total rules applied 9187 place count 2247 transition count 3340
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9221 place count 2230 transition count 3323
Free-agglomeration rule (complex) applied 163 times.
Iterating global reduction 3 with 163 rules applied. Total rules applied 9384 place count 2230 transition count 4798
Reduce places removed 163 places and 0 transitions.
Iterating post reduction 3 with 163 rules applied. Total rules applied 9547 place count 2067 transition count 4798
Partial Free-agglomeration rule applied 68 times.
Drop transitions removed 68 transitions
Iterating global reduction 4 with 68 rules applied. Total rules applied 9615 place count 2067 transition count 4798
Applied a total of 9615 rules in 2112 ms. Remains 2067 /6876 variables (removed 4809) and now considering 4798/9571 (removed 4773) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2113 ms. Remains : 2067/6876 places, 4798/9571 transitions.
Normalized transition count is 4401 out of 4798 initially.
// Phase 1: matrix 4401 rows 2067 cols
[2024-05-25 09:19:28] [INFO ] Computed 613 invariants in 77 ms
Incomplete random walk after 1000000 steps, including 20078 resets, run finished after 20183 ms. (steps per millisecond=49 ) properties (out of 6) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4565 ms. (steps per millisecond=219 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4538 ms. (steps per millisecond=220 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4555 ms. (steps per millisecond=219 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3878 resets, run finished after 4552 ms. (steps per millisecond=219 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4561 ms. (steps per millisecond=219 ) properties (out of 5) seen :0
[2024-05-25 09:20:11] [INFO ] Flow matrix only has 4401 transitions (discarded 397 similar events)
// Phase 1: matrix 4401 rows 2067 cols
[2024-05-25 09:20:11] [INFO ] Computed 613 invariants in 66 ms
[2024-05-25 09:20:12] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-25 09:20:12] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2024-05-25 09:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:13] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2024-05-25 09:20:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:20:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-25 09:20:14] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 111 ms returned sat
[2024-05-25 09:20:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:15] [INFO ] [Nat]Absence check using state equation in 1171 ms returned sat
[2024-05-25 09:20:15] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:20:15] [INFO ] [Nat]Added 2722 Read/Feed constraints in 501 ms returned sat
[2024-05-25 09:20:17] [INFO ] Deduced a trap composed of 224 places in 1571 ms of which 6 ms to minimize.
[2024-05-25 09:20:19] [INFO ] Deduced a trap composed of 317 places in 1582 ms of which 3 ms to minimize.
[2024-05-25 09:20:21] [INFO ] Deduced a trap composed of 379 places in 1598 ms of which 10 ms to minimize.
[2024-05-25 09:20:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5808 ms
[2024-05-25 09:20:22] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 422 ms.
[2024-05-25 09:20:23] [INFO ] Added : 18 causal constraints over 4 iterations in 1760 ms. Result :sat
[2024-05-25 09:20:23] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-25 09:20:23] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 111 ms returned sat
[2024-05-25 09:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:25] [INFO ] [Real]Absence check using state equation in 1396 ms returned sat
[2024-05-25 09:20:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:20:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-25 09:20:25] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2024-05-25 09:20:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:27] [INFO ] [Nat]Absence check using state equation in 1362 ms returned sat
[2024-05-25 09:20:30] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3008 ms returned sat
[2024-05-25 09:20:31] [INFO ] Deduced a trap composed of 380 places in 1609 ms of which 3 ms to minimize.
[2024-05-25 09:20:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1873 ms
[2024-05-25 09:20:32] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 866 ms.
[2024-05-25 09:20:34] [INFO ] Added : 23 causal constraints over 5 iterations in 2321 ms. Result :sat
[2024-05-25 09:20:34] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-25 09:20:34] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 93 ms returned unsat
[2024-05-25 09:20:35] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2024-05-25 09:20:35] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 104 ms returned sat
[2024-05-25 09:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:36] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2024-05-25 09:20:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:20:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 46 ms returned sat
[2024-05-25 09:20:37] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2024-05-25 09:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:20:38] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2024-05-25 09:20:41] [INFO ] [Nat]Added 2722 Read/Feed constraints in 3090 ms returned sat
[2024-05-25 09:20:43] [INFO ] Deduced a trap composed of 313 places in 1581 ms of which 3 ms to minimize.
[2024-05-25 09:20:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1835 ms
[2024-05-25 09:20:43] [INFO ] Computed and/alt/rep : 1683/4440/1683 causal constraints (skipped 2701 transitions) in 257 ms.
[2024-05-25 09:20:45] [INFO ] Added : 22 causal constraints over 5 iterations in 2191 ms. Result :sat
[2024-05-25 09:20:45] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2024-05-25 09:20:45] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 72 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1, 1, 1, 1] Max seen :[0, 0, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 2067 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2067/2067 places, 4798/4798 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2067 transition count 4797
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2066 transition count 4797
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 2066 transition count 4794
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 2063 transition count 4794
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 2060 transition count 4791
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 2060 transition count 4791
Applied a total of 14 rules in 391 ms. Remains 2060 /2067 variables (removed 7) and now considering 4791/4798 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 2060/2067 places, 4791/4798 transitions.
Normalized transition count is 4394 out of 4791 initially.
// Phase 1: matrix 4394 rows 2060 cols
[2024-05-25 09:20:46] [INFO ] Computed 613 invariants in 57 ms
Incomplete random walk after 1000000 steps, including 20078 resets, run finished after 19990 ms. (steps per millisecond=50 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3878 resets, run finished after 4510 ms. (steps per millisecond=221 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4515 ms. (steps per millisecond=221 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4538 ms. (steps per millisecond=220 ) properties (out of 3) seen :0
[2024-05-25 09:21:20] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
// Phase 1: matrix 4394 rows 2060 cols
[2024-05-25 09:21:20] [INFO ] Computed 613 invariants in 70 ms
[2024-05-25 09:21:20] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2024-05-25 09:21:20] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 105 ms returned sat
[2024-05-25 09:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:22] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2024-05-25 09:21:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:21:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2024-05-25 09:21:22] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 114 ms returned sat
[2024-05-25 09:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:24] [INFO ] [Nat]Absence check using state equation in 1633 ms returned sat
[2024-05-25 09:21:24] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:21:24] [INFO ] [Nat]Added 2722 Read/Feed constraints in 569 ms returned sat
[2024-05-25 09:21:26] [INFO ] Deduced a trap composed of 222 places in 1609 ms of which 2 ms to minimize.
[2024-05-25 09:21:28] [INFO ] Deduced a trap composed of 369 places in 1641 ms of which 2 ms to minimize.
[2024-05-25 09:21:30] [INFO ] Deduced a trap composed of 387 places in 1624 ms of which 2 ms to minimize.
[2024-05-25 09:21:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5761 ms
[2024-05-25 09:21:30] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 275 ms.
[2024-05-25 09:21:32] [INFO ] Added : 17 causal constraints over 4 iterations in 1578 ms. Result :sat
[2024-05-25 09:21:32] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 09:21:32] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2024-05-25 09:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:34] [INFO ] [Real]Absence check using state equation in 1487 ms returned sat
[2024-05-25 09:21:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:21:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 09:21:34] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 108 ms returned sat
[2024-05-25 09:21:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:35] [INFO ] [Nat]Absence check using state equation in 1401 ms returned sat
[2024-05-25 09:21:37] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1100 ms returned sat
[2024-05-25 09:21:38] [INFO ] Deduced a trap composed of 317 places in 1615 ms of which 3 ms to minimize.
[2024-05-25 09:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1861 ms
[2024-05-25 09:21:39] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 264 ms.
[2024-05-25 09:21:40] [INFO ] Added : 21 causal constraints over 5 iterations in 1700 ms. Result :sat
[2024-05-25 09:21:40] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2024-05-25 09:21:41] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 103 ms returned sat
[2024-05-25 09:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:42] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2024-05-25 09:21:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:21:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 37 ms returned sat
[2024-05-25 09:21:42] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 109 ms returned sat
[2024-05-25 09:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:21:44] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2024-05-25 09:21:46] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2806 ms returned sat
[2024-05-25 09:21:48] [INFO ] Deduced a trap composed of 597 places in 1586 ms of which 3 ms to minimize.
[2024-05-25 09:21:50] [INFO ] Deduced a trap composed of 255 places in 1732 ms of which 2 ms to minimize.
[2024-05-25 09:21:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3724 ms
[2024-05-25 09:21:50] [INFO ] Computed and/alt/rep : 1679/4433/1679 causal constraints (skipped 2698 transitions) in 258 ms.
[2024-05-25 09:21:52] [INFO ] Added : 24 causal constraints over 5 iterations in 1712 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 2060 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 144 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 2060/2060 places, 4791/4791 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2060/2060 places, 4791/4791 transitions.
Applied a total of 0 rules in 153 ms. Remains 2060 /2060 variables (removed 0) and now considering 4791/4791 (removed 0) transitions.
[2024-05-25 09:21:53] [INFO ] Flow matrix only has 4394 transitions (discarded 397 similar events)
[2024-05-25 09:21:53] [INFO ] Invariant cache hit.
[2024-05-25 09:21:58] [INFO ] Implicit Places using invariants in 4990 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 327, 330, 332, 336, 342, 350, 360, 371, 381, 382, 383, 384, 385, 386, 387, 388, 389, 397, 403, 407, 409, 411, 413, 432, 438, 440, 441, 442, 443, 444, 445, 446, 447, 448, 450, 452, 454, 458, 464, 472, 481, 489, 490, 491, 492, 493, 494, 495, 496, 497, 503, 507, 509, 511, 513, 515, 534, 540, 542, 543, 544, 545, 546, 547, 548, 549, 550, 552, 554, 556, 558, 562, 568, 575, 581, 582, 583, 584, 585, 586, 587, 588, 589, 593, 595, 597, 599, 601, 603, 622, 628, 630, 631, 632, 633, 634, 635, 636, 637, 638, 640, 642, 644, 646, 648, 652, 657, 661, 662, 663, 664, 665, 666, 667, 668, 669, 671, 673, 675, 677, 679, 681, 700, 706, 708, 709, 710, 711, 712, 713, 714, 715, 716, 718, 720, 722, 724, 726, 728, 731, 733, 734, 735, 736, 737, 738, 739, 740, 741, 743, 745, 747, 749, 751, 753, 772, 778, 780, 781, 782, 783, 784, 785, 786, 787, 788, 790, 792, 794, 796, 798, 800, 802, 804, 805, 806, 807, 808, 809, 810, 811, 812, 814, 816, 818, 820, 822, 824, 843, 845, 848, 850, 851, 852, 853, 854, 855, 856, 857, 858, 860, 862, 864, 866, 868, 870, 872, 874, 875, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 913, 919, 921, 922, 923, 924, 925, 926, 927, 928, 929, 931, 933, 935, 937, 939, 941, 943, 945, 946, 947, 948, 949, 950, 951, 952, 953, 955, 957, 959, 961, 963, 965, 984, 990, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1002, 1004, 1006, 1008, 1010, 1012, 1014, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1027, 1029, 1031, 1033, 1035, 1037, 1056, 1062, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1074, 1076, 1078, 1080, 1082, 1084, 1088, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1105, 1107, 1109, 1111, 1113, 1115, 1134, 1140, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1152, 1154, 1156, 1158, 1160, 1164, 1170, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1191, 1195, 1197, 1199, 1201, 1203, 1222, 1228, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1240, 1242, 1244, 1246, 1250, 1256, 1264, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1289, 1295, 1299, 1302, 1304, 1306, 1325, 1331, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1343, 1345, 1347, 1351, 1357, 1365, 1375, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1404, 1412, 1418, 1422, 1424, 1426, 1445, 1451, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1463, 1465, 1469, 1475, 1483, 1493, 1505, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1538, 1548, 1556, 1562, 1566, 1568, 1587, 1589, 1592, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1604, 1608, 1614, 1622, 1632, 1644, 1658, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1695, 1707, 1717, 1725, 1731, 1735, 1754]
Discarding 563 places :
Implicit Place search using SMT only with invariants took 5007 ms to find 563 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1497/2060 places, 4791/4791 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 1242 transition count 4536
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 1242 transition count 4536
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 765 place count 987 transition count 4281
Iterating global reduction 0 with 255 rules applied. Total rules applied 1020 place count 987 transition count 4281
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1023 place count 987 transition count 4278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1026 place count 984 transition count 4278
Applied a total of 1026 rules in 285 ms. Remains 984 /1497 variables (removed 513) and now considering 4278/4791 (removed 513) transitions.
[2024-05-25 09:21:58] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:21:58] [INFO ] Computed 50 invariants in 29 ms
[2024-05-25 09:21:59] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2024-05-25 09:21:59] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-25 09:21:59] [INFO ] Invariant cache hit.
[2024-05-25 09:22:00] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:22:23] [INFO ] Implicit Places using invariants and state equation in 24070 ms returned []
Implicit Place search using SMT with State Equation took 25234 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 984/2060 places, 4278/4791 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30680 ms. Remains : 984/2060 places, 4278/4791 transitions.
Normalized transition count is 3881 out of 4278 initially.
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:22:23] [INFO ] Computed 50 invariants in 23 ms
Incomplete random walk after 1000000 steps, including 21032 resets, run finished after 19295 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3023 resets, run finished after 3419 ms. (steps per millisecond=292 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3011 resets, run finished after 3405 ms. (steps per millisecond=293 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3005 resets, run finished after 3417 ms. (steps per millisecond=292 ) properties (out of 3) seen :0
[2024-05-25 09:22:53] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:22:53] [INFO ] Computed 50 invariants in 27 ms
[2024-05-25 09:22:53] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:22:53] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:22:54] [INFO ] [Real]Absence check using state equation in 797 ms returned sat
[2024-05-25 09:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:22:54] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:22:54] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:22:55] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2024-05-25 09:22:55] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:22:55] [INFO ] [Nat]Added 2722 Read/Feed constraints in 454 ms returned sat
[2024-05-25 09:22:56] [INFO ] Deduced a trap composed of 171 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:22:56] [INFO ] Deduced a trap composed of 156 places in 464 ms of which 1 ms to minimize.
[2024-05-25 09:22:57] [INFO ] Deduced a trap composed of 185 places in 463 ms of which 0 ms to minimize.
[2024-05-25 09:22:58] [INFO ] Deduced a trap composed of 191 places in 460 ms of which 1 ms to minimize.
[2024-05-25 09:22:58] [INFO ] Deduced a trap composed of 185 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:22:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3212 ms
[2024-05-25 09:22:59] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 229 ms.
[2024-05-25 09:22:59] [INFO ] Added : 17 causal constraints over 4 iterations in 1078 ms. Result :sat
[2024-05-25 09:23:00] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:23:00] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:23:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:00] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2024-05-25 09:23:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:23:01] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:23:01] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:23:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:01] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2024-05-25 09:23:03] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1617 ms returned sat
[2024-05-25 09:23:03] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 224 ms.
[2024-05-25 09:23:04] [INFO ] Added : 21 causal constraints over 5 iterations in 1107 ms. Result :sat
[2024-05-25 09:23:04] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:23:04] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:23:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:05] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2024-05-25 09:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:23:06] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:23:06] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 8 ms returned sat
[2024-05-25 09:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:06] [INFO ] [Nat]Absence check using state equation in 788 ms returned sat
[2024-05-25 09:23:07] [INFO ] [Nat]Added 2722 Read/Feed constraints in 972 ms returned sat
[2024-05-25 09:23:08] [INFO ] Deduced a trap composed of 245 places in 469 ms of which 1 ms to minimize.
[2024-05-25 09:23:09] [INFO ] Deduced a trap composed of 74 places in 556 ms of which 1 ms to minimize.
[2024-05-25 09:23:09] [INFO ] Deduced a trap composed of 89 places in 543 ms of which 1 ms to minimize.
[2024-05-25 09:23:10] [INFO ] Deduced a trap composed of 90 places in 530 ms of which 1 ms to minimize.
[2024-05-25 09:23:11] [INFO ] Deduced a trap composed of 98 places in 546 ms of which 1 ms to minimize.
[2024-05-25 09:23:11] [INFO ] Deduced a trap composed of 99 places in 546 ms of which 1 ms to minimize.
[2024-05-25 09:23:12] [INFO ] Deduced a trap composed of 87 places in 539 ms of which 1 ms to minimize.
[2024-05-25 09:23:13] [INFO ] Deduced a trap composed of 70 places in 548 ms of which 1 ms to minimize.
[2024-05-25 09:23:14] [INFO ] Deduced a trap composed of 98 places in 551 ms of which 1 ms to minimize.
[2024-05-25 09:23:15] [INFO ] Deduced a trap composed of 79 places in 545 ms of which 1 ms to minimize.
[2024-05-25 09:23:16] [INFO ] Deduced a trap composed of 98 places in 553 ms of which 1 ms to minimize.
[2024-05-25 09:23:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 8825 ms
[2024-05-25 09:23:16] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 215 ms.
[2024-05-25 09:23:17] [INFO ] Added : 17 causal constraints over 4 iterations in 945 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 112 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Applied a total of 0 rules in 109 ms. Remains 984 /984 variables (removed 0) and now considering 4278/4278 (removed 0) transitions.
[2024-05-25 09:23:18] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-25 09:23:18] [INFO ] Invariant cache hit.
[2024-05-25 09:23:19] [INFO ] Implicit Places using invariants in 1153 ms returned []
[2024-05-25 09:23:19] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-25 09:23:19] [INFO ] Invariant cache hit.
[2024-05-25 09:23:20] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:23:43] [INFO ] Implicit Places using invariants and state equation in 23805 ms returned []
Implicit Place search using SMT with State Equation took 24959 ms to find 0 implicit places.
[2024-05-25 09:23:43] [INFO ] Redundant transitions in 320 ms returned []
[2024-05-25 09:23:43] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
[2024-05-25 09:23:43] [INFO ] Invariant cache hit.
[2024-05-25 09:23:45] [INFO ] Dead Transitions using invariants and state equation in 1426 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26821 ms. Remains : 984/984 places, 4278/4278 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
Normalized transition count is 3881 out of 4278 initially.
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:23:45] [INFO ] Computed 50 invariants in 26 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2024-05-25 09:23:45] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:23:45] [INFO ] Computed 50 invariants in 29 ms
[2024-05-25 09:23:45] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:23:45] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:23:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:46] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2024-05-25 09:23:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:23:46] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:23:46] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:23:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:23:47] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-05-25 09:23:47] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:23:47] [INFO ] [Nat]Added 2722 Read/Feed constraints in 449 ms returned sat
[2024-05-25 09:23:48] [INFO ] Deduced a trap composed of 171 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:23:48] [INFO ] Deduced a trap composed of 156 places in 465 ms of which 1 ms to minimize.
[2024-05-25 09:23:49] [INFO ] Deduced a trap composed of 185 places in 458 ms of which 1 ms to minimize.
[2024-05-25 09:23:50] [INFO ] Deduced a trap composed of 191 places in 455 ms of which 1 ms to minimize.
[2024-05-25 09:23:50] [INFO ] Deduced a trap composed of 185 places in 466 ms of which 1 ms to minimize.
[2024-05-25 09:23:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3198 ms
[2024-05-25 09:23:51] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 223 ms.
[2024-05-25 09:23:51] [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.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: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) : [2] Max seen :[0]
Support contains 1 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4277
Applied a total of 2 rules in 219 ms. Remains 983 /984 variables (removed 1) and now considering 4277/4278 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 983/984 places, 4277/4278 transitions.
Normalized transition count is 3879 out of 4277 initially.
// Phase 1: matrix 3879 rows 983 cols
[2024-05-25 09:23:51] [INFO ] Computed 50 invariants in 24 ms
Incomplete random walk after 1000000 steps, including 21026 resets, run finished after 19211 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3018 resets, run finished after 3409 ms. (steps per millisecond=293 ) properties (out of 1) seen :0
[2024-05-25 09:24:14] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
// Phase 1: matrix 3879 rows 983 cols
[2024-05-25 09:24:14] [INFO ] Computed 50 invariants in 20 ms
[2024-05-25 09:24:14] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2024-05-25 09:24:14] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-25 09:24:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:24:15] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2024-05-25 09:24:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:24:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:24:15] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 11 ms returned sat
[2024-05-25 09:24:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:24:16] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2024-05-25 09:24:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:24:16] [INFO ] [Nat]Added 2722 Read/Feed constraints in 369 ms returned sat
[2024-05-25 09:24:17] [INFO ] Deduced a trap composed of 135 places in 458 ms of which 1 ms to minimize.
[2024-05-25 09:24:17] [INFO ] Deduced a trap composed of 168 places in 450 ms of which 1 ms to minimize.
[2024-05-25 09:24:18] [INFO ] Deduced a trap composed of 192 places in 447 ms of which 1 ms to minimize.
[2024-05-25 09:24:19] [INFO ] Deduced a trap composed of 184 places in 474 ms of which 1 ms to minimize.
[2024-05-25 09:24:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2748 ms
[2024-05-25 09:24:19] [INFO ] Computed and/alt/rep : 1342/1949/1342 causal constraints (skipped 2475 transitions) in 224 ms.
[2024-05-25 09:24:20] [INFO ] Added : 16 causal constraints over 4 iterations in 952 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 983 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 104 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 983/983 places, 4277/4277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 983/983 places, 4277/4277 transitions.
Applied a total of 0 rules in 110 ms. Remains 983 /983 variables (removed 0) and now considering 4277/4277 (removed 0) transitions.
[2024-05-25 09:24:20] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:24:20] [INFO ] Invariant cache hit.
[2024-05-25 09:24:21] [INFO ] Implicit Places using invariants in 1092 ms returned []
[2024-05-25 09:24:21] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:24:21] [INFO ] Invariant cache hit.
[2024-05-25 09:24:22] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:24:45] [INFO ] Implicit Places using invariants and state equation in 23406 ms returned []
Implicit Place search using SMT with State Equation took 24499 ms to find 0 implicit places.
[2024-05-25 09:24:45] [INFO ] Redundant transitions in 232 ms returned []
[2024-05-25 09:24:45] [INFO ] Flow matrix only has 3879 transitions (discarded 398 similar events)
[2024-05-25 09:24:45] [INFO ] Invariant cache hit.
[2024-05-25 09:24:46] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26306 ms. Remains : 983/983 places, 4277/4277 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 in 61890 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
Normalized transition count is 3881 out of 4278 initially.
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:24:46] [INFO ] Computed 50 invariants in 24 ms
Incomplete random walk after 10000 steps, including 209 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2024-05-25 09:24:47] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:24:47] [INFO ] Computed 50 invariants in 28 ms
[2024-05-25 09:24:47] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:24:47] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-25 09:24:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:24:48] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-05-25 09:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:24:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:24:48] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 6 ms returned sat
[2024-05-25 09:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:24:49] [INFO ] [Nat]Absence check using state equation in 810 ms returned sat
[2024-05-25 09:24:49] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:24:50] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1593 ms returned sat
[2024-05-25 09:24:51] [INFO ] Computed and/alt/rep : 1344/1952/1344 causal constraints (skipped 2475 transitions) in 225 ms.
[2024-05-25 09:24:51] [INFO ] Added : 21 causal constraints over 5 iterations in 1082 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 984 transition count 4276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 982 transition count 4276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 981 transition count 4275
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 981 transition count 4275
Applied a total of 6 rules in 249 ms. Remains 981 /984 variables (removed 3) and now considering 4275/4278 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 981/984 places, 4275/4278 transitions.
Normalized transition count is 3877 out of 4275 initially.
// Phase 1: matrix 3877 rows 981 cols
[2024-05-25 09:24:52] [INFO ] Computed 50 invariants in 27 ms
Incomplete random walk after 1000000 steps, including 21029 resets, run finished after 19106 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3016 resets, run finished after 3381 ms. (steps per millisecond=295 ) properties (out of 1) seen :0
[2024-05-25 09:25:14] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
// Phase 1: matrix 3877 rows 981 cols
[2024-05-25 09:25:15] [INFO ] Computed 50 invariants in 28 ms
[2024-05-25 09:25:15] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:25:15] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 8 ms returned sat
[2024-05-25 09:25:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:25:15] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2024-05-25 09:25:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:25:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:25:16] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-25 09:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:25:16] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2024-05-25 09:25:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:25:18] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1044 ms returned sat
[2024-05-25 09:25:18] [INFO ] Deduced a trap composed of 227 places in 452 ms of which 1 ms to minimize.
[2024-05-25 09:25:19] [INFO ] Deduced a trap composed of 102 places in 563 ms of which 1 ms to minimize.
[2024-05-25 09:25:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1293 ms
[2024-05-25 09:25:19] [INFO ] Computed and/alt/rep : 1339/1936/1339 causal constraints (skipped 2476 transitions) in 213 ms.
[2024-05-25 09:25:20] [INFO ] Added : 21 causal constraints over 5 iterations in 1072 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 981 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 103 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 981/981 places, 4275/4275 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 981/981 places, 4275/4275 transitions.
Applied a total of 0 rules in 104 ms. Remains 981 /981 variables (removed 0) and now considering 4275/4275 (removed 0) transitions.
[2024-05-25 09:25:20] [INFO ] Flow matrix only has 3877 transitions (discarded 398 similar events)
[2024-05-25 09:25:20] [INFO ] Invariant cache hit.
[2024-05-25 09:25:21] [INFO ] Implicit Places using invariants in 1127 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1133 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 980/981 places, 4275/4275 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 979 transition count 4274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 978 transition count 4273
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 978 transition count 4273
Applied a total of 4 rules in 165 ms. Remains 978 /980 variables (removed 2) and now considering 4273/4275 (removed 2) transitions.
[2024-05-25 09:25:22] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-25 09:25:22] [INFO ] Computed 49 invariants in 32 ms
[2024-05-25 09:25:23] [INFO ] Implicit Places using invariants in 1143 ms returned []
[2024-05-25 09:25:23] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-25 09:25:23] [INFO ] Invariant cache hit.
[2024-05-25 09:25:24] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:25:46] [INFO ] Implicit Places using invariants and state equation in 22757 ms returned []
Implicit Place search using SMT with State Equation took 23903 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 978/981 places, 4273/4275 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25306 ms. Remains : 978/981 places, 4273/4275 transitions.
Normalized transition count is 3875 out of 4273 initially.
// Phase 1: matrix 3875 rows 978 cols
[2024-05-25 09:25:46] [INFO ] Computed 49 invariants in 30 ms
Incomplete random walk after 1000000 steps, including 21027 resets, run finished after 19218 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3005 resets, run finished after 3388 ms. (steps per millisecond=295 ) properties (out of 1) seen :0
[2024-05-25 09:26:08] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
// Phase 1: matrix 3875 rows 978 cols
[2024-05-25 09:26:08] [INFO ] Computed 49 invariants in 34 ms
[2024-05-25 09:26:08] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:26:08] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:26:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:26:09] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2024-05-25 09:26:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:26:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:26:09] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-25 09:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:26:10] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2024-05-25 09:26:10] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:26:12] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2163 ms returned sat
[2024-05-25 09:26:13] [INFO ] Deduced a trap composed of 225 places in 462 ms of which 1 ms to minimize.
[2024-05-25 09:26:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 646 ms
[2024-05-25 09:26:13] [INFO ] Computed and/alt/rep : 1338/1928/1338 causal constraints (skipped 2475 transitions) in 217 ms.
[2024-05-25 09:26:14] [INFO ] Added : 21 causal constraints over 5 iterations in 1086 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 978 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 105 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 978/978 places, 4273/4273 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 978/978 places, 4273/4273 transitions.
Applied a total of 0 rules in 106 ms. Remains 978 /978 variables (removed 0) and now considering 4273/4273 (removed 0) transitions.
[2024-05-25 09:26:15] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-25 09:26:15] [INFO ] Invariant cache hit.
[2024-05-25 09:26:16] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-05-25 09:26:16] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-25 09:26:16] [INFO ] Invariant cache hit.
[2024-05-25 09:26:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:26:38] [INFO ] Implicit Places using invariants and state equation in 22652 ms returned []
Implicit Place search using SMT with State Equation took 23764 ms to find 0 implicit places.
[2024-05-25 09:26:38] [INFO ] Redundant transitions in 210 ms returned []
[2024-05-25 09:26:38] [INFO ] Flow matrix only has 3875 transitions (discarded 398 similar events)
[2024-05-25 09:26:38] [INFO ] Invariant cache hit.
[2024-05-25 09:26:40] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25516 ms. Remains : 978/978 places, 4273/4273 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 in 113470 ms.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Normalized transition count is 3881 out of 4278 initially.
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:26:40] [INFO ] Computed 50 invariants in 24 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
[2024-05-25 09:26:40] [INFO ] Flow matrix only has 3881 transitions (discarded 397 similar events)
// Phase 1: matrix 3881 rows 984 cols
[2024-05-25 09:26:40] [INFO ] Computed 50 invariants in 26 ms
[2024-05-25 09:26:40] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:26:40] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 7 ms returned sat
[2024-05-25 09:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:26:41] [INFO ] [Real]Absence check using state equation in 941 ms returned sat
[2024-05-25 09:26:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:26:41] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:26:41] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-25 09:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:26:42] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2024-05-25 09:26:42] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:26:43] [INFO ] [Nat]Added 2722 Read/Feed constraints in 980 ms returned sat
[2024-05-25 09:26:44] [INFO ] Deduced a trap composed of 245 places in 467 ms of which 0 ms to minimize.
[2024-05-25 09:26:44] [INFO ] Deduced a trap composed of 74 places in 553 ms of which 1 ms to minimize.
[2024-05-25 09:26:45] [INFO ] Deduced a trap composed of 89 places in 548 ms of which 1 ms to minimize.
[2024-05-25 09:26:46] [INFO ] Deduced a trap composed of 90 places in 538 ms of which 1 ms to minimize.
[2024-05-25 09:26:46] [INFO ] Deduced a trap composed of 98 places in 542 ms of which 0 ms to minimize.
[2024-05-25 09:26:46] [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 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 4278/4278 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 984 transition count 4277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 983 transition count 4277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 982 transition count 4276
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 982 transition count 4276
Applied a total of 4 rules in 258 ms. Remains 982 /984 variables (removed 2) and now considering 4276/4278 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 982/984 places, 4276/4278 transitions.
Normalized transition count is 3879 out of 4276 initially.
// Phase 1: matrix 3879 rows 982 cols
[2024-05-25 09:26:47] [INFO ] Computed 50 invariants in 23 ms
Incomplete random walk after 1000000 steps, including 21029 resets, run finished after 19199 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3017 resets, run finished after 3408 ms. (steps per millisecond=293 ) properties (out of 1) seen :0
[2024-05-25 09:27:09] [INFO ] Flow matrix only has 3879 transitions (discarded 397 similar events)
// Phase 1: matrix 3879 rows 982 cols
[2024-05-25 09:27:09] [INFO ] Computed 50 invariants in 22 ms
[2024-05-25 09:27:09] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:27:10] [INFO ] [Real]Absence check using 31 positive and 19 generalized place invariants in 5 ms returned sat
[2024-05-25 09:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:27:10] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2024-05-25 09:27:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:27:10] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:27:10] [INFO ] [Nat]Absence check using 31 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-25 09:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:27:11] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2024-05-25 09:27:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:27:12] [INFO ] [Nat]Added 2722 Read/Feed constraints in 999 ms returned sat
[2024-05-25 09:27:13] [INFO ] Deduced a trap composed of 290 places in 457 ms of which 1 ms to minimize.
[2024-05-25 09:27:13] [INFO ] Deduced a trap composed of 100 places in 553 ms of which 1 ms to minimize.
[2024-05-25 09:27:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1286 ms
[2024-05-25 09:27:14] [INFO ] Computed and/alt/rep : 1341/1939/1341 causal constraints (skipped 2476 transitions) in 218 ms.
[2024-05-25 09:27:15] [INFO ] Added : 19 causal constraints over 4 iterations in 958 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 982 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 104 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 982/982 places, 4276/4276 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 982/982 places, 4276/4276 transitions.
Applied a total of 0 rules in 107 ms. Remains 982 /982 variables (removed 0) and now considering 4276/4276 (removed 0) transitions.
[2024-05-25 09:27:15] [INFO ] Flow matrix only has 3879 transitions (discarded 397 similar events)
[2024-05-25 09:27:15] [INFO ] Invariant cache hit.
[2024-05-25 09:27:16] [INFO ] Implicit Places using invariants in 1136 ms returned [234]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1140 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 981/982 places, 4276/4276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 980 transition count 4275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 980 transition count 4275
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 979 transition count 4274
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 979 transition count 4274
Applied a total of 4 rules in 161 ms. Remains 979 /981 variables (removed 2) and now considering 4274/4276 (removed 2) transitions.
[2024-05-25 09:27:16] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2024-05-25 09:27:16] [INFO ] Computed 49 invariants in 26 ms
[2024-05-25 09:27:17] [INFO ] Implicit Places using invariants in 1151 ms returned []
[2024-05-25 09:27:17] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-25 09:27:17] [INFO ] Invariant cache hit.
[2024-05-25 09:27:18] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:27:40] [INFO ] Implicit Places using invariants and state equation in 22914 ms returned []
Implicit Place search using SMT with State Equation took 24067 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/982 places, 4274/4276 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25475 ms. Remains : 979/982 places, 4274/4276 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2024-05-25 09:27:40] [INFO ] Computed 49 invariants in 28 ms
Incomplete random walk after 1000000 steps, including 21026 resets, run finished after 19256 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3013 resets, run finished after 3442 ms. (steps per millisecond=290 ) properties (out of 1) seen :0
[2024-05-25 09:28:03] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2024-05-25 09:28:03] [INFO ] Computed 49 invariants in 27 ms
[2024-05-25 09:28:03] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2024-05-25 09:28:03] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2024-05-25 09:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:28:04] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2024-05-25 09:28:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:28:04] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2024-05-25 09:28:04] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2024-05-25 09:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:28:05] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2024-05-25 09:28:05] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:28:06] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1234 ms returned sat
[2024-05-25 09:28:07] [INFO ] Deduced a trap composed of 208 places in 464 ms of which 1 ms to minimize.
[2024-05-25 09:28:08] [INFO ] Deduced a trap composed of 83 places in 550 ms of which 1 ms to minimize.
[2024-05-25 09:28:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1291 ms
[2024-05-25 09:28:08] [INFO ] Computed and/alt/rep : 1340/1931/1340 causal constraints (skipped 2475 transitions) in 219 ms.
[2024-05-25 09:28:09] [INFO ] Added : 18 causal constraints over 4 iterations in 990 ms. Result :sat
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 119 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 104 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2024-05-25 09:28:09] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-25 09:28:09] [INFO ] Invariant cache hit.
[2024-05-25 09:28:10] [INFO ] Implicit Places using invariants in 1114 ms returned []
[2024-05-25 09:28:10] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-25 09:28:10] [INFO ] Invariant cache hit.
[2024-05-25 09:28:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2024-05-25 09:28:34] [INFO ] Implicit Places using invariants and state equation in 23722 ms returned []
Implicit Place search using SMT with State Equation took 24838 ms to find 0 implicit places.
[2024-05-25 09:28:34] [INFO ] Redundant transitions in 210 ms returned []
[2024-05-25 09:28:34] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2024-05-25 09:28:34] [INFO ] Invariant cache hit.
[2024-05-25 09:28:36] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26583 ms. Remains : 979/979 places, 4274/4274 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 115600 ms.
[2024-05-25 09:28:36] [INFO ] Flatten gal took : 336 ms
[2024-05-25 09:28:36] [INFO ] Applying decomposition
[2024-05-25 09:28:36] [INFO ] Flatten gal took : 174 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/graph16396810542641565708.txt' '-o' '/tmp/graph16396810542641565708.bin' '-w' '/tmp/graph16396810542641565708.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16396810542641565708.bin' '-l' '-1' '-v' '-w' '/tmp/graph16396810542641565708.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:28:37] [INFO ] Decomposing Gal with order
[2024-05-25 09:28:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:28:38] [INFO ] Removed a total of 8248 redundant transitions.
[2024-05-25 09:28:38] [INFO ] Flatten gal took : 851 ms
[2024-05-25 09:28:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 2404 labels/synchronizations in 209 ms.
[2024-05-25 09:28:38] [INFO ] Time to serialize gal into /tmp/UpperBounds17253962776944101471.gal : 56 ms
[2024-05-25 09:28:38] [INFO ] Time to serialize properties into /tmp/UpperBounds17262319415987393429.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/UpperBounds17253962776944101471.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17262319415987393429.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 ...285
Loading property file /tmp/UpperBounds17262319415987393429.prop.
Detected timeout of ITS tools.
[2024-05-25 09:52:10] [INFO ] Flatten gal took : 717 ms
[2024-05-25 09:52:11] [INFO ] Time to serialize gal into /tmp/UpperBounds7509572590839542843.gal : 133 ms
[2024-05-25 09:52:11] [INFO ] Time to serialize properties into /tmp/UpperBounds13232120675748405716.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7509572590839542843.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13232120675748405716.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/UpperBounds13232120675748405716.prop.
Detected timeout of ITS tools.
[2024-05-25 10:15:40] [INFO ] Flatten gal took : 898 ms
[2024-05-25 10:15:48] [INFO ] Input system was already deterministic with 4278 transitions.
[2024-05-25 10:15:48] [INFO ] Transformed 984 places.
[2024-05-25 10:15:48] [INFO ] Transformed 4278 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 10:15:49] [INFO ] Time to serialize gal into /tmp/UpperBounds9240489779243964054.gal : 38 ms
[2024-05-25 10:15:49] [INFO ] Time to serialize properties into /tmp/UpperBounds10977342334392437355.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/UpperBounds9240489779243964054.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10977342334392437355.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/UpperBounds10977342334392437355.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11677612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15746224 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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="MultiCrashLeafsetExtension-PT-S16C08"
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 MultiCrashLeafsetExtension-PT-S16C08, 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 r263-tall-171654371900031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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